The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
SIPP: Safe interval path planning for dynamic environments
Abstract
Robotic path planning in static environments is a thoroughly studied problem that can typically be solved very efficiently. However, planning in the presence of dynamic obstacles is still computationally challenging because it requires adding time as an additional dimension to the search-space explored by the planner. In order to avoid the increase in the dimensionality of the planning problem, most real-time approaches to path planning treat dynamic obstacles as static and constantly re-plan as dynamic obstacles move. Although gaining efficiency, these approaches sacrifice optimality and even completeness. In this paper, we develop a planner that builds on the observation that while the number of safe timesteps in any configuration may be unbounded, the number of safe time intervals in a configuration is finite and generally very small. A safe interval is a time period for a configuration with no collisions and if it were extended one timestep in either direction, it would then be in collision. The planner exploits this observation and constructs a search-space with states defined by their configuration and safe interval, resulting in a graph that generally only has a few states per configuration. On the theoretical side, we show that our planner can provide the same optimality and completeness guarantees as planning with time as an additional dimension. On the experimental side, in simulation tests with up to 200 dynamic obstacles, we show that our planner is significantly faster, making it feasible to use in real-time on robots operating in large dynamic environments. We also ran several real robot trials on the PR2, a mobile manipulation platform.
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
The dynamic window approach to collision avoidance
Fox, D., Burgard, W., & Thrun, S. (1997) · IEEE Robotics & Automation Magazine · doi:10.1109/100.580977 · Cited by 3,771
Randomized Kinodynamic Motion Planning with Moving Obstacles
Hsu, D., Kindel, R., Latombe, J.-C., & Rock, S. (2002) · The International Journal of Robotics Research · doi:10.1177/027836402320556421 · Cited by 771
Incremental Sampling-based Algorithms for Optimal Motion Planning
Karaman, S., & Frazzoli, E. (2010) · Robotics: Science and Systems VI · doi:10.15607/rss.2010.vi.034 · Cited by 680
ARA*: Anytime A* with Provable Bounds on Sub-Optimality
Likhachev, M. A., Gordon, G. J., & Thrun, S. (2003) · Cited by 643
Self-citationPlanning Long Dynamically Feasible Maneuvers for Autonomous Vehicles
Likhachev, M., & Ferguson, D. (2009) · The International Journal of Robotics Research · doi:10.1177/0278364909340445 · Cited by 512
Self-citationSafe motion planning in dynamic environments
Petti, S., & Fraichard, T. (2005) · 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2005.1545549 · Cited by 264
Anytime path planning and replanning in dynamic environments
van den Berg, J., Ferguson, D., & Kuffner, J. (2006) · Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. · doi:10.1109/robot.2006.1642056 · Cited by 241
Generalized velocity obstacles
Wilkie, D., van den Berg, J., & Manocha, D. (2009) · 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2009.5354175 · Cited by 241
Roadmap-based motion planning in dynamic environments
van den Berg, J. P., & Overmars, M. H. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2005.851378 · Cited by 183
Greedy but Safe Replanning under Kinodynamic Constraints
Bekris, K. E., & Kavraki, L. E. (2007) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2007.363069 · Cited by 134
Cited by
Human-aware robot navigation: A survey
Kruse, T., Pandey, A. K., Alami, R., & Kirsch, A. (2013) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2013.05.007 · Cited by 742
Socially aware motion planning with deep reinforcement learning
Chen, Y. F., Everett, M., Liu, M., & How, J. P. (2017) · 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2017.8202312 · Cited by 719
Decentralized non-communicating multiagent collision avoidance with deep reinforcement learning
Chen, Y. F., Liu, M., Everett, M., & How, J. P. (2017) · 2017 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2017.7989037 · Cited by 645
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Stern, R., Sturtevant, N., Felner, A., Koenig, S., Ma, H., Walker, T., Li, J., Atzmon, D., Cohen, L., Kumar, T. K., et al. (2021) · Proceedings of the International Symposium on Combinatorial Search · doi:10.1609/socs.v10i1.18510 · Cited by 645
Mobile Robot Path Planning in Dynamic Environments Through Globally Guided Reinforcement Learning
Wang, B., Liu, Z., Li, Q., & Prorok, A. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.3026638 · Cited by 372
Metadata
- Authors
- Phillips, M., & Likhachev, M.
- Venue
- 2011 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2011-05
- Pages
- 5628-5635
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2168424616
- Cited by
- 350
- References
- 12
- FWCI
- 9.09
- 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: SIPP: Safe interval path planning for dynamic environments. https://app.cochat.ai/papers/10.1109/icra.2011.5980306
- The paper
- Phillips, M., & Likhachev, M. (2011). SIPP: Safe interval path planning for dynamic environments. 2011 IEEE International Conference on Robotics and Automation. https://doi.org/10.1109/icra.2011.5980306
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.