Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "path optimization" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 29
Tytuł:
A relation of dominance for the bicriterion bus routing problem
Autorzy:
Widuch, J.
Powiązania:
https://bibliotekanauki.pl/articles/330092.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
multicriteria optimization
set of nondominated solutions
bicriterion shortest path problem
variable weights
label correcting algorithm
transportation problem
optymalizacja wielokryterialna
zbiór rozwiązań niezdominowanych
dwukryterialny problem najkrótszej ścieżki
zmienne wagi
problem transportowy
Opis:
A bicriterion bus routing (BBR) problem is described and analysed. The objective is to find a route from the start stop to the final stop minimizing the time and the cost of travel simultaneously. Additionally, the time of starting travel at the start stop is given. The BBR problem can be resolved using methods of graph theory. It comes down to resolving a bicriterion shortest path (BSP) problem in a multigraph with variable weights. In the paper, differences between the problem with constant weights and that with variable weights are described and analysed, with particular emphasis on properties satisfied only for the problem with variable weights and the description of the influence of dominated partial solutions on non-dominated final solutions. This paper proposes methods of estimation a dominated partial solution for the possibility of obtaining a non-dominated final solution from it. An algorithm for solving the BBR problem implementing these estimation methods is proposed and the results of experimental tests are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 1; 133-155
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Repetitive neurocontroller with disturbance feedforward path active in the pass-to-pass direction for a VSI inverter with an output LC filter
Autorzy:
Ufnalski, B.
Grzesiak, L. M.
Powiązania:
https://bibliotekanauki.pl/articles/200017.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
repetitive control
feedforward neural network
dynamic optimization problem
repetitive disturbance rejection
voltage source inverter
disturbance dual feedforward path
sterowanie powtarzalne
sieci neuronowe
problem optymalizacji dynamicznej
przetwornica napięcia
odrzucanie zakłóceń
Opis:
An enhancement to the previously developed repetitive neurocontroller (RNC) is discussed and investigated in the paper. Originally, the time-base generator (TBG) has been used to produce the only input signal for the neural approximator. The resulting search space makes the dynamic optimization problem (DOP) of shaping the control signal solvable with the help of a function approximator such as the feed-forward neural network (FFNN). The plant under consideration, i.e. a constant-amplitude constant-frequency voltage-source inverter (CACF VSI) with an output LC filter, is assumed to be equipped with the disturbance load current sensor to enable implementation of the disturbance feed-forward (pDFF) path as a part of the non-repetitive subsystem acting in the along the pass p-direction. An investigation has been undertaken to explore potential benefits of using this signal also as an additional input for the RNC to augment the approximation space and potentially enhance the convergence rate of the real-time search process. It is numerically demonstrated in the paper that the disturbance feed-forward path active in the pass-to-pass k-direction (kDFF) improves the dynamics of the repetitive part as well indeed.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2016, 64, 1; 115-125
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization-based approach to path planning for closed chain robot systems
Autorzy:
Szynkiewicz, W.
Błaszczyk, J.
Powiązania:
https://bibliotekanauki.pl/articles/930153.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
łańcuch zamknięty
planowanie trajektorii
optymalizacja nieliniowa
closed chain
path planning
nonlinear optimization
Opis:
An application of advanced optimization techniques to solve the path planning problem for closed chain robot systems is proposed. The approach to path planning is formulated as a "quasi-dynamic" NonLinear Programming (NLP) problem with equality and inequality constraints in terms of the joint variables. The essence of the method is to find joint paths which satisfy the given constraints and minimize the proposed performance index. For numerical solution of the NLP problem, the IPOPT solver is used, which implements a nonlinear primal-dual interior-point method, one of the leading techniques for large-scale nonlinear optimization.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 4; 659-670
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
System wyznaczania ścieżek przemieszczeń dla grupy autonomicznych mobilnych robotów-agentów rozpoznawczo-inspekcyjnych
A system of path determination for a group of autonomous, mobile inspection robots-agents
Autorzy:
Szatkiewicz, T.
Powiązania:
https://bibliotekanauki.pl/articles/157701.pdf
Data publikacji:
2013
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
systemy agentowe
inspekcja obszaru
rozpoznawanie obszaru
ustalanie trajektorii przemieszczeń
multi-agent systems
movement path determination
trajectory optimization
field inspections
field recognition
Opis:
W artykule opisano oryginalny system wieloagentowy, którego podstawowym celem jest rozpoznanie, a następnie przeprowadzanie inspekcji nieznanego obszaru przy wykorzystaniu grupy autonomicznych mobilnych robotów-agentów. Wnioski z przeprowadzonych symulacji systemu pozwalają na rozpoznanie obszaru wiedzy, dotyczącego szczególnych aspektów systemów wieloagentowych takich jak min: metody ustalania ścieżek przemieszczeń agentów mobilnych czy wpływ liczby agentów na globalną efektywność systemu.
The paper describes an original multi-agent system [1, 2, 10, 11] whose primary purpose is to recognize and, subsequently, to inspect continuously a limited area. The agents are autonomous mobile robots, equipped with a set of sensors that are capable of scanning the examined area and collecting information on significant features. The main decision problem necessary to be solved in the system is to determine the paths for the robotic agents in such a way that the area is recognized in the shortest time, and the inspection process is the most effective from the point of view of the state of knowledge about the significant features of the examined area. The agents should act collectively in such a way as to balance their load and, hence, to optimize the system performance. In the paper there are described in detail the consecutive steps of the algorithm (Fig. 1), and, in particular, the methodology for determining the direction of motion of robotic agents (Subsections 5.3 and 5.4). The presented multi-agent system was implemented in the Webots environment [4]. Educational robots of the e-puck class were used as robots-agents (Fig. 2), [3]. Implementation of the system made it possible to perform a series of experiments which allowed drawing interesting conclusions (Section 6) on the effectiveness of the system in achieving its primary objectives. At the end of the paper the experiment is illustrated (Fig. 7), and also the growth chart of recognition of the area for each robotic agent is presented (Fig. 8).
Źródło:
Pomiary Automatyka Kontrola; 2013, R. 59, nr 11, 11; 1155-1159
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A bioinspired optimization strategy: to minimize the travel segment of the nozzle to accelerate the fused deposition modeling process
Autorzy:
Sridhar, Sundarraj
Aditya, K.
Venkatraman, Ramamoorthi
Venkatesan, M.
Powiązania:
https://bibliotekanauki.pl/articles/27311459.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
additive manufacturing
fused deposition modeling
extruder path
ant colony optimization
build time
produkcja dodatkowa
modelowanie osadzania stopionego
ścieżka wytłaczarki
optymalizacja kolonii mrówek
czas budowy
Opis:
The fused deposition modeling process of digital printing uses a layer-by-layer approach to form a three-dimensional structure. Digital printing takes more time to fabricate a 3D model, and the speed varies depending on the type of 3D printer, material, geometric complexity, and process parameters. A shorter path for the extruder can speed up the printing process. However, the time taken for the extruder during printing (deposition) cannot be reduced, but the time taken for the extruder travel (idle move) can be reduced. In this study, the idle travel of the nozzle is optimized using a bioinspired technique called "ant colony optimization" (ACO) by reducing the travel transitions. The ACO algorithm determines the shortest path of the nozzle to reduce travel and generates the tool paths as G-codes. The proposed method’s G-code is implemented and compared with the G-code generated by the commercial slicer, Cura, in terms of build time. Experiments corroborate this finding: the G-code generated by the ACO algorithm accelerates the FDM process by reducing the travel movements of the nozzle, hence reducing the part build time (printing time) and increasing the strength of the printed object.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 4; art. no. e146236
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Network routing method for ships and other moving objects using MATLAB
Autorzy:
Sakharov, Vladimir V.
Chertkov, Alexandr A.
Ariefjew, Igor B.
Powiązania:
https://bibliotekanauki.pl/articles/135140.pdf
Data publikacji:
2020
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
algorithm
path
optimization
transport
automation
moving object
Opis:
Task planning involves automating the creation of the routes for vessels with known coordinates in a confined space. The management of vessel release in a given area affects the time required for a vessel to complete its voyage, and maximizing vessel performance involves identifying the shortest route. A key issue in automating the generation of the optimal (shortest) routes is selecting the appropriate mathematical apparatus. This paper considers an optimization method based on a recursive algorithm using Bellman-Ford routing tasks for large dimensions. Unlike other optimization techniques, the proposed method enables the shortest path to be assessed in a network model with a complex topology, even if there are arcs with negative weights. The practical implementation of the modified Floyd algorithm was demonstrated using a sample automated build and using it to calculate a network model with a complex topology, using an iterative procedure for a program prepared in MATLAB. Implementation of the computer model is simple, and unlike existing models, it eliminates restrictions associated with the presence of negative weights and cycles on a network and automates search shortcuts in ground branch functional means in MATLAB. To confirm the accuracy of the obtained results, we performed an example calculation using the network. The proposed algorithm and recursive procedure are recommended for finding energy-efficient solutions during the management of mobile objects on waterways.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2020, 62 (134); 61-68
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An ACO Path Planner Using a FIS for Path Selection Adjusted with a Simple Tuning Algorithm
Autorzy:
Porta-Garcia, M.
Montiel, O.
Sepulveda, R.
Powiązania:
https://bibliotekanauki.pl/articles/384490.pdf
Data publikacji:
2008
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
ant colony optimization
ACO
autonomous mobile robot
navigation
fuzzy logic
path planning
Opis:
This paper presents a path planner application for mobile robots based on Ant Colony Optimization (ACO). The selection of the optimal path relies in the criterion of a Fuzzy Inference System (FIS), which is adjusted using a Simple Tuning Algorithm (STA). The path planner can be executed in Mode I and Mode II. The first mode only works in the virtual environment of the interface, while Mode II embraces the wireless communication with a real robot; once the ACO algorithm finds the best route, the coordinates are sent to a mobile robot via Bluetooth communication; if the robot senses a new obstacle, the computer is notified and does a rerouting routine in order to avoid the obstacle and reach the goal. In other words, the application supports dynamic search spaces.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2008, 2, 1; 5-11
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Machining performance optimization of Parallel Kinematic Machines tools with regard to their anisotropic behaviour
Autorzy:
Pateloup, S.
Bonnemains, T.
Chanal, H.
Bouzgarrou, B. C.
Duc, E.
Ray, P.
Powiązania:
https://bibliotekanauki.pl/articles/1429122.pdf
Data publikacji:
2008
Wydawca:
Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych
Tematy:
parallel kinematic machine too
kinematic model
static model
tool path optimization
Opis:
Today, Parallel Kinematic Machines tools (PKMs) appear in automotive and aeronautic industries. These machines allow a benefit of productivity due to their higher kinematics performances than Serial Kinematic Machines tools (SKMs). However, their machining accuracy is lower. Moreover, the compensation of the defects which penalizes the machined parts quality is difficult due to their anisotropic behaviour. Thus, this article deals with the development of methods improving the machined parts quality and the productivity. In order to improve parts quality, the static behaviour of the machine structure is considered with a model taking into account joints and legs compliances. Then, it allows determining a static workspace. About the productivity, the improvement of kinematics performances is performed through an optimization work of the non productive tool path between cutting operations. The computed tool path must verify a minimum time constraint and avoid collisions between the tool and the machined part. All the methods are illustrated with the PKM Tripteor X7 developed by PCI.
Źródło:
Journal of Machine Engineering; 2008, 8, 4; 13-24
1895-7595
2391-8071
Pojawia się w:
Journal of Machine Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Global path planning for multiple AUVs using GWO
Autorzy:
Panda, Madhusmita
Das, Bikramaditya
Pati, Bibhuti
Powiązania:
https://bibliotekanauki.pl/articles/229749.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Autonomous Underwater Vehicle
AUV
Genetic Algorithm
GA
Global Path Planning
GPP
Grey Wolf Optimization
GWO
Sliding Mode Control
SMC
waypoints
Opis:
In global path planning (GPP), an autonomous underwater vehicle (AUV) tracks a predefined path. The main objective of GPP is to generate a collision free sub-optimal path with minimum path cost. The path is defined as a set of segments, passing through selected nodes known as waypoints. For smooth planar motion, the path cost is a function of the path length, the threat cost and the cost of diving. Path length is the total distance travelled from start to end point, threat cost is the penalty of collision with the obstacle and cost of diving is the energy expanse for diving deeper in ocean. This paper addresses the GPP problem for multiple AUVs in formation. Here, Grey Wolf Optimization (GWO) algorithm is used to find the suboptimal path for multiple AUVs in formation. The results obtained are compared to the results of applying Genetic Algorithm (GA) to the same problem. GA concept is simple to understand, easy to implement and supports multi-objective optimization. It is robust to local minima and have wide applications in various fields of science, engineering and commerce. Hence, GA is used for this comparative study. The performance analysis is based on computational time, length of the path generated and the total path cost. The resultant path obtained using GWO is found to be better than GA in terms of path cost and processing time. Thus, GWO is used as the GPP algorithm for three AUVs in formation. The formation follows leader-follower topography. A sliding mode controller (SMC) is developed to minimize the tracking error based on local information while maintaining formation, as mild communication exists. The stability of the sliding surface is verified by Lyapunov stability analysis. With proper path planning, the path cost can be minimized as AUVs can reach their target in less time with less energy expanses. Thus, lower path cost leads to less expensive underwater missions.
Źródło:
Archives of Control Sciences; 2020, 30, 1; 77-100
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic control of a class of discrete event systems using a state reconstruction algorithm
Autorzy:
Martinelli, F.
Nicosia, S.
Valigi, P.
Powiązania:
https://bibliotekanauki.pl/articles/205600.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
discrete events systems
optymalizacja
sterowanie
teoria systemów
Kanbaal systems
optimization
ordinal optimization
production control
resource allocations
sample path analysis
Opis:
The problem of dynamic control of Discrete Event Dynamic Systems (DEDS) is addressed in this paper as a dynamic optimization problem : some resources must be allocated to the system in order to optimize a performance function which is assumed time-varying. The control scheme exploits a state reconstruction algorithm to compute an estimate of the performance for perturbed sample paths. The algorithm is based on the use of data extracted from the observation of the system and allows to accurately reconstruct its state behavior, for resource allocations different from the nominal one. The proposed control scheme is then used for dynamic allocation of buffer capacities in mamlfaeturing systems, such as Kanban systems. A parallel implementation of the whole algorithm is also mentioned.
Źródło:
Control and Cybernetics; 2000, 29, 1; 275-294
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Flight path management of an aircraft in emergency situation
Autorzy:
Majka, A.
Powiązania:
https://bibliotekanauki.pl/articles/248107.pdf
Data publikacji:
2014
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
general aviation
flight path optimization
flight safety
Opis:
A distress event i.e. loss of engine power, structural damage etc., creates a major emergency situation in General Aviation (GA) aircraft. It requires location of a safe-to-land runway within reach, and immediately planning and executing an effective flight path towards it. Currently, technological development in avionics allows creating a flight deck decision support tool for trajectory planning of GA aircraft in emergency situation. Principal part of the system constitutes flight path optimization module. The automated path-planning algorithm generates within seconds an optimized trajectory to be followed by the pilot to safe landing. The trajectory planning is formulated as an optimal control problem, with the aircraft kinematics and dynamics expressed by the state equations, and objective functional that may capture the time, length, energy loss, etc. Obstacles and restricted or prohibited zones are represented as constraints on the positional state variables. The purpose of the paper is to present the method of flight path optimization of an aircraft in emergency, after a distress event, which makes impossible continuation of the original flight. The methods allow determining optimal escape flight path from special protection areas (e.g. cities etc.) or danger zones, as well. The simplified realization of the Ritz-Galerkin method was used in this work, which uses an approximate solution to boundary value problems for determining the optimal flight trajectory. The method allows determining the optimal trajectory of the flight satisfying the initial/final conditions and control functions and path constrains for an aircraft.
Źródło:
Journal of KONES; 2014, 21, 4; 327-334
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Effect of ship neural domain shape on safe and optimal trajectory
Autorzy:
Lisowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/24201475.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
artificial neural network model
method for optimization
dynamic programming method
ship safety domain
safe ship control
path planning
multi-object decision model
computer simulation
Opis:
This article presents the task of safely guiding a ship, taking into account the movement of many other marine units. An optimally neural modified algorithm for determining a safe trajectory is presented. The possible shapes of the domains assigned to other ships as traffic restrictions for the particular ship were subjected to a detailed analysis. The codes for the computer program Neuro-Constraints for generating these domains are presented. The results of the simulation tests of the algorithm for a navigational situation are presented. The safe trajectories of the ship were compared at different distances, changing the sailing conditions and ship sizes.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2023, 17, 1; 185--191
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A nature inspired collision avoidance algorithm for ships
Autorzy:
Lazarowska, A.
Powiązania:
https://bibliotekanauki.pl/articles/24201448.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
collision avoidance algorithm
safe own Ship's Trajectory
safe navigation
ant colony optimization
firefly agorithm
path planning
swarm intelligence
nature inspired computing
Opis:
Nature inspired algorithms are regarded as a powerful tool for solving real life problems. They do not guarantee to find the globally optimal solution, but can find a suboptimal, robust solution with an acceptable computational cost. The paper introduces an approach to the development of collision avoidance algorithms for ships based on the firefly algorithm, classified to the swarm intelligence methods. Such algorithms are inspired by the swarming behaviour of animals, such as e.g. birds, fish, ants, bees, fireflies. The description of the developed algorithm is followed by the presentation of simulation results, which show, that it might be regarded as an efficient method of solving the collision avoidance problem. Such algorithm is intended for use in the Decision Support System or in the Collision Avoidance Module of the Autonomous Navigation System for Maritime Autonomous Surface Ships.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2023, 17, 2; 341--346
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decision support system for collision avoidance at sea
Autorzy:
Lazarowska, A.
Powiązania:
https://bibliotekanauki.pl/articles/259152.pdf
Data publikacji:
2012
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
anti-collision system
collision avoidance
safety of navigation
safe ship control
computer simulation
decision support system
navigational data
marine navigation
path planning
ant colony optimization
Opis:
The paper presents design and realization of computer decision support system in collision situations of passage with greater quantity of met objects. The system was implemented into the real ship electro-navigational system onboard research and training ship m/v HORYZONT II. The radar system with Automatic Radar Plotting Aid constitutes a source of input data for algorithm determining safe trajectory of a ship. The article introduces radar data transmission details. The dynamic programming algorithm is used for the determination of safe optimal trajectory of own ship. The system enables navigational data transmission from radar system and automatic determining of safe manoeuvre or safe trajectory of a ship. Further development of navigator’s decision support system is also presented. Path Planning Subsystem is proposed for the determination of global optimal route between harbours with the use of Ant Colony Optimization algorithms.
Źródło:
Polish Maritime Research; 2012, S 1; 19-24
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Swarm intelligence approach to safe ship control
Autorzy:
Lazarowska, A.
Powiązania:
https://bibliotekanauki.pl/articles/258674.pdf
Data publikacji:
2015
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
ant colony optimization
collision avoidance
computer simulation
marine transport
path planning
safe ship control
safety at sea
swarm intelligence
Opis:
This paper presents an application of the Ant Colony Optimization (ACO) technique in a safe ship control system. The method developed solves the problem of path planning and collision avoidance of a ship in the open sea as well as in restricted waters. The structure of the developed safe ship control system is introduced, followed by a presentation of the applied algorithm. Results showing the problem-solving capability of the system are also included. The aim of the system developed is to increase automation of a safe ship control process. It is possible to apply the proposed method in Unmanned Surface Vehicles (USVs) control system, what will contribute to the enhancement of their autonomy.
Źródło:
Polish Maritime Research; 2015, 4; 33-40
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 29

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies