Informacja

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

Wyszukujesz frazę "path planning" wg kryterium: Temat


Tytuł:
Using Diagnostic Information for Planning an Energy-Optimal Path of an Autonomous Vehicle
Autorzy:
Szulim, Przemysław
Powiązania:
https://bibliotekanauki.pl/articles/503690.pdf
Data publikacji:
2014
Wydawca:
Międzynarodowa Wyższa Szkoła Logistyki i Transportu
Tematy:
path planning
bldc motor
diagnosis
Opis:
The article has presented a general idea for an algorithm that would allow for determining the optimal parameters of vehicle movement. The sources of energy dissipation have been assumed as follows: damage to the engine and the drive. In addition, the mathematical basis have been presented for assessing the impact of damage resulting from problems such as axial misalignment on the dissipated energy. In the second part of the paper, the concept of the algorithm has been detailed, paying special attention to certain problems that have arisen, and an algorithm has been proposed that determines the optimal movement parameters for a simplified case, when the vehicle is moving along a path determined in advance. In addition, the results of applying the algorithm for a simple case have been presented, as well as the impact of the particular energy dissipation parameters of the model on the optimal velocity profile of the vehicle. The plans for further research include estimating the impact of other damages, such as damaged bearings or demagnetising, on the energy dissipation. Further work on an algorithm is also planned that would allow for simultaneous determining of an optimal path as well as an optimal velocity profile.
Źródło:
Logistics and Transport; 2014, 21, 1; 104-114
1734-2015
Pojawia się w:
Logistics and Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A collision avoidance algorithm in Simultaneous Localization and Mapping problem for mobile platforms
Autorzy:
Małecki, Tomasz
Narkiewicz, Janusz
Powiązania:
https://bibliotekanauki.pl/articles/2086976.pdf
Data publikacji:
2022
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
algorithm
modeling
path planning
SLAM
Opis:
A collision avoidance algorithm applicable in simultaneous localization and mapping (SLAM) has been developed with a prospect of an on-line application for mobile platforms to search and map the operation area and avoid contact with obstacles. The algorithm, which was implemented in MATLAB software, is based on a linear discrete-time state transition model for determination of the platform position and orientation, and a ‘force’ points method for collision avoidance and definition of the next-step of platform motion. The proposed approach may be incorporated into real-time applications with limited on-board computational resources.
Źródło:
Journal of Theoretical and Applied Mechanics; 2022, 60, 2; 317--328
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ants Colony Optimisation of a Measuring Path of Prismatic Parts on a CMM
Autorzy:
Stojadinovic, S. M.
Majstorovic, V. D.
Durakbasa, N. M.
Sibalija, T. V.
Powiązania:
https://bibliotekanauki.pl/articles/221131.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
path planning
ACO
CMM
prismatic parts
Opis:
This paper presents optimisation of a measuring probe path in inspecting the prismatic parts on a CMM. The optimisation model is based on: (i) the mathematical model that establishes an initial collision-free path presented by a set of points, and (ii) the solution of Travelling Salesman Problem (TSP) obtained with Ant Colony Optimisation (ACO). In order to solve TSP, an ACO algorithm that aims to find the shortest path of ant colony movement (i.e. the optimised path) is applied. Then, the optimised path is compared with the measuring path obtained with online programming on CMM ZEISS UMM500 and with the measuring path obtained in the CMM inspection module of Pro/ENGINEER® software. The results of comparing the optimised path with the other two generated paths show that the optimised path is at least 20% shorter than the path obtained by on-line programming on CMM ZEISS UMM500, and at least 10% shorter than the path obtained by using the CMM module in Pro/ENGINEER®.
Źródło:
Metrology and Measurement Systems; 2016, 23, 1; 119-132
0860-8229
Pojawia się w:
Metrology and Measurement Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A New Strategy of Tool Path Planning Based on Hydrodynamic Data to Machine Marine Propeller
Autorzy:
Breteau, T.
Damay, T.
Duc, E.
Hascoët, J.-Y.
Powiązania:
https://bibliotekanauki.pl/articles/971234.pdf
Data publikacji:
2009
Wydawca:
Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych
Tematy:
propeller
tool path planning
machining methodology
Opis:
Marine propellers are complex surfaces that are usually machined with a perfect roughness in order not to disturb the theoretical flow. Because this requirement is penalizing from a manufacturing point of view, the global objective of the study is to propose an approach in which the machining parameters are linked to functional properties of the blade in order to remove the polishing phase. To reach this objective, hydrodynamic data are used: streak lines, that are computed during the propeller design phase, characterize the fluid behavior at the close vicinity of the blade. Those lines, which are theoretically continuous at the leading edge, turn out to be discontinuous, due to the computing method. To be consistent with the fluid behavior as much as possible, the idea presented in the paper is to compose a continuous trajectory, especially at the leading edge, to mill the surface. Thus, an algorithm is developed to plan tool paths which are smoothed at leading edge using Bezier curves. Moreover, this algorithm allows to quantify the cusp height at the leading edge to avoid a drop in performance using criteria linked to the dynamical behavior of a five axis machine tool. In this work, a strategy is developed and enables multiaxial milling of a blade surface by using geometric and hydrodynamic data and by respecting the associated constraints.
Źródło:
Journal of Machine Engineering; 2009, 9, 1; 29-40
1895-7595
2391-8071
Pojawia się w:
Journal of Machine Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Distributed Evolutionary Algorithm for Path Planning in Navigation Situation
Autorzy:
Śmierzchalski, R.
Kuczkowski, Ł.
Kolendo, P.
Jaworski, B.
Powiązania:
https://bibliotekanauki.pl/articles/116175.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
evolutionary algorithm
path planning
simulation environment
Opis:
This article presents the use of a multi‐population distributed evolutionary algorithm for path planning in navigation situation. The algorithm used is with partially exchanged population and migration between independently evolving populations. In this paper a comparison between a multi‐population and a classic single‐population algorithm takes place. The impact on the ultimate solution has been researched. It was shown that using several independent populations leads to an improvement of the ultimate solution compared to a single population approach. The concept was checked against a problem of maritime collision avoidance.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2013, 7, 2; 293-300
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ł:
FDA* : a focused single‐query grid based path planning algorithm
Autorzy:
Boumediene, Mouad
Mehennaoui, Lamine
Lachouri, Abderazzak
Powiązania:
https://bibliotekanauki.pl/articles/2141836.pdf
Data publikacji:
2021
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
motion planning
grid‐based
path planning
mobile robots
Opis:
Square grid representations of the state‐space are a commonly used tool in path planning. With applications in a variety of disciplines, including robotics, computational biology, game development, and beyond. However, in large‐scale and/or high dimensional environments the creation and manipulation of such structures become too expensive, especially in applications when an accurate representation is needed. In this paper, we present a method for reducing the cost of single‐query grid‐based path planning, by focusing the search to a smaller subset, that contains the optimal solution. This subset is represented by a hyperrectangle, the location, and dimensions of which are calculated departing from an initial feasible path found by a fast search using the RRT* algorithm. We also present an implementation of this focused discretization method called FDA*, a resolution optimal algorithm, where the A* algorithm is employed in searching the resulting graph for an optimal solution. We also demonstrate through simulation results, that the FDA* algorithm uses less memory and has a shorter run‐time compared to the classic A* and thus other graph‐based planning algorithms, and at the same time, the resulting path cost is less than that of regular RRT based algorithms.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2021, 15, 3; 37-43
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ewolucyjna metoda wyznaczania zadanej trajektorii statku z zastosowaniem mechanizmu niszowania
Evolutionary method of ship path planning with the application of niching mechanism
Autorzy:
Kolendo, P.
Jaworski, B.
Kuczkowski, Ł.
Śmierzchalski, R.
Witkowska, A.
Powiązania:
https://bibliotekanauki.pl/articles/267296.pdf
Data publikacji:
2013
Wydawca:
Politechnika Gdańska. Wydział Elektrotechniki i Automatyki
Tematy:
algorytmy ewolucyjne
niszowanie ścieżek przejść
planowanie ścieżek przejść
evolutionary algorithms
niching path planning
ship path planning
Opis:
Artykuł prezentuje implementację mechanizmu niszowania do ewolucyjnej metody wyznaczania zadanej trajektorii statku. W metodzie proponowane jest porównywanie różnorodności osobników w oparciu o fizyczną odległość między trajektoriami. Badania pokazują, że takie podejście zwiększa efektywność eksploracji przestrzeni rozwiązań dzięki czemu osiąga się poprawę końcowej wartości funkcji przystosowania. Problem poszukiwania ścieżki przejścia rozpatrywany jest w oparciu o sytuacje kolizyjne na morzu.
Paper presents the application of niching mechanism in the ship evolutionary path planning method. In presented method the comparison of individuals diversity is proposed according to physical distance between paths. Paper presents advantages and disadvantages of such approach in comparison to classic method. The problem is considered for several ship collision avoidance scenarios at different levels of difficulty.
Źródło:
Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej; 2013, 36; 97-101
1425-5766
2353-1290
Pojawia się w:
Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Real-time coordinated trajectory planning and obstacle avoidance for mobile robots
Autorzy:
McNinch, L. C.
Soltan, R. A.
Muske, K. R.
Ashrafiuon, H.
Peyton, J. C.
Powiązania:
https://bibliotekanauki.pl/articles/384978.pdf
Data publikacji:
2011
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
path planning
obstacle avoidance
ODE
mobile robots
Opis:
A novel method for real-time coordinated trajectory planning and obstacle avoidance of autonomous mobile robot systems is presented. The desired autonomous system trajectories are generated from a set of first order ODEs. The solution to this system of ODEs converges to either a desired target position or a closed orbit de.ned by a limit cycle. Coordinated control is achieved by utilizing the nature of limit cycles where independent, non-crossing paths are automatically generated from different initial positions that smoothly converge to the desired closed orbits. Real-time obstacle avoidance is achieved by specifying a transitional elliptically shaped closed orbit around the nearest obstacle blocking the path. This orbit determines an alternate trajectory that avoids the obstacle. When the obstacle no longer blocks a direct path to the original target trajectory, a transitional trajectory that returns to the original path is defined. The coordination and obstacle avoidance methods are demonstrated experimentally using differential-drive wheeled mobile robots.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 1; 23-29
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Chaotic path planning for grid coverage using a modified logistic-may map
Autorzy:
Petavratzis, Eleftherios
Moysis, Lazaros
Volos, Christos
Nistazakis, Hector
Muñoz-Pacheco, Jesus Manuel
Stouboulos, Ioannis
Powiązania:
https://bibliotekanauki.pl/articles/384718.pdf
Data publikacji:
2020
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
Logistic-May map
path planning
chaos
grid coverage
Opis:
A simple and efficient method for creating a motion trajectory is presented with an aim to achieve sufficient coverage of a given terrain. A chaotic map has been used in order that the motion trajectory should be unpredictable. The chaotic path generator which has been created, is used for implementing a robot’s movement in four and eight directions. The path generator is tested in various scenarios and the results are discussed. After thorough examination, the proposed method shows that the motion in eight directions gives better and very satisfactory results.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2020, 14, 2; 3-9
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Humanoid robot path planning using rapidly explored random tree and motion primitives
Autorzy:
Szumowski, Maksymilian
Zielinska, Teresa
Powiązania:
https://bibliotekanauki.pl/articles/1837364.pdf
Data publikacji:
2021
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
humanoid robot
path planning
rapidly exploring random tree
Opis:
Path planning is an essential function of the control sy‐ stem of any mobile robot. In this article the path planner for a humanoid robot is presented. The short description of an universal control framework and the Motion Ge‐ neration System is also presented. Described path plan‐ ner utilizes a limited number of motions called the Mo‐ tion Primitives. They are generated by Motion Generation System. Four different algorithms, namely the: Informed RRT, Informed RRT with random bias, and RRT with A* like heuristics were tested. For the last one the version with biased random function was also considered. All menti‐ oned algorithms were evaluated considering three diffe‐ rent scenarios. Obtained results are described and discus‐ sed.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2021, 15, 1; 24-30
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Collision-free autonomous robot navigation in unknown environments utilizing PSO for path planning
Autorzy:
Krell, Evan
Sheta, Alaa
Balasubramanian, Arun Prassanth Ramaswamy
King, Scott A.
Powiązania:
https://bibliotekanauki.pl/articles/91555.pdf
Data publikacji:
2019
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
mobile robot
particle swarm optimization (PSO)
path planning
Opis:
The autonomous navigation of robots in unknown environments is a challenge since it needs the integration of a several subsystems to implement different functionality. It needs drawing a map of the environment, robot map localization, motion planning or path following, implementing the path in real-world, and many others; all have to be implemented simultaneously. Thus, the development of autonomous robot navigation (ARN) problem is essential for the growth of the robotics field of research. In this paper, we present a simulation of a swarm intelligence method is known as Particle Swarm Optimization (PSO) to develop an ARN system that can navigate in an unknown environment, reaching a pre-defined goal and become collision-free. The proposed system is built such that each subsystem manipulates a specific task which integrated to achieve the robot mission. PSO is used to optimize the robot path by providing several waypoints that minimize the robot traveling distance. The Gazebo simulator was used to test the response of the system under various envirvector representing a solution to the optimization problem.onmental conditions. The proposed ARN system maintained robust navigation and avoided the obstacles in different unknown environments. vector representing a solution to the optimization problem.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2019, 9, 4; 267-282
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Impulse artificial neural networks in internal transport
Autorzy:
Ochelska-Mierzejewska, J.
Powiązania:
https://bibliotekanauki.pl/articles/407219.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
internal transport
impulse artificial neural networks
dynamic path planning
Opis:
The second most important function of a warehouse, apart from the storing of goods, is internal transport with a focus on time-effectiveness. When there is a time gap between the production and export of products, the goods need to be stored until they are dispatched to the consumers. An important problem that concerns both large and small warehouses is the selection of priorities, that is handling the tasks in order of importance. Another problem is to identify the most efficient routes for forklift trucks to transport goods from a start-point to a desired destination and prevent the routes from overlapping. In automated warehouses, the transport of objects (the so called pallets of goods) is performed by machines controlled by a computer instead of a human operator. Thus, it is the computer, not the man, that makes the difficult decisions regarding parallel route planning, so that the materials are transported within the warehouse in near-optimal time. This paper presents a method for enhancing this process.
Źródło:
Management and Production Engineering Review; 2014, 5, 2; 33-44
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A method of artificial potential fields for the determination of ship’s safe trajectory
Autorzy:
Mielniczuk, S.
Powiązania:
https://bibliotekanauki.pl/articles/135673.pdf
Data publikacji:
2017
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
path planning
artificial potential fields
obstacles
safety
navigation
collision
Opis:
Various methods of trajectory determination are used for finding solutions to collision situations involving ships. This applies to avoiding collisions with other ships or stationary objects. In addition to the methods generally used, new or modified versions of methods derived from other modes of transport are proposed. One of the algorithms for route determination serving to avoid obstructions is the method of artificial potential fields, used for determining routes of mobile robots. The method is used in maritime transport, for instance for detecting anomalies in ship movement. The article presents the method of potential fields used for solving the problem of route selection avoiding navigational dangers and obstacles. This article presents an algorithm of route determination based on the said method, its implementation in the MATLAB program and examples of application for the ship’s safe trajectory determination in some navigational situations.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2017, 51 (123); 45-49
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Planowanie optymalnej trasy przejazdu transportu samochodowego z wykorzystaniem miękkich metod obliczeniowych
Autorzy:
Topolski, M.
Powiązania:
https://bibliotekanauki.pl/articles/314406.pdf
Data publikacji:
2016
Wydawca:
Instytut Naukowo-Wydawniczy "SPATIUM"
Tematy:
planowanie trasy
TSL
transport samochodowy
path planning
motor transport
Opis:
Transport wiąże się z przemieszczaniem osób, ładunków w przestrzeni przy wykorzystaniu odpowiednich środków transportu. Potrzeby te należą do grupy potrzeb wtórnych człowieka i są związane z faktem różnego rozmieszczenia przestrzennego zasobów, skupisk ludzkich i miejsc pracy. Transport towarzyszył ludzkości od samych początków rozwoju cywilizacji. Jest to, obok łączności, dział gospodarki, które zwiększają użyteczność dóbr poprzez ich przemieszczanie w przestrzeni. Transport jest ściśle powiązany z pozostałymi działami gospodarki. Jego rozwój warunkuje ich rozwój i odwrotnie - gorszy rozwój gospodarki lub transportu wiąże się z pogorszeniem sytuacji odpowiednio w transporcie i gospodarce. W połączeniu z logistyką oraz spedycją, transport wchodzi w skład branży TSL (transport-spedycja-logistyka). Planowanie transportu wiąże z wielowymiarową oceną warunków towarzyszących problemom transportowym. W tym celu został zastosowany model rozmyty uwzględniający niepełną i nieprecyzyjną ocenę stanu transportowego.
Źródło:
Autobusy : technika, eksploatacja, systemy transportowe; 2016, 17, 6; 1174-1179
1509-5878
2450-7725
Pojawia się w:
Autobusy : technika, eksploatacja, systemy transportowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A quick algorithm for planning a path for a biomimetic autonomous underwater vehicle
Autorzy:
Praczyk, T.
Powiązania:
https://bibliotekanauki.pl/articles/135094.pdf
Data publikacji:
2016
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
path planning
underwater vehicle
autonomy
collision avoidance
automatic control
effective planning algorithm
Opis:
Autonomous underwater vehicles are vehicles that are entirely or partly independent of human decisions. In order to obtain operational independence, the vehicles have to be equipped with specialized software. The task of the software is to move the vehicle along a trajectory while avoiding collisions. In its role of avoiding obstacles, the vehicle may sometimes encounter situations in which it is very difficult to determine what the next movement should be from an ad hoc perspective. When such a situation occurs, a planning component of the vehicle software should be run with the task of charting a safe trajectory between nearby obstacles. This paper presents a new path planning algorithm for a Biomimetic Autonomous Underwater Vehicle. The main distinguishing feature of the algorithm is its high speed compared with such classic planning algorithms as A*. In addition to presenting the algorithm, this paper also summarizes preliminary experiments intended to assess the effectiveness of the proposed algorithm.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2016, 45 (117); 23-28
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Payload Maximization for Mobile Flexible Manipulators in Environment with an Obstacle
Autorzy:
Heidari, H.
Haghpanahi, M.
Korayem, M. H.
Powiązania:
https://bibliotekanauki.pl/articles/279299.pdf
Data publikacji:
2015
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
flexible link
nonholonomic mobile manipulator
optimal control
obstacle
path planning
Opis:
A mobile flexible manipulator is developed in order to achieve high performance requirements such as high-speed operation, increased high payload to mass ratio, less weight, and safer operation due to reduced inertia. Hence, this paper presents a method for finding the Maximum Allowable Dynamic Load (MADL) of geometrically nonlinear flexible link mobile manipulators. The full dynamic model of a wheeled mobile base and the mounted flexible manipulator is considered with respect to dynamics of non-holonomic constraint in environment including an obstacle. In dynamical analysis, an efficient model is employed to describe the treatment of a flexible structure in which both the geometric elastic nonlinearity and the foreshortening effects are considered. Then, a path planning algorithm is developed to find the maximum payload that the optimal strategy is based on the indirect solution to the open-loop optimal control problem. In order to verify the effectiveness of the presented algorithm, several simulation studies are carried out for finding the optimal path between two points in the presence of obstacles. The results clearly show the effect of flexibility and the proposed approach on mobile flexible manipulators.
Źródło:
Journal of Theoretical and Applied Mechanics; 2015, 53, 4; 911-923
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Any-angle Global Path Planning for Skid-Steered Mobile Robots on Heterogeneous Terrain
Autorzy:
Jaroszek, P.
Powiązania:
https://bibliotekanauki.pl/articles/384522.pdf
Data publikacji:
2016
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
spath planning
skid-steered mobile robot
Theta*
any-angle path planning
A*
Opis:
The paper is concerned with selection of the algorithm of path planning for a skid-steered mobile robot operating on heterogeneous terrain. Methods of path searching were reviewed and their applicability to particular kinematic structure of a robot was assessed. The Theta* graph search algorithm was selected, because of its property of returning any-angle paths. Because in this method variable terrain type is not considered, necessary changes in algorithm structure were proposed to check homogeneity of the terrain. In order to enable choice of arbitrary optimization criterion, the model of cost dependent on terrain properties was introduced, which includes both longitudinal motion and turning. Operation of the modified algorithm with the introduced cost model was verified by means of simulation against A* reference algorithm often used in path planning tasks.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2016, 10, 2; 50-56
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A scalable tree based path planning for a service robot
Autorzy:
Nippun Kumaar, A. A.
Kochuvila, Sreeja
Nagaraja, S. R.
Powiązania:
https://bibliotekanauki.pl/articles/2204556.pdf
Data publikacji:
2022
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
learning from demonstration
path mapping
path planning
navigation system
mobile robot
service robot
Opis:
Path planning plays a vital role in a mobile robot navi‐ gation system. It essentially generates the shortest tra‐ versable path between two given points. There are many path planning algorithms that have been proposed by re‐ searchers all over the world; however, there is very little work focussing on path planning for a service environ‐ ment. The general assumption is that either the environ‐ ment is fully known or unknown. Both cases would not be suitable for a service environment. A fully known en‐ vironment will restrict further expansion in terms of the number of navigation points and an unknown environ‐ ment would give an inefficient path. Unlike other envi‐ ronments, service environments have certain factors to be considered, like user‐friendliness, repeatability, sca‐ lability, and portability, which are very essential for a service robot. In this paper, a simple, efficient, robust, and environment‐independent path planning algorithm for an indoor mobile service robot is presented. Initially, the robot is trained to navigate to all the possible desti‐ nations sequentially with a minimal user interface, which will ensure that the robot knows partial paths in the en‐ vironment. With the trained data, the path planning al‐ gorithm maps all the logical paths between all the des‐ tinations, which helps in autonomous navigation. The al‐ gorithm is implemented and tested using a 2D simulator Player/Stage. The proposed system is tested with two dif‐ ferent service environment layouts and proved to have features like scalability, trainability, accuracy, and repe‐ atability. The algorithm is compared with various classi‐ cal path planning algorithms and the results show that the proposed path planning algorithm is on par with the other algorithms in terms of accuracy and efficient path generation.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2022, 16, 1; 31--45
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On path planning for mobile robots: Introducing the mereological potential field method in the framework of mereological spatial reasoning
Autorzy:
Ośmiałowski, B.
Powiązania:
https://bibliotekanauki.pl/articles/385053.pdf
Data publikacji:
2009
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
mobile robotics
path planning
rough mereology
potential field
Player/Stage system
Opis:
Path planning is one of the most vital problems in mobile robotics; it falls into general province of planning, however, due to specificity of the subject of mobile robotics, it has emerged as a discipline per se with its own solutions. Among many methods of probabilistic, geometrical and topological nature, the methodology of potential fields introduced by Krogh (1984) and Khatib (1985), based on physical analogies with gravitational or electromagnetic fields, has emerged. We adhere to this methodology, however, contrary to the practice of building the potential on the basis of Coulomb, or gravitational force fields, we apply the novel idea of building the potential function by means of mereological distance over a juxtaposition of grids of fixed diameter, i.e., over a discrete structure. We describe our implementation of the relevant mereological functors in the Player/Stage system as SQL predicates accessible in Player/Stage cooperating with PostgreSQL database. We present also the results of simulations with mobile robots.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2009, 3, 2; 24-33
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modyfikacja wariantów sukcesji w ewolucyjnej metodzie planowania ścieżki przejścia
Modification of post-selection methods in evolutionary path planning problem
Autorzy:
Kuczkowski, Ł.
Śmierzchalski, R.
Powiązania:
https://bibliotekanauki.pl/articles/269098.pdf
Data publikacji:
2013
Wydawca:
Politechnika Gdańska. Wydział Elektrotechniki i Automatyki
Tematy:
algorytmy ewolucyjne
planowanie ścieżki przejścia
sukcesja
evolutionary algorithms
path planning
postselection
Opis:
W pracy analizowano wpływ sukcesji na kształtowanie nacisku selektywnego w ewolucyjnej metodzie planowania ścieżek przejść. Opisano metody sukcesji oraz przedstawiono pojęcie nacisku selektywnego. Zrealizowano badania dla 4 rodzajów algorytmów ewolucyjnych, w każdym przypadku stosując inną metodę sukcesji. Przeprowadzono symulację, uwzględniając liczbę wymienianych osobników oraz różne metody zastępowania. Otrzymane rezultaty pozwalają na dobór metody sukcesji tak, aby zapewnić zbieżność oraz zachować zdolność algorytmu do przeszukiwania przestrzeni rozwiązań.
In this paper an impact of post-selection methods on shaping selection pressure was analyzed. Different methods of post-selection has been described. The concept of selection pressure was presented. Research has been made for 4 kinds of evolutionary algorithm, in each case a different method of post-selection was used. The simulations was performed taking into account number of replaced individuals and various methods of replacement. Results allow to choose post-selection method, so that algorithm will be able to effectively search solution space and ensure its convergence.
Źródło:
Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej; 2013, 36; 111-116
1425-5766
2353-1290
Pojawia się w:
Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An exact geometry-based algorithm for path planning
Autorzy:
Jafarzadeh, H.
Fleming, C. H.
Powiązania:
https://bibliotekanauki.pl/articles/331494.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
shortest possible path algorithm
path planning
collision free path
algorytm najkrótszej ścieżki
planowanie ścieżki
ścieżka bezkolizyjna
Opis:
A novel, exact algorithm is presented to solve the path planning problem that involves finding the shortest collision-free path from a start to a goal point in a two-dimensional environment containing convex and non-convex obstacles. The proposed algorithm, which is called the shortest possible path (SPP) algorithm, constructs a network of lines connecting the vertices of the obstacles and the locations of the start and goal points which is smaller than the network generated by the visibility graph. Then it finds the shortest path from start to goal point within this network. The SPP algorithm generates a safe, smooth and obstacle-free path that has a desired distance from each obstacle. This algorithm is designed for environments that are populated sparsely with convex and nonconvex polygonal obstacles. It has the capability of eliminating some of the polygons that do not play any role in constructing the optimal path. It is proven that the SPP algorithm can find the optimal path in O(nn’2) time, where n is the number of vertices of all polygons and n’ is the number of vertices that are considered in constructing the path network (n’ ≤ n). The performance of the algorithm is evaluated relative to three major classes of algorithms: heuristic, probabilistic, and classic. Different benchmark scenarios are used to evaluate the performance of the algorithm relative to the first two classes of algorithms: GAMOPP (genetic algorithm for multi-objective path planning), a representative heuristic algorithm, as well as RRT (rapidly-exploring random tree) and PRM (probabilistic road map), two well-known probabilistic algorithms. Time complexity is known for classic algorithms, so the presented algorithm is compared analytically.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 3; 493-504
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On automatic metric radio map generation for the purpose of WiFi navigation
Autorzy:
Bigaj, P.
Bartoszek, D.
Powiązania:
https://bibliotekanauki.pl/articles/384777.pdf
Data publikacji:
2017
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
indoor positioning
radio map
mobile devices
WiFi fingerprint localization
path planning
Opis:
We present a novel method of fast and reliable data gathering for the purpose of location services based on radio signal strength services such as WiFi location/ navigation. Our method combines the acquisition of location and mapping based on computer vision methods with WiFi signal strength stochastic data gathering. The output of the method is threefold: 3D metric space model, 2D floor plan map and metric map of stochastic radio signal strength. The binding of location data with radio data is done completely automatically, without any human intervention. The advantage of our solution lies also in a significant speed-up and density increase of Radio Map generation which opens new markets for WiFi navigation services. We have proved that presented solution produces a map allowing location in office space of accuracy 1.06 m.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2017, 11, 3; 62-73
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-strategy navigation for a mobile data acquisition platform using genetic algorithms
Autorzy:
Halal, F.
Zaremba, M. B.
Powiązania:
https://bibliotekanauki.pl/articles/950950.pdf
Data publikacji:
2017
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
genetic algorithms
path planning
monitoring system
remote sensing
navigation control
heuristic search
Opis:
Monitoring of biological and chemical pollutants in large bodies of water requires the acquisition of a large number of in-situ measurements by a mobile sensor platform. Critical to this problem is an efficient path planning method, easily adaptable to different control strategies that ensure the collection of data of the greatest value. This paper proposes a deliberative path planning algorithm, which features the use of waypoints for a ship navigation trajectory that are generated by Genetic Algorithm (GA) based procedures. The global search abilities of Genetic Algorithms are combined with the heuristic local search in order to implement a navigation behaviour suitable to the required data collection strategy. The adaptive search system operates on multi-layer maps generated from remote sensing data, and provides the capacity for dealing with multiple classes of water pollutants. A suitable objective function was proposed to handle different sampling strategies for the collection of samples from multiple water pollutant classes. A region-of-interest (ROI) component was introduced to deal effectively with the large scale of search environments by pushing the search towards ROI zones. This resulted in the reduction of the search time and the computing cost, as well as good convergence to an optimal solution. The global path planning performance was further improved by multipoint crossover operators running in each GA generation. The system was developed and tested for inland water monitoring and trajectory planning of a mobile sample acquisition platform using commercially available satellite data.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2017, 11, 1; 30-41
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
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ł:
Intelligent Control for a Perturbed Autonomous Wheeled Mobile Robot Using Type-2 Fuzzy Logic and Genetic Algorithms
Autorzy:
Martínez, R.
Castillo, O.
Aguilar, L. T.
Powiązania:
https://bibliotekanauki.pl/articles/384492.pdf
Data publikacji:
2008
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
mobile robot
path planning
fuzzy logic
genetic algorithms
autonomous mobile robot navigation
Opis:
We describe a tracking controller for the dynamic model of a unicycle mobile robot by integrating a kinematic and a torque controller based on Type-2 Fuzzy Logic Theory and Genetic Algorithms. Computer simulations are presented confirming the performance of the tracking controller and its application to different navigation problems.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2008, 2, 1; 12-22
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Artifical potential fields algorithm for Mars rover path planning in an unknown enviroment
Autorzy:
Wyrąbkiewicz, K.
Tarczewski, T.
Grzesiak, L. M.
Powiązania:
https://bibliotekanauki.pl/articles/377644.pdf
Data publikacji:
2014
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
autonomous mobile robot
Mars rover
path planning
artificial potential fields
bug algorithm
Opis:
In this paper artificial potential fields method applied to autonomous mobile robot - Mars rover is presented. It is assumed that Mars rover operates in an unknown environment. In order to visualize the robot's path in environment Matlab software is used. Inserted by graphic data input interface in top view mode obstacles are deployed in environment area. The method of artificial potential fields is extended by an additional algorithm to avoid a local minimum. The proposed algorithm is implemented as a state machine. In this paper simulations results of the developed algorithm are presented.
Źródło:
Poznan University of Technology Academic Journals. Electrical Engineering; 2014, 80; 183-189
1897-0737
Pojawia się w:
Poznan University of Technology Academic Journals. Electrical Engineering
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ł:
Artifical potential fields with extended Bug algorithm for Mars rover path planning in an unknown environment
Autorzy:
Wyrąbkiewicz, K.
Tarczewski, T.
Grzesiak, L.M.
Powiązania:
https://bibliotekanauki.pl/articles/1395762.pdf
Data publikacji:
2014
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
autonomous mobile robot
mars rover
path planning
artificial potential fields
Bug algorithm
Opis:
In this paper artificial potential fields method applied to autonomous mobile robot -mars rover is presented. It is assumed that Mars rover operates in an unknown environment. In order to visualize the robot's path in environment Matlab software is used. The object can be inserted by graphic data input interface in top view mode. The method of artificial potential fields is extended by an additional algorithm to avoid a local minimum. The proposed algorithm is implemented as a state machine. In this paper simulations results of the developed algorithm are presented. Extended algorithm is used because in the environment may be located complex obstacles.
Źródło:
Computer Applications in Electrical Engineering; 2014, 12; 422-433
1508-4248
Pojawia się w:
Computer Applications in Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Obstacle Avoidance Procedure and Lee Algorithm Based Path Replanner for Autonomous Mobile Platforms
Autorzy:
Polańczyk, M.
Strzelecki, M.
Ślot, K.
Powiązania:
https://bibliotekanauki.pl/articles/226622.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
mobile platform motion system
camera motion estimation
map of obstacles
path planning
Opis:
The paper proposes solution for two important issues connected to navigation of independent mobile platforms in an unknown environment. First issue relates to obstacle map, estimated based on stereovision images. It provides a basis for further platform path-planning. The main problem that has to be solved in obstacle map derivation is elimination of artifacts resulting from depth estimation. Thus a two-step artifact filtering procedure is proposed, which exploits both within-frame spatial correlations as well as temporal, between-frame correlations to do this task. Second procedure, based on well-known Lees algorithm is designed for obtaining vehicle collisionless path. Such routes need to be updated on-the-fly to take into account moving obstacles or newly detected objects. The main idea of the proposed approach is to identify regions where environment has changed and to execute a procedure of selective path updates. As a result, an optimal path can be derived at a computational expense comparable to the heuristic Lifelong A* search. Experiment results demonstrate efficiency of the two discussed approaches for platform operation control in real environments, where both static and moving obstacles are present.
Źródło:
International Journal of Electronics and Telecommunications; 2013, 59, 1; 85-91
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Navigation of autonomous mobile robot using different activation functions of wavelet neural network
Autorzy:
Panigrahi, P. K.
Ghosh, S.
Parhi, D. R.
Powiązania:
https://bibliotekanauki.pl/articles/229613.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
autonomous mobile robot
activation functions
obstacle avoidance
path planning
wavelet neural network
Opis:
An autonomous mobile robot is a robot which can move and act autonomously without the help of human assistance. Navigation problem of mobile robot in unknown environment is an interesting research area. This is a problem of deducing a path for the robot from its initial position to a given goal position without collision with the obstacles. Different methods such as fuzzy logic, neural networks etc. are used to find collision free path for mobile robot. This paper examines behavior of path planning of mobile robot using three activation functions of wavelet neural network i.e. Mexican Hat, Gaussian and Morlet wavelet functions by MATLAB. The simulation result shows that WNN has faster learning speed with respect to traditional artificial neural network.
Źródło:
Archives of Control Sciences; 2015, 25, 1; 21-34
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Mean crossover in evolutionary path planning method for maritime collision avoidance
Krzyżowanie uśredniające w ewolucyjnej metodzie planowania ścieżki przejścia w zastosowaniu do problemu unikania kolizji na morzu
Autorzy:
Kuczkowski, Ł.
Kolendo, P.
Jaworski, B.
Śmierzchalski, R.
Powiązania:
https://bibliotekanauki.pl/articles/359740.pdf
Data publikacji:
2012
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
algorytmy genetyczne
planowanie ścieżki przejścia
unikanie kolizji
genetic algorithms
path planning
collision avoidance
Opis:
This paper presents the use of mean crossover genetic operator for path planning using evolutionary algorithm for collision avoidance on sea. Mean crossover ensures widening of the possible solutions’ set that can be achieved in comparison to exchange crossover variant. The research shown, that the mean crossover allows to achieve results independent from the initial generation and quicker transition of the algorithm from the exploration to the exploitation phase. New version of the algorithm allows for an effective solution search for the problem of a collision scenario on sea.
Artykuł przedstawia zastosowanie operatora krzyżowania uśredniającego do wyznaczania ścieżki przejścia przy użyciu algorytmu ewolucyjnego w zastosowaniu do unikania kolizji na morzu. Krzyżowanie uśredniające zapewnia rozszerzenie zbioru rozwiązań możliwych do uzyskania w porównaniu z wariantem krzyżowania wymieniającego. Przeprowadzone badania wykazały, że zastosowany wariant krzyżowania pozwala na uniezależnienie wyników symulacji od postaci populacji początkowej oraz szybsze przejście algorytmu z fazy eksploracji do eksploatacji obszaru przyciągania optimum. Nowa wersja algorytmu pozwala na skuteczne poszukiwanie rozwiązań w sytuacji kolizyjnej na morzu.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2012, 30 (102); 70-77
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Surface-to-air missile path planning using genetic and PSO algorithms
Autorzy:
Zandavi, S. M.
Powiązania:
https://bibliotekanauki.pl/articles/280277.pdf
Data publikacji:
2017
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
path planning
genetic algorithm
PSO algorithm
surface-to-air missile
3DOF simulation
Opis:
Optimization algorithms use various mathematical and logical methods to find optimal points. Given the complexity of models and design levels, this paper proposes a heuristic optimization model for surface-to-air missile path planning in order to achieve the maximum range and optimal height based on 3DOF simulation. The proposed optimization model involves design variables based on the pitch programming and initial pitch angle (boost angle). In this optimization model, we used genetic and particle swarm optimization (PSO) algorithms. Simulation results indicated that the genetic algorithm was closer to reality but took longer computation time. PSO algorithm offered acceptable results and shorter computation time, so it was found to be more efficient in the surface-to-air missile path planning.
Źródło:
Journal of Theoretical and Applied Mechanics; 2017, 55, 3; 801-812
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An optimal path planning problem for heterogeneous multi-vehicle systems
Autorzy:
Klaučo, M.
Blažek, S.
Kvasnica, M.
Powiązania:
https://bibliotekanauki.pl/articles/330754.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
path planning
multi vehicle system
mixed-integer programming
planowanie ruchu
system wielopojazdowy
programowanie całkowitoliczbowe
Opis:
A path planning problem for a heterogeneous vehicle is considered. Such a vehicle consists of two parts which have the ability to move individually, but one of them has a shorter range and is therefore required to keep in a close distance to the main vehicle. The objective is to devise an optimal path of minimal length under the condition that at least one part of the heterogeneous system visits all desired waypoints exactly once. Two versions of the problem are considered. One assumes that the order in which the waypoints are visited is known a priori. In such a case we show that the optimal path can be found by solving a mixed-integer second-order cone problem. The second version assumes that the order in which the waypoints are visited is not known a priori, but can be optimized so as to shorten the length of the path. Two approaches to solve this problem are presented and evaluated with respect to computational complexity.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 297-308
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zastosowanie wielopopulacyjnego algorytmu ewolucyjnego do problemu wyznaczania ścieżki przejścia
Application of multi-population evolutionary algorithm for path planning problem
Autorzy:
Kuczkowski, Ł.
Śmierzchalski, R.
Powiązania:
https://bibliotekanauki.pl/articles/266972.pdf
Data publikacji:
2013
Wydawca:
Politechnika Gdańska. Wydział Elektrotechniki i Automatyki
Tematy:
algorytmy ewolucyjne
algorytmy wielopopulacyjne
planowanie ścieżki przejścia
evolutionary algorithms
multi-population algorithm
path planning
Opis:
Artykuł przedstawia zastosowanie wielopopulacyjnego algorytmu ewolucyjnego do wyznaczania ścieżki przejścia. Zastosowany algorytm oparty jest na modelu z częściowo wymienianą populacją oraz migracją między niezależnie ewoluującymi populacjami. W pracy porównano działanie algorytmu wielopopulacyjnego z jednopopulacyjnym oraz zbadano wpływ poszczególnych parametrów na jakość uzyskanego rozwiązania. Wykazano, że zastosowanie kilku niezależnie ewoluujących populacji prowadzi do uzyskania rozwiązania lepszego w stosunku do wariantu jednopopulacyjnego. Jako problem testowy zostało wybrane zagadnienie unikania kolizji na morzu.
In this paper an application of multi-population evolutionary algorithm for path planning problem is presented. A steadystate genetic algorithm is used for evolution of single population. An applied migration mechanism is based on island topology. In the article the comparison of single and multi-population algorithm has been made and the influence of changing algorithm parameters has been studied. It has been shown that using several independently evolving population leads to a better solution than when the single population is used. For a testing problem a sea collision avoiding problem has been chosen.
Źródło:
Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej; 2013, 36; 117-122
1425-5766
2353-1290
Pojawia się w:
Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Planowanie trasy robota Kurier w środowisku dynamicznym z wykorzystaniem sieci komórkowych
Path planning in a dynamic environment based on CNN
Autorzy:
Siemiątkowska, B.
Chojecki, R.
Różańska-Walczuk, M.
Przybylski, M.
Węclewski, P.
Wiśniowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/276786.pdf
Data publikacji:
2012
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
robotyka mobilna
nawigacja
planowanie trasy
otoczenie dynamiczne
mobile robotics
navigation
path planning
dynamic environment
Opis:
Sterowanie robotem mobilnym jest podstawowym zagadnieniem w trakcie tworzenia projektu związanego z platformą mobilną. Najnowsze trendy wskazują, że w chwili obecnej najpowszechniej rozwijane są autonomiczne systemy sterowania ruchem. W artykule przedstawiono projekt naukowy, którego celem jest zbudowanie robota z zaimplementowaną całkowicie autonomiczną nawigacją. Końcowym założeniem projektu jest wdrożenie wyników badań do realnej aplikacji. Istotnym problemem, który dotyczy nawigacji jest planowanie trasy robota. Aby platforma mogła być wykorzystana w realnym środowisku z poruszającymi się obiektami dynamicznymi, należy je również uwzględnić w trakcie planowania trasy. W artykule dokonano porównania istniejących i proponowanych przez autorów rozwiązań planowania ścieżki. Projektując robota usługowego, który będzie mógł dzielić przestrzeń z ludźmi oraz obiektami dynamicznymi istotny jest także krótki czas reakcji na zmiany otoczenia. Problem ten rozwiązywany jest poprzez urównoleglenie mocy obliczeniowej komputera. Zaproponowaną technologią wykorzystaną w tym celu są obliczenia na procesorach graficznych GPU.
The control of mobile robot is a fundamental and basic task. Nowadays, the most actual trends focus on autonomous control systems. This paper describes a scientific project, which main goal is fully autonomous navigation system, designed for new construction of mobile robot. Final stage of the project is real application. The significant problem of robot navigation is path planning, especially when mobile platform is predestinated to be used in a real environment enclosed with dynamic obstacles. Dynamic objects should be considered in the path planning algorithm. The navigation system of mobile robot, moving among people, should response with short reaction time for fast environment changes. In this paper authors present parallel computing implementation, in this case - with use of graphic processors (GPU).
Źródło:
Pomiary Automatyka Robotyka; 2012, 16, 2; 281-288
1427-9126
Pojawia się w:
Pomiary Automatyka Robotyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Automated UAV to Survey and Monitor Ionising Radiation Levels in a Closed Environment
Autorzy:
Anand, R.
Harshith, Kumar M. B.
Raghavan, Anirudh
Maddara, Roopak
Anand, Prajna
Powiązania:
https://bibliotekanauki.pl/articles/2175938.pdf
Data publikacji:
2022
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
unmanned aerial vehicle
indoor SLAM
sensor data
disaster management robot
path planning
obstacle avoidance
Opis:
Since tragedies caused by nuclear disasters are always a concern, it is essential that nuclear power plants be monitored on a regular basis for any irregularities in ionising radiation levels. Irrespective of leakage proof measures being deployed in the plant, ensuring the safety of these measures is necessary. Given this scenario, the present study proposes the usage of unmanned aerial vehicles (UAVs) to ensure that radiation levels in nuclear plants remain within safe limits. The UAV deployed will map the entire environment following a unique path planning algorithm and monitor the environment with an onboard radiation sensor. If any irregularities are detected, the positional coordinates are flagged, and the A* algorithm is implemented to generate the shortest path between the starting point, and the flagged coordinates, which are considered as the destination coordinates. The UAV is made to traverse the shortest path together with maintaining stability of the system while traversing.
Źródło:
Power Electronics and Drives; 2022, 7, 42; 134--145
2451-0262
2543-4292
Pojawia się w:
Power Electronics and Drives
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Model–based energy efficient global path planning for a four–wheeled mobile robot
Autorzy:
Jaroszek, P.
Trojnacki, M.
Powiązania:
https://bibliotekanauki.pl/articles/206564.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
four-wheeled mobile robot
global path planning
robot dynamics model
heuristic algorithm
energy efficiency
Opis:
This paper concerns an energy efficient global path planning algorithm for a four-wheeled mobile robot (4WMR). First, the appropriate graph search methods for robot path planning are described. The A* heuristic algorithm is chosen to find an optimal path on a 2D tile-decomposed map. Various criteria of optimization in path planning, like mobility, distance, or energy are reviewed. The adequate terrain representation is introduced. Each cell in the map includes information about ground height and type. Tire-ground interface for every terrain type is characterized by coefficients of friction and rolling resistance. The goal of the elaborated algorithm is to find an energy minimizing route for the given environment, based on the robot dynamics, its motor characteristics, and power supply constraints. The cost is introduced as a function of electrical energy consumption of each motor and other robot devices. A simulation study was performed in order to investigate the power consumption level for diverse terrain. Two 1600 m2 test maps, representing field and urban environments, were decomposed into 20x20 equal-sized square-shaped elements. Several simulation experiments have been carried out to highlight the differences between energy consumption of the classic shortest path approach, where cost function is represented as the path length, and the energy efficient planning method, where cost is related to electrical energy consumed during robot motion.
Źródło:
Control and Cybernetics; 2014, 43, 2; 337-363
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wykorzystanie planera podróży Green Traveling w sporcie, turystyce i rekreacji
Use of green travel planner travelling in sports, tourism and recreation
Autorzy:
Celiński, I.
Powiązania:
https://bibliotekanauki.pl/articles/310450.pdf
Data publikacji:
2016
Wydawca:
Instytut Naukowo-Wydawniczy "SPATIUM"
Tematy:
planer podróży
Green Travelling Planner
sieć transportowa
planowanie trasy
trip planner
path planning
transportation network
Opis:
W artykule omówiony został problem wykorzystania planerów podróży w zastosowaniach sportowych, turystycznych i rekreacyjnych. Przedmiotowy problem zilustrowano na przykładzie wykorzystania planera podróży o nazwie Green Travelling Planner (GT Planner). Każdy planer podroży służy do wyznaczenia ścieżki przemieszczenia w sieci transportowej pomiędzy punktem początkowym podróży, a końcowym. Tą funkcjonalność planerów opisano w przedmiotowym artykule w aspekcie planowania tras turystycznych i rekreacyjnych oraz interesujących aspektów wykorzystania w sporcie. Zasadniczy problem w przystosowaniu planera podroży do celów: sportowych, turystycznych i rekreacyjnych tkwi w wykorzystywanych przez niego źródłach danych. Problem ten szczegółowo opisano w niniejszym artykule. Podstawową funkcjonalnością planera zaproponowanego do realizacji przemieszczeń: sportowych, rekreacyjnych i turystycznych o nazwie GT Planner jest indeksowanie przemieszczeń wielkością emisji substancji szkodliwych jaka jest z jego realizacją związana. W połączeniu z innymi funkcjonalnościami tego narzędzia, takimi jak wykorzystywanie danych o profilach wysokości, wykorzystanie funkcji heurystycznych cechujących sieć transportową, można taki planer wykorzystać w specyficznych zagadnieniach: sportowych, turystycznych i rekreacyjnych. Na rynku jest obecnie kilka planerów podróży, które można określić mianem stricte turystycznych, z uwagi na co zostaną one opisane obok prezentowanego narzędzia GT Planner.
The article discussed the problem of the use trip planners for sports, tourist and recreational. The present problem exemplified use for this purpose route planner called Green Travelling. Each journey planner is used to determine the path in the transport network between the starting point of the journey, and the end. This functionality planners described in this article in terms of planning hiking trails and recreational facilities. The fundamental problem in adapting journey planner for sports, tourism and recreation is in used by its data sources. This problem is described in detail in this article. The basic functionality of the proposed agenda for the realization movements sports, recreational and tourist called Green Travelling is indexing the displacement size of the emission of harmful substances which is associated with them (trip route). In combination with other functionalities of this tool such as the use of profiles height, the use of heuristics characterize transport network can be a planer used in specific issues of sports, tourist and recreational activities. Currently on the market is several travel planners that can be described as a tourist, because of what was on themcompared to the tool Green traveling.
Źródło:
Autobusy : technika, eksploatacja, systemy transportowe; 2016, 17, 6; 104-111
1509-5878
2450-7725
Pojawia się w:
Autobusy : technika, eksploatacja, systemy transportowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reliable robust path planning with application to mobile robots
Autorzy:
Pepy, R.
Kieffer, M.
Walter, E.
Powiązania:
https://bibliotekanauki.pl/articles/930096.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
analiza interwałowa
planowanie trajektorii
sterowanie odporne
interval analysis
path planning
robust control
state-space models
Opis:
This paper is devoted to path planning when the safety of the system considered has to be guaranteed in the presence of bounded uncertainty affecting its model. A new path planner addresses this problem by combining Rapidly-exploring Random Trees (RRT) and a set representation of uncertain states. An idealized algorithm is presented first, before a description of one of its possible implementations, where compact sets are wrapped into boxes. The resulting path planner is then used for nonholonomic path planning in robotics.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 3; 413-424
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zastosowanie algorytmów planowania trajektorii dla mobilnych robotów kołowych
The Use of path planning algorithms for wheeled mobile robots
Autorzy:
Buratowski, T.
Uhl, T.
Powiązania:
https://bibliotekanauki.pl/articles/157852.pdf
Data publikacji:
2005
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
algorytmy planowania trajektorii
zastosowanie algorytmu
mobilne roboty kołowe
path planning algorithm
using
wheeled mobile robots
Opis:
W artykule przedstawiono kilka algorytmów planowania trajektorii dla mobilnych robotów kołowych, które między innymi zostały wybrane dla grupy robotów. W trakcie konstruowania prototypu urządzeń wykorzystano układy sensoryczne oparte o czujniki ultradźwiękowe oraz czujniki podczerwieni.
This paper presents several path planning algorithms for mobile robots. In the process of mechatronic design, two sensors: ultrasonic and infrared have been applied.
Źródło:
Pomiary Automatyka Kontrola; 2005, R. 51, nr 11, 11; 17-20
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Three-dimensional underwater path planning based on modified potential field algorithm in time-varying current
Autorzy:
Wang, Shasha
Feng, Guilin
Wang, Dan
Tuo, Yulong
Powiązania:
https://bibliotekanauki.pl/articles/32917893.pdf
Data publikacji:
2023
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
AUV
3D underwater path planning
time-varying current
modified artificial potential field
velocity synthesis
Opis:
The article addresses the three-dimensional (3D) underwater path planning problem of an autonomous underwater vehicle (AUV) in a time-varying current. A modified artificial potential field algorithm combining the velocity vector synthesis method is proposed to search for the optimal path. The modified potential field (MPF) algorithm is designed to dynamically plan the non-collision path. Meanwhile, this modified method is also proved to be an effective solution to the goals not reachable with obstacles nearby (GNRON), U-shaped trap, and rotation unreachable problems. To offset the influence of time-varying current, the velocity synthesis approach is designed to adjust the AUV movement direction. Besides, considering path planning in the complex underwater environment, the multi-beam forward-looking sonar (FLS) model is used. Finally, simulation studies substantiate that the designed algorithm can implement the AUV path planning effectively and successfully in a 3D underwater environment.
Źródło:
Polish Maritime Research; 2023, 1; 33-42
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Planowanie trasy bezzałogowego statku powietrznego podczas lotu nad terenem z przeszkodami
Unmanned aerial vehicle route planning in mountainous terrain with obstacles
Autorzy:
Basmadji, F. L.
Gruszecki, J.
Powiązania:
https://bibliotekanauki.pl/articles/194614.pdf
Data publikacji:
2017
Wydawca:
Politechnika Rzeszowska im. Ignacego Łukasiewicza. Oficyna Wydawnicza
Tematy:
BSP
bezzałogowy statek powietrzny
planowanie trasy
omijanie przeszkód
UAV
unmanned aerial vehicle
path planning
obstacle avoidance
Opis:
Pomimo znacznych postępów w tematyce zwiększenia autonomiczności bezzałogowych obiektów latającego, pozostaje jeszcze wiele problemów do rozwiązania, jednym z nich to problem autonomicznego planowania trasy. Mimo iż ten problem jest obecnie przedmiotem badań licznych ośrodków badawczych na świecie, nadal jednak nie opracowano uniwersalnego sposobu planowania trasy, gdyż jest to związane nie tylko z właściwościami danego obiektu, ale również z realizowaną misją. W niniejszym artykule omówiono problem planowania trasy dla bezzałogowego statku powietrznego podczas lotu nad terenem z przeszkodami. Opracowany został algorytm do wyznaczania trasy uwzględniający ograniczenia nałożone przez właściwości obiektu latającego, ukształtowanie terenu, strefy zakazane oraz maksymalny dopuszczalny pułap lotu. Ponadto zaproponowano metodę poszukiwania quasi-optymalnej trajektorii w przypadku większej liczby przeszkód. Przeprowadzono szereg badań symulacyjnych weryfikujących poprawność działania opracowanego algorytmu.
Despite significant progress in the field of increasing the autonomy of unmanned aerial vehicles (UAVs), there are still a number of problems which needs to be solved. One of such example is the problem of autonomous path planning. In this paper, the problem of UAV path planning in mountainous terrain with obstacles has been discussed. AUAV path planning algorithm that takes into account limitations imposed by UAVs dynamics, terrain configuration, no-fly zones and the maximum allowable flight altitude has been developed. Furthermore, the method of searching for the quasi-optimal path in the case of multiple obstacles has been proposed. A series of simulation investigations to verify the correctness of developed algorithm have been carried out.
Źródło:
Zeszyty Naukowe Politechniki Rzeszowskiej. Mechanika; 2017, z. 89 [295], 1; 5-17
0209-2689
2300-5211
Pojawia się w:
Zeszyty Naukowe Politechniki Rzeszowskiej. Mechanika
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ant colony optimization for data acquisition mission planning
Autorzy:
Colmenares, G.
Halal, F.
Zaremba, M.B.
Powiązania:
https://bibliotekanauki.pl/articles/407293.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
path planning
environment monitoring
ant colony optimization
data acquisition
navigation control
satellite imagery
constraint-based optimization
Opis:
The probabilistic Ant Colony Optimization (ACO) approach is presented to solve the problem of designing an optimal trajectory for a mobile data acquisition platform. An ACO algorithm optimizes an objective function defined in terms of the value of the acquired data samples subject to different sets of constraints depending on the current data acquisition strategy. The analysis presented in this paper focuses on an environment monitoring system, which acquires in-situ data for precise calibration of a water quality monitoring system. The value of the sample is determined based on the concentration of the water pollutant, which in turn is obtained through processing of multi-spectral satellite imagery. Since our problem is defined in a continuous space of coordinates, and in some strategies each point is able to connect to any other point in the space, we adopted a hybrid model that involves a connection graph and also a spatial grid.
Źródło:
Management and Production Engineering Review; 2014, 5, 2; 3-11
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Obstacle avoidance method of autonomous vehicle based on fusion improved A*APF algorithm
Autorzy:
Qian, Yubin
Sun, Hongtao
Feng, Song
Powiązania:
https://bibliotekanauki.pl/articles/2204535.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
obstacle avoidance
path planning
fuzzy control
tracking control
unikanie przeszkód
planowanie ścieżki
kontroler rozmyty
kontroler śledzenia
Opis:
This paper proposes an autonomous obstacle avoidance method combining improved A-star (A*) and improved artificial potential field (APF) to solve the planning and tracking problems of autonomous vehicles in a road environment. The A*APF algorithm to perform path planning tasks, and based on the longitudinal braking distance model, a dynamically changing obstacle influence range is designed. When there is no obstacle affecting the controlled vehicle, the improved A* algorithm with angle constraint combined with steering cost can quickly generate the optimal route and reduce turning points. If the controlled vehicle enters the influence domain of obstacle, the improved artificial potential field algorithm will generate lane changing paths and optimize the local optimal locations based on simulated annealing. Pondering the influence of surrounding participants, the four-mode obstacle avoidance process is established, and the corresponding safe distance condition is analyzed. A particular index is introduced to comprehensively evaluate speed, risk warning, and safe distance factors, so the proposed method is designed based on the fuzzy control theory. In the tracking task, a model predictive controller in the light of the kinematics model is devised to make the longitudinal and lateral process of lane changing meet comfort requirements, generating a feasible autonomous lane-change path. Finally, the simulation was performed in the Matlab/Simulink and Carsim combined environment. The proposed fusion path generation algorithm can overcome the shortcomings of the traditional single method and better adapt to the dynamic environment. The feasibility of the obstacle avoidance algorithm is verified in the three-lane simulation scenario to meet safety and comfort requirements.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 2; art. no. e144624
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A multi-layered potential field method for waterjet propelled unmanned surface vehicle local path planning with minimum energy consumption
Autorzy:
Wang, Shasha
Fu, Mingyu
Wang, Yuanhui
Zhao, Liangbo
Powiązania:
https://bibliotekanauki.pl/articles/260576.pdf
Data publikacji:
2019
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
water-jet propelled USV
local path planning
marine environment
minimum energy consumption
multi-layered potential field method
Opis:
Focusing on the influence of wind and surface currents on local path planning in the marine environment, a multilayered potential field (MPF) method is proposed to minimize the energy consumption of a water-jet propelled unmanned surface vehicle (USV). A synthetic environment framework that can incorporate the information of the base potential field layer and the environment layer is constructed first. This framework provides a base for minimizing the energy consumption of the water-jet propelled USV through proper force weighting. For the purpose of USV path planning, the traditional potential field method is extended by including the velocity information of the USV and the approached obstacles to avoid collisions with dynamic obstacles. The proposed method integrates kinematic control to prevent considering the vehicle as a point mass or rigid body. Finally, simulation and comparison experiments are performed to demonstrate the energy-saving efficiency of the proposed local path planning approach for the water-jet propelled USV.
Źródło:
Polish Maritime Research; 2019, 1; 134-144
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tool path planning for five-axis end milling of cycloidal gears and its full tooth profile accuracy measurement
Autorzy:
Wang, Jian
Liao, Longxing
Luo, Shanming
Mo, Jingyu
Powiązania:
https://bibliotekanauki.pl/articles/38890069.pdf
Data publikacji:
2023
Wydawca:
Instytut Podstawowych Problemów Techniki PAN
Tematy:
cycloidal gear
end milling
five-axis CNC machine tool
tooth path planning
full tooth profile accuracy measurement
Opis:
This paper proposes a method of end milling of cycloidal gears using a five-axis computer analytical control (CNC) machine tool. Firstly, the basic principle of the five-axis end milling of cycloidal gears is introduced. The cutting characteristics of the ball-end and the flat-end cutters are analyzed. Secondly, the path planning method of the five-axis end milling of cycloidal gears is researched. A curvature matching method is used to check for local over-cut interference and a minimum distance method is used to check for global collision interference. These two interferences are avoided by calculating the feasible range of cutter orientations and adjusting the dips of cutter shafts. Tests of end milling of cycloidal gears are carried out using a ball-end cutter and a flat-end cutter, respectively. Finally, full tooth profile accuracy measurements are undertaken with an image-measuring instrument to assess the quality of cycloidal gears processed in this way. This study provides a theoretical basis for the improvement of the tooth profile accuracy and surface quality of cycloidal gears.
Źródło:
Engineering Transactions; 2023, 71, 1; 3-21
0867-888X
Pojawia się w:
Engineering Transactions
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ł
Tytuł:
Path planning for an autonomous underwater vehicle in a cluttered underwater environment based on the heat method
Autorzy:
Sun, Kaiyue
Liu, Xiangyang
Powiązania:
https://bibliotekanauki.pl/articles/1838198.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
autonomous underwater vehicle
path planning
heat method
heat diffusion
cost function
pojazd podwodny autonomiczny
planowanie trasy
dyfuzja ciepła
funkcja kosztu
Opis:
This paper proposes a novel autonomous underwater vehicle path planning algorithm in a cluttered underwater environment based on the heat method. The algorithm calculates the isotropic and anisotropic geodesic distances by adding the direction and magnitude of the currents to the heat method, which is named the anisotropy-based heat method. Taking account of the relevant influence of the environment on the cost functions, such as currents, obstacles and turn of the vehicle, an efficient collision-free and energy-optimized path solution can be obtained. Simulation results show that the anisotropy-based heat method is able to find a good trajectory in both static and dynamic clutter fields (including uncertain obstacles and changing currents). Compared with the fast marching (FM) algorithm, the anisotropy-based heat method is not only robust, flexible, and simple to implement, but it also greatly saves time consumption and memory footprint in a time-variant environment. Finally, the evaluation criteria of paths are proposed in terms of length, arrival time, energy consumption, and smoothness.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 2; 289-301
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Path planning for an autonomous underwater vehicle in a cluttered underwater environment based on the heat method
Autorzy:
Sun, Kaiyue
Liu, Xiangyang
Powiązania:
https://bibliotekanauki.pl/articles/1838202.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
autonomous underwater vehicle
path planning
heat method
heat diffusion
cost function
autonomiczny pojazd podwodny
planowanie trasy
dyfuzja ciepła
funkcja kosztu
Opis:
This paper proposes a novel autonomous underwater vehicle path planning algorithm in a cluttered underwater environment based on the heat method. The algorithm calculates the isotropic and anisotropic geodesic distances by adding the direction and magnitude of the currents to the heat method, which is named the anisotropy-based heat method. Taking account of the relevant influence of the environment on the cost functions, such as currents, obstacles and turn of the vehicle, an efficient collision-free and energy-optimized path solution can be obtained. Simulation results show that the anisotropy-based heat method is able to find a good trajectory in both static and dynamic clutter fields (including uncertain obstacles and changing currents). Compared with the fast marching (FM) algorithm, the anisotropy-based heat method is not only robust, flexible, and simple to implement, but it also greatly saves time consumption and memory footprint in a time-variant environment. Finally, the evaluation criteria of paths are proposed in terms of length, arrival time, energy consumption, and smoothness.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 2; 289-301
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
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ł

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