LQG-MP: Optimized path planning for robots with motion uncertainty and imperfect state information
The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Abstract
In this paper we present LQG-MP (linear-quadratic Gaussian motion planning), a new approach to robot motion planning that takes into account the sensors and the controller that will be used during the execution of the robot’s path. LQG-MP is based on the linear-quadratic controller with Gaussian models of uncertainty, and explicitly characterizes in advance (i.e. before execution) the a priori probability distributions of the state of the robot along its path. These distributions can be used to assess the quality of the path, for instance by computing the probability of avoiding collisions. Many methods can be used to generate the required ensemble of candidate paths from which the best path is selected; in this paper we report results using rapidly exploring random trees (RRT). We study the performance of LQG-MP with simulation experiments in three scenarios: (A) a kinodynamic car-like robot, (B) multi-robot planning with differential-drive robots, and (C) a 6-DOF serial manipulator. We also present a method that applies Kalman smoothing to make paths C k-continuous and apply LQG-MP to precomputed roadmaps using a variant of Dijkstra’s algorithm to efficiently find high-quality paths.
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
(1995) · Cited by 10,558
Thrun, S. (2002) · Communications of the ACM · doi:10.1145/504729.504754 · Cited by 7,994
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
LaValle, S. M. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
LaValle, S. M. (2006) · Cited by 4,177
Planning and acting in partially observable stochastic domains
Kaelbling, L. P., Littman, M. L., & Cassandra, A. R. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00023-x · Cited by 4,149
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Maximum likelihood estimates of linear dynamic systems
RAUCH, H. E., TUNG, F., & STRIEBEL, C. T. (1965) · AIAA Journal · doi:10.2514/3.3166 · Cited by 1,943
The Complexity of Markov Decision Processes
Papadimitriou, C. H., & Tsitsiklis, J. N. (1987) · Mathematics of Operations Research · doi:10.1287/moor.12.3.441 · Cited by 1,329 · cited 1×
“(9) This is the standard formulation of an LQG-control problem.”
BackgroundProceedings of the 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems
(2001) · Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems Expanding the Societal Role of Robotics in the the Next Millennium (Cat No 01CH37180) IROS-01 · doi:10.1109/iros.2001.977143 · Cited by 1,197
Proceedings 1992 IEEE International Conference on Robotics and Automation
(1992) · doi:10.1109/robot.1992 · Cited by 1,084
SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces
Kurniawati, H., Hsu, D., & Sun Lee, W. (2008) · Robotics: Science and Systems IV · doi:10.15607/rss.2008.iv.009 · Cited by 759
Prioritized motion planning for multiple robots
van den Berg, J. P., & Overmars, M. H. (2005) · 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2005.1545306 · Cited by 308
Self-citationBelief space planning assuming maximum likelihood observations
Platt, R., Tedrake, R., Kaelbling, L., & Lozano-Perez, T. (2010) · Robotics: Science and Systems VI · doi:10.15607/rss.2010.vi.037 · Cited by 298
The Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance
Prentice, S., & Roy, N. (2009) · The International Journal of Robotics Research · doi:10.1177/0278364909341659 · Cited by 269
Point-Based Value Iteration for Continuous POMDPs
Porta, J. M., Vlassis, N. A., Spaan, M. T. J., & Poupart, P. (2006) · DIGITAL.CSIC (Spanish National Research Council (CSIC)) · doi:10.13039/501100000780 · Cited by 234
The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty
Alterovitz, R., Simeon, T., & Goldberg, K. (2007) · Robotics: Science and Systems III · doi:10.15607/rss.2007.iii.030 · Cited by 232
Self-citationParticle RRT for Path Planning with Uncertainty
Melchior, N. A., & Simmons, R. (2007) · Proceedings 2007 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2007.363555 · Cited by 229
Creating High-quality Paths for Motion Planning
Geraerts, R., & Overmars, M. H. (2007) · The International Journal of Robotics Research · doi:10.1177/0278364907079280 · Cited by 220
Coastal navigation-mobile robot navigation with uncertainty in dynamic environments
Roy, N., Burgard, W., Fox, D., & Thrun, S. (2003) · Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C) · doi:10.1109/robot.1999.769927 · Cited by 215
LQR-trees: Feedback motion planning on sparse randomized trees
Tedrake, R. (2009) · Robotics: Science and Systems · doi:10.15607/rss.2009.v.003 · Cited by 203
Motion Planning in Complex Environments Using Closed-loop Prediction
Kuwata, Y., Teo, J., Karaman, S., Fiore, G. A., Frazzoli, E., & How, J. P. (2008) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2008-7166 · Cited by 189
Adapting probabilistic roadmaps to handle uncertain maps
Missiuro, P. V., & Roy, N. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2006.1641882 · Cited by 139
The Belief Roadmap: Efficient Planning in Linear POMDPs by Factoring the Covariance
Prentice, S., & Roy, N. (2010) · Springer tracts in advanced robotics · doi:10.1007/978-3-642-14743-2_25 · Cited by 102
Motion planning with uncertainty: a landmark approach
Lazanas, A., & Latombe, J. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00079-g · Cited by 96
Safe Path Planning in an Uncertain-Configuration Space using RRT
Pepy, R., & Lambert, A. (2006) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2006.282101 · Cited by 89
Sampling-Based Motion Planning With Sensing Uncertainty
Burns, B., & Brock, O. (2007) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2007.363984 · Cited by 80
Path planning with uncertainty for car-like robots
Fraichard, T., & Mermond, R. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1998.676244 · Cited by 65
Stochastic mobility-based path planning in uncertain environments
Kewlani, G., Ishigami, G., & Iagnemma, K. D. (2009) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2009.5354418 · Cited by 61
icLQG: Combining local and global optimization for control in information space
Huynh, V. A., & Roy, N. (2009) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2009.5152607 · Cited by 28
Collision-probability constrained PRM for a manipulator with base pose uncertainty
Huang, Y., & Gupta, K. K. (2009) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2009.5354168 · Cited by 24
Cited by
Path Planning with Modified a Star Algorithm for a Mobile Robot
Duchoň, F., Babinec, A., Kajan, M., Beňo, P., Florek, M., Fico, T., & Jurišica, L. (2014) · Procedia Engineering · doi:10.1016/j.proeng.2014.12.098 · Cited by 869
A Survey of Research on Cloud Robotics and Automation
Kehoe, B., Patil, S., Abbeel, P., & Goldberg, K. (2015) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2014.2376492 · Cited by 833
Self-citationPerception, Planning, Control, and Coordination for Autonomous Vehicles
Pendleton, S., Andersen, H., Du, X., Shen, X., Meghjani, M., Eng, Y., Rus, D., & Ang, M. (2017) · Machines · doi:10.3390/machines5010006 · Cited by 657
Opportunities and challenges with autonomous micro aerial vehicles
Kumar, V., & Michael, N. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364912455954 · Cited by 472
Integrated task and motion planning in belief space
Kaelbling, L. P., & Lozano-Pérez, T. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913484072 · Cited by 328
Metadata
- Authors
- van den Berg, J., Abbeel, P., & Goldberg, K.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2011-06
- Volume
- 30
- Issue
- 7
- Pages
- 895-913
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2002201291
- Cited by
- 395
- References
- 31
- FWCI
- 27.26
- 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.