The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A probabilistic approach to optimal robust path planning with obstacles
Abstract
Autonomous vehicles need to plan trajectories to a specified goal that avoid obstacles. Previous approaches that used a constrained optimization approach to solve for finite sequences of optimal control inputs have been highly effective. For robust execution, it is essential to take into account the inherent uncertainty in the problem, which arises due to uncertain localization, modeling errors, and disturbances. Prior work has handled the case of deterministically bounded uncertainty. We present here an alternative approach that uses a probabilistic representation of uncertainty, and plans the future probabilistic distribution of the vehicle state so that the probability of collision with obstacles is below a specified threshold. This approach has two main advantages; first, uncertainty is often modeled more naturally using a probabilistic representation (for example in the case of uncertain localization); second, by specifying the probability of successful execution, the desired level of conservatism in the plan can be specified in a meaningful manner. The key idea behind the approach is that the probabilistic obstacle avoidance problem can be expressed as a disjunctive linear program using linear chance constraints. The resulting disjunctive linear program has the same complexity as that corresponding to the deterministic path planning problem with no representation of uncertainty. Hence the resulting problem can be solved using existing, efficient techniques, such that planning with uncertainty requires minimal additional computation. Finally, we present an empirical validation of the new method with a number of aircraft obstacle avoidance scenarios
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343 · cited 1×
“As an alternative to these constrained optimization approaches, [14] used a randomized learning-and-query approach known as Probabilistic Roadmaps.”
Method
Cited by
Chance-Constrained Optimal Path Planning With Obstacles
Blackmore, L., Ono, M., & Williams, B. C. (2011) · IEEE Transactions on Robotics · doi:10.1109/tro.2011.2161160 · Cited by 427
Self-citationFunnel libraries for real-time robust feedback motion planning
Majumdar, A., & Tedrake, R. (2017) · The International Journal of Robotics Research · doi:10.1177/0278364917712421 · Cited by 350
Stochastic linear Model Predictive Control with chance constraints – A review
Farina, M., Giulioni, L., & Scattolini, R. (2016) · Journal of Process Control · doi:10.1016/j.jprocont.2016.03.005 · Cited by 342
Probabilistically safe motion planning to avoid dynamic obstacles with uncertain motion patterns
Aoude, G. S., Luders, B. D., Joseph, J. M., Roy, N., & How, J. P. (2013) · Autonomous Robots · doi:10.1007/s10514-013-9334-3 · Cited by 271
Metadata
- Authors
- Blackmore, L., Li, H., & Williams, B.
- Venue
- 2006 American Control Conference
- Publisher
- IEEE
- Published
- 2006
- Pages
- 7 pp.
- ISSN
- 0743-1619 (ISSN-L)
- OpenAlex
- W2159555929
- Cited by
- 178
- References
- 1
- FWCI
- 3.39
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A probabilistic approach to optimal robust path planning with obstacles. https://app.cochat.ai/papers/10.1109/acc.2006.1656653
- The paper
- Blackmore, L., Li, H., & Williams, B. (2006). A probabilistic approach to optimal robust path planning with obstacles. 2006 American Control Conference. https://doi.org/10.1109/acc.2006.1656653
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.