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ł

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