2018
DOI: 10.1007/s10458-018-9391-2
|View full text |Cite
|
Sign up to set email alerts
|

A complete multi-robot path-planning algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2025
2025

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…Push-and-Swap (Luna & Bekris, 2011) uses "swap" macro to swap locations between two adjacent dependent agents. Its variants Push-and-Rotate (De Wilde et al, 2014), Push-and-Spin (Alotaibi & Al-Rawi, 2018), etc., use more macros to handle complex situations and graphs. However, deadlocks often happen in narrow corridors and inter-agent collision-free may not be guaranteed, so the algorithms may fail to find paths even the paths exist (incompleteness).…”
Section: Sub-optimal Solvers For Centralized Mpfmentioning
confidence: 99%
See 1 more Smart Citation
“…Push-and-Swap (Luna & Bekris, 2011) uses "swap" macro to swap locations between two adjacent dependent agents. Its variants Push-and-Rotate (De Wilde et al, 2014), Push-and-Spin (Alotaibi & Al-Rawi, 2018), etc., use more macros to handle complex situations and graphs. However, deadlocks often happen in narrow corridors and inter-agent collision-free may not be guaranteed, so the algorithms may fail to find paths even the paths exist (incompleteness).…”
Section: Sub-optimal Solvers For Centralized Mpfmentioning
confidence: 99%
“…By contrast, when adding the space cost function, the method successfully generates the extra paths ( 4 , 5 ). In this section, we compare the proposed sequential route network planning method with two kinds of state-of-theart MPF algorithms on a 2D standard test scenario: one is a two-level-based optimal method -conflict-based search (CBS) (Sharon et al, 2015), and one is a rule-based sub-optimal method -Push-and-Spin (Alotaibi & Al-Rawi, 2018). The scenario is shown in Figure 14.…”
Section: Illustration With a Toy Examplementioning
confidence: 99%
“…(1) Provide framework By introducing the path planning algorithm, it is not difficult to find that the current hotspot project belongs to the intelligent path planning method. The traditional path planning method is the help method of the group intelligent path planning method [12]. Models and other steps, current research on multiple robot path planning methods will simultaneously consider multiple path optimization indexes.…”
Section: Date Mining Statistic Analysis Representationmentioning
confidence: 99%