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

Path planning with uncertainty: Voronoi Uncertainty Fields

Abstract: Abstract-In this paper, a two-level path planning algorithm that deals with map uncertainty is proposed. The higher level planner uses modified generalized Voronoi diagrams to guarantee finding a connected path from the start to the goal if a collision-free path exists. The lower level planner considers uncertainty of the observed obstacles in the environment and assigns repulsive forces based on their distance to the robot and their positional uncertainty. The attractive forces from the Voronoi nodes and the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
20
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 39 publications
(20 citation statements)
references
References 18 publications
0
20
0
Order By: Relevance
“…2) Navigation Planning: A two-level approach to collision-free navigation using artificial potential fields on the lower layer is proposed in [22]. Similar to our work, completeness of the path planner is guaranteed by an allocentric layer on top of local collision avoidance.…”
Section: Related Workmentioning
confidence: 92%
“…2) Navigation Planning: A two-level approach to collision-free navigation using artificial potential fields on the lower layer is proposed in [22]. Similar to our work, completeness of the path planner is guaranteed by an allocentric layer on top of local collision avoidance.…”
Section: Related Workmentioning
confidence: 92%
“…, p K ), which are the intervals that allow responders to pass through the roads. For example, for a user who defines risk level as follows: full-safe levels={L1, L2}, partial-safe levels={L3, L4}, and non-safe levels = {L5}, a timeline, as shown in Figure 6, can be converted into a list of full-safe intervals ([0, 9], [20, +∞]), a list of partial-safe intervals ( [13,20]), and a list of open intervals ([0, 9], [13, +∞]). It should be noted that we do not consider the non-safe intervals in the routing as they are excluded from the search space.…”
Section: A Defining Safe Intervalsmentioning
confidence: 99%
“…Ok et al [13] develop a path planner called Voronoi Uncertainty Fields, which uses Voronoi diagrams and potential fields to deal with map uncertainties. Neumany and Likhachevy [12] design a generalization to the PPCP (Probabilistic Planning with Clear Preferences) algorithm, which allows a robot to reason about uncertainty in the trajectories of dynamic obstacles.…”
Section: Introductionmentioning
confidence: 99%
“…Same works attempt to combine potential fields with a global guiding structure that is estimated from a known environment to attain global path planning (Ok et aL 2013). Other types of fields such as gradient fields of harmonic scalar fields have also been studied [Shade and Newman 2011).…”
Section: Related Workmentioning
confidence: 99%