2018
DOI: 10.1007/978-3-030-00184-1_16
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Multi-robot Path Finding Algorithm Based on A*

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0
1

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 2 publications
0
2
0
1
Order By: Relevance
“…In Table 4, a metric evaluation of the RA-RRT* algorithm with the A*, RRT*, and Dijkstra algorithms regarding speed and accuracy is shown. It is found that the A* algorithm is more efficient in a directional and known environment, whereas the Dijkstra and RRT* algorithms are more feasible in an undirected environment (Erokhin et al, 2018). Based on the experimental results, the proposed RA-RRT* is proven to be more efficient due to the requirement to simultaneously search for the charging stations and the minimum optimal path in an undirected environment because of the tree structure.…”
Section: The Comparison Among Path Planning Algorithmsmentioning
confidence: 96%
“…In Table 4, a metric evaluation of the RA-RRT* algorithm with the A*, RRT*, and Dijkstra algorithms regarding speed and accuracy is shown. It is found that the A* algorithm is more efficient in a directional and known environment, whereas the Dijkstra and RRT* algorithms are more feasible in an undirected environment (Erokhin et al, 2018). Based on the experimental results, the proposed RA-RRT* is proven to be more efficient due to the requirement to simultaneously search for the charging stations and the minimum optimal path in an undirected environment because of the tree structure.…”
Section: The Comparison Among Path Planning Algorithmsmentioning
confidence: 96%
“…However, the algorithm proposed in this paper can only be used in static environments and cannot be applied to dynamic scenes. In [58], an improved A* algorithm is proposed for coordinated path planning of a robotic swarm. This algorithm assigns dynamic values to each node, such that when a robot's path passes through a node, its assigned value changes dynamically.…”
Section: ) Search-based Multi-robot Path Planning Algorithmmentioning
confidence: 99%
“…La literatura recoge trabajos en los que se ha implementado el algoritmo A*, en ocasiones con modicaciones, adaptado a la planicación de rutas con múltiples vehículos (151). En dicha investigación, se realiza un cálculo dinámico del valor de los costes asociados a los nodos de la red.…”
Section: Algoritmo A*unclassified