2012 IEEE International Conference on Robotics and Automation 2012
DOI: 10.1109/icra.2012.6224773
|View full text |Cite
|
Sign up to set email alerts
|

Using state dominance for path planning in dynamic environments with moving obstacles

Abstract: Abstract-Path planning in dynamic environments with moving obstacles is computationally complex since it requires modeling time as an additional dimension. While in other domains there are state dominance relationships that can significantly reduce the complexity of the search, in dynamic environments such relationships do not exist. This paper presents a novel state dominance relationship tailored specifically for dynamic environments, and presents a planner that uses that property to plan paths over ten time… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(16 citation statements)
references
References 9 publications
(10 reference statements)
0
16
0
Order By: Relevance
“…Naturalness [1,6,7,13,27,28,35,37,38,43,45,48,49,50,53,54,79,62,63,66,67,68,69,70,71,72,81,82,83,84,87,88,89,90,91,93,98,99]…”
Section: Challenges Of Human-aware Navigationmentioning
confidence: 99%
See 2 more Smart Citations
“…Naturalness [1,6,7,13,27,28,35,37,38,43,45,48,49,50,53,54,79,62,63,66,67,68,69,70,71,72,81,82,83,84,87,88,89,90,91,93,98,99]…”
Section: Challenges Of Human-aware Navigationmentioning
confidence: 99%
“…The temporal dimension in that work is segmented into safe and unsafe intervals instead of regularly discretized time, reducing the search space expansion. Gonzalez et al [28] enhance that idea allowing for continous cost functions as well, a prerequisite to apply social cost functions to search.…”
Section: Temporal Planningmentioning
confidence: 99%
See 1 more Smart Citation
“…Early works explored control sampling approaches [240], and recent state sampling works have made model simplifications to handle the differential constraints in an online manner, such as keeping to a constant ego robot speed [251]. Others have performed planning by graph search over a discrete, time-bounded lattice structure built from motion primitives [252], or a grid cell decomposition of the state space [253], though these methods loose the benefits of sampling based approaches (which are less limited in resolution, and have potential for rewiring and optimization).…”
Section: Planning Subject To Differential Constraintsmentioning
confidence: 99%
“…Therefore, it is mandatory to constrain the path searches only to high priority space during pathfinding to effectively resolve the efficiency and optimality trade-off. Various approaches have been proposed to speed-up the path computations, such as hierarchical abstractions [42][43][44], symmetry breaking [45,46], jump point search [47][48][49][50], sub-goal graphs [51], compressed path databases [52,53], accurate heuristics [54], swamp hierarchies [55], pruning dominant states [56], influence-aware pathfinders [57], and constraints-aware navigation (CAN) [58]. Despite the success of such enhancements, in most cases, either many locations of the maps are searched needlessly, or path length degrades.…”
Section: Introductionmentioning
confidence: 99%