2015
DOI: 10.1007/978-3-319-15702-3_23
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of Algorithms for Multi-agent Pathfinding in Crowded Environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…Under the condition of multiple exits, the choice of destination needs to be considered when planning the route. Studies have shown that people are more inclined to choose exits that are closer In addition, this paper compares other dynamic programming algorithms in terms of real-time efficiency, path smoothness, and adaptability to complex constraints, and it ranks them in terms of three levels, high, medium, and low, based on existing studies [35][36][37] (Table 1). Here, higher real-time calculation efficiency means that the calculation has lower time complexity.…”
Section: Path Planning Based On the Corner Point Algorithm Of The Nav...mentioning
confidence: 99%
“…Under the condition of multiple exits, the choice of destination needs to be considered when planning the route. Studies have shown that people are more inclined to choose exits that are closer In addition, this paper compares other dynamic programming algorithms in terms of real-time efficiency, path smoothness, and adaptability to complex constraints, and it ranks them in terms of three levels, high, medium, and low, based on existing studies [35][36][37] (Table 1). Here, higher real-time calculation efficiency means that the calculation has lower time complexity.…”
Section: Path Planning Based On the Corner Point Algorithm Of The Nav...mentioning
confidence: 99%