.png){kind=icon}
Return
An Evolutionary Navigation Algorithm for Multi-Robot With Priority Order
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3274204.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This study proposes a novel multi-robot navigation algorithm with priority order called, in short, PONA2.0. This algorithm is based on the generalized Voronoi diagram and contains an adjustable multipath switching mechanism and a collision prevention strategy, such that the arrival order of robots is in line with the priority order as much as possible, and the average trajectories length is as short as possible. The given average trajectories length of all robots (ATLA) and arrival order (AO) are used to be the two performance indices for the comparison between the proposed algorithm and recent existing algorithms NSPP (Huang et al., 2021), PONA (Huang et al., 2022), ROA, and SDA (Ali et al., 2016). The comparison shows that the PONA2.0 can reduce the average AO by more than 56% compared with NSPP and PONA and reduce the average ATLA between 5% and 17% compared with ROA and SDA.
Keywords:
Robots
Collision avoidance
Robot kinematics
Navigation
Heuristic algorithms
Mobile robots
Switches
Path planning
Voronoi diagram
Yen's algorithm
multi-robot path planning
collision-free
path-priority order
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
ShareSaveA New Multirobot Path Planning With Priority Order Based on the Generalized Voronoi Diagram.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSaveShareSaveShareSave
ShareSaveShareSave
View more