2011 Third International Conference on Computational Intelligence, Modelling &Amp; Simulation 2011
DOI: 10.1109/cimsim.2011.38
|View full text |Cite
|
Sign up to set email alerts
|

D* Lite Based Real-Time Multi-Agent Path Planning in Dynamic Environments

Abstract: D* based navigation algorithms provide robust and realtime means of achieving path planning in dynamic environments. Author of this paper introduces a notion of predictable time-based obstacles. The algorithm proposed in the paper defines a centralized obstacle-map that is shared among multiple agents (robots) performing path planning. Each robot plans its path individually on an obstacle-map using a slightly modified version of D* Lite and then shares an updated version of the map, which includes its planned … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
16
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 37 publications
(16 citation statements)
references
References 9 publications
0
16
0
Order By: Relevance
“…D* is an incremental algorithm widely used for path planning in a completely unknown or partially known environment, both for single robot and for multi-robot systems [6]. A multi-agent version of D* Lite, which is a variant of D* [18], is proposed in [1]. Another approach to apply D* Lite for planning the path for multi-robot system with implemented concept of parallel processing is proposed in [30].…”
Section: Related Workmentioning
confidence: 99%
“…D* is an incremental algorithm widely used for path planning in a completely unknown or partially known environment, both for single robot and for multi-robot systems [6]. A multi-agent version of D* Lite, which is a variant of D* [18], is proposed in [1]. Another approach to apply D* Lite for planning the path for multi-robot system with implemented concept of parallel processing is proposed in [30].…”
Section: Related Workmentioning
confidence: 99%
“…A* is an extension to Dijkstra algorithm, where it combines the cost search with heuristics that guide the search towards the goal point to achieve quicker searching performance. Many extensions of A* have been proposed, for instance Lifelong Planning A* (LPA*) [ 15 ] was developed to support changes in the environment without recalculating the entire graph, D* Lite [ 16 ] extends LPA* to re-plan the path while the robot is moving, Anytime Repairing A* (ARA*) [ 17 ] improves the optimality of the path by reusing suboptimal solutions from previous executions, and Hybrid-state A* [ 18 ] generates the graph based on the robot dynamics and thus searches for a dynamically feasible path.…”
Section: Related Workmentioning
confidence: 99%
“…Several robots have used the D* algorithm in combination with the Morphin local planner (which version provides local navigational autonomy for the NASA Mars Exploration Rovers [22]) to drive autonomously on rough terrain over long distances [23][24][25]. The D* algorithm is also successfully used as a planner for multi-robot systems [26], as well as D* Lite [27,28].…”
Section: Related Workmentioning
confidence: 99%