2009 IEEE/RSJ International Conference on Intelligent Robots and Systems 2009
DOI: 10.1109/iros.2009.5354418
|View full text |Cite
|
Sign up to set email alerts
|

Stochastic mobility-based path planning in uncertain environments

Abstract: The ability of mobile robots to generate feasible trajectories online is an important requirement for their autonomous operation in unstructured environments. Many path generation techniques focus on generation of time-or distance-optimal paths while obeying dynamic constraints, and often assume precise knowledge of robot and/or environmental (i.e. terrain) properties. In uneven terrain, it is essential that the robot mobility over the terrain be explicitly considered in the planning process. Further, since si… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
38
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 53 publications
(38 citation statements)
references
References 16 publications
0
38
0
Order By: Relevance
“…Particle RRT 23 uses particles to sample uncertain motion, while Kewlani et al use a finite-series approximation of the uncertainty propagation. 24 Pepy et al outer-approximate uncertainty sets to guarantee robust feasibility for nonlinear systems subject to bounded internal uncertainty. 25 The LQG-MP algorithm 26 linearizes nonlinear dynamics subject to motion and sensing uncertainty, applying LQG to connect states within an RRT.…”
Section: Related Workmentioning
confidence: 99%
“…Particle RRT 23 uses particles to sample uncertain motion, while Kewlani et al use a finite-series approximation of the uncertainty propagation. 24 Pepy et al outer-approximate uncertainty sets to guarantee robust feasibility for nonlinear systems subject to bounded internal uncertainty. 25 The LQG-MP algorithm 26 linearizes nonlinear dynamics subject to motion and sensing uncertainty, applying LQG to connect states within an RRT.…”
Section: Related Workmentioning
confidence: 99%
“…A recently-proposed algorithm identifies a finite-series approximation of the uncertainty propagation, in order to reduce model complexity and the resulting number of simulations needed per node. 21 In contrast, the proposed approach in this paper requires only one simulation per node, with optional additional calculations to compute collision probability at each time step.…”
Section: Related Workmentioning
confidence: 99%
“…However, the RRT does not explicitly incorporate uncertainty. Recently, efforts have been made to extend the RRT algorithm to an uncertain environment (Fulgenzi, Tay, Spalanzani, & Laugier, 2008;Kewlani, Ishigami, & Iagnemma, 2009;Melchior & Simmons, 2007). In this paper, we also propose an extension of the RRT algorithm to handle uncertainty in dynamic environments.…”
Section: Introductionmentioning
confidence: 99%