Hexagon path planning algorithm.
In: IET Radar, Sonar & Navigation (Wiley-Blackwell), Jg. 16 (2022-12-01), Heft 12, S. 1895-1911
Online
academicJournal
Zugriff:
The paper presents a novel 2D geometrical path plan algorithm that reduces calculation load and time by filtering obstacles before path planning starts by the newly introduced hexagon filter and also while path search is in progress. Unlike other methods that use only obstacle filtering before path planning starts. The suggested algorithm was able to solve a randomly created maze that contains 400 obstacles with 800 nodes, which was considered before, as next to impossible to solve. This is because computational time is proportional to n2log(n) where n is the number of obstacles, node suggested algorithm reduced the computational time to about 1 in 2500 times compared to the best of (ESOVG, DVG or ECoVG). In addition, the suggested algorithm can be used in the case of a fixed start point and different target points (e.g. a swarm of robots leaving from the same start point with different targets). [ABSTRACT FROM AUTHOR]
Copyright of IET Radar, Sonar & Navigation (Wiley-Blackwell) is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Titel: |
Hexagon path planning algorithm.
|
---|---|
Autor/in / Beteiligte Person: | Arnaoot, Hany Mohamed Elsayed Ibrahim Mohamed |
Link: | |
Zeitschrift: | IET Radar, Sonar & Navigation (Wiley-Blackwell), Jg. 16 (2022-12-01), Heft 12, S. 1895-1911 |
Veröffentlichung: | 2022 |
Medientyp: | academicJournal |
ISSN: | 1751-8784 (print) |
DOI: | 10.1049/rsn2.12250 |
Schlagwort: |
|
Sonstiges: |
|