- 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ł