2012
DOI: 10.1007/s13173-012-0071-9
|View full text |Cite
|
Sign up to set email alerts
|

Space D*

Abstract: This paper describes a new method of pathplanning for multiple robots in unknown environments. The method, called Space D*, is based on two algorithms: the D*, which is an incremental graph search algorithm, and the Space Colonization algorithm, previously used to simulate crowd behaviors. The path-planning is achieved through the exchange of information between the robots. So decentralized, each robot performs its path-planning, which provides an obstacle-free path with the least number of robots around. The … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
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 20 publications
(31 reference statements)
0
0
0
Order By: Relevance
“…In this study, the D* Lite algorithm is used in path planning. D* Lite implements D*'s strategy while looking for the most suitable path, but it works with a simple method and higher efficiency [31].…”
Section: Introductionmentioning
confidence: 99%
“…In this study, the D* Lite algorithm is used in path planning. D* Lite implements D*'s strategy while looking for the most suitable path, but it works with a simple method and higher efficiency [31].…”
Section: Introductionmentioning
confidence: 99%