Contingency Planning Over Probabilistic Obstacle Predictions for Autonomous Road Vehicles
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
This paper presents a novel optimization-based path planner that is capable of planning multiple contingency paths to directly account for uncertainties in the future trajectories of dynamic obstacles. This planner addresses the particular problem of probabilistic collision avoidance for autonomous road vehicles that are required to safely interact, in close proximity, with other vehicles with unknown intentions. The presented path planner utilizes an efficient spline-based trajectory representation and fast but accurate collision probability bounds to simultaneously optimize multiple continuous contingency paths in real time. These collision probability bounds are efficient enough for real-time evaluation, yet accurate enough to allow for practical close-proximity driving behaviors such as passing an obstacle vehicle in an adjacent lane. An obstacle trajectory clustering algorithm is also presented to enable the path planner to scale to multiple-obstacle scenarios. Simulation results show that the contingency planner allows for a more aggressive driving style than planning a single path without compromising the overall safety of the robot.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Motion Planning in Dynamic Environments Using Velocity Obstacles
Fiorini, P., & Shiller, Z. (1998) · The International Journal of Robotics Research · doi:10.1177/027836499801700706 · Cited by 2,008
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858 · cited 1×
“With this formulation, the path-planning problem can be solved using well-known convex optimization techniques, including interior point methods [24] and sequential quadratic programming methods [25].”
MethodAutonomous driving in urban environments: Boss and the Urban Challenge
Urmson, C., Anhalt, J., Bagnell, D., Baker, C., Bittner, R., Clark, M. N., Dolan, J., Duggins, D., Galatali, T., Geyer, C., et al. (2008) · Journal of Field Robotics · doi:10.1002/rob.20255 · Cited by 1,555
Learning Motion Patterns of People for Compliant Robot Motion
Bennewitz, M., Burgard, W., Cielniak, G., & Thrun, S. (2005) · The International Journal of Robotics Research · doi:10.1177/0278364904048962 · Cited by 399
Cited by
A Review of Motion Planning Techniques for Automated Vehicles
Gonzalez, D., Perez, J., Milanes, V., & Nashashibi, F. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2498841 · Cited by 1,670
Katrakazas, C., Quddus, M., Chen, W.-H., & Deka, L. (2015) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2015.09.011 · Cited by 800
Artificial intelligence applications in the development of autonomous vehicles: a survey
Ma, Y., Wang, Z., Yang, H., & Yang, L. (2020) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2020.1003021 · Cited by 639
“These methods typically include artificial potential field, distance control algorithm, bumper event approach, wall-following, sliding mode control, dijkstra, stereo block matching, voronoi diagram, SLAM, vector field histogram, rapidly exploring random tree, curvature velocity, lane curvature, dynamic window, and tan…”
MethodEnd-to-end Interpretable Neural Motion Planner
Zeng, W., Luo, W., Suo, S., Sadat, A., Yang, B., Casas, S., & Urtasun, R. (2021) · arXiv · doi:10.48550/arxiv.2101.06679 · Cited by 406
End-To-End Interpretable Neural Motion Planner
Zeng, W., Luo, W., Suo, S., Sadat, A., Yang, B., Casas, S., & Urtasun, R. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00886 · Cited by 398
Chance-Constrained Collision Avoidance for MAVs in Dynamic Environments
Zhu, H., & Alonso-Mora, J. (2019) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2019.2893494 · Cited by 276
Interpretable Goal-based Prediction and Planning for Autonomous Driving
Albrecht, S. V., Brewitt, C., Wilhelm, J., Gyevnar, B., Eiras, F., Dobre, M., & Ramamoorthy, S. (2021) · 2021 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra48506.2021.9560849 · Cited by 12
“approach is to specify a finite set of possible goals for each other vehicle (such as road exit points) and to plan a full trajectory to each goal from the vehicle’s observed local state [8], [9], [10].”
Background
Metadata
- Authors
- Hardy, J., & Campbell, M.
- Venue
- IEEE Transactions on Robotics
- Published
- 2013-08
- Volume
- 29
- Issue
- 4
- Pages
- 913-929
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W2005443352
- Cited by
- 129
- References
- 4
- FWCI
- 4.09
- Type
- journal article
- 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
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.