Robust mobility in human-populated environments

Creating robots that can help humans in a variety of tasks requires robust mobility and the ability to safely navigate among moving obstacles. This paper presents an overview of recent research in the Robotics Collaborative Technology Alliance (RCTA) that addresses many of the core requirements for robust mobility in human-populated environments. Safe Interval Path Planning (SIPP) allows for very fast planning in dynamic environments when planning timeminimal trajectories. Generalized Safe Interval Path Planning extends this concept to trajectories that minimize arbitrary cost functions. Finally, generalized PPCP algorithm is used to generate plans that reason about the uncertainty in the predicted trajectories of moving obstacles and try to actively disambiguate the intentions of humans whenever necessary. We show how these approaches consider moving obstacles and temporal constraints and produce high-fidelity paths. Experiments in simulated environments show the performance of the algorithms under different controlled conditions, and experiments on physical mobile robots interacting with humans show how the algorithms perform under the uncertainties of the real world.

[1]  Hideo Fujiwara,et al.  An efficient test generation algorithm based on search state dominance , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.

[2]  Maxim Likhachev,et al.  Using state dominance for path planning in dynamic environments with moving obstacles , 2012, 2012 IEEE International Conference on Robotics and Automation.

[3]  Blai Bonet,et al.  Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.

[4]  Anthony Stentz,et al.  PPCP: Efficient Probabilistic Planning with Clear Preferences in Partially-Known Environments , 2006, AAAI.

[5]  Anthony Stentz,et al.  Planning with uncertainty in position an optimal and efficient planner , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[6]  Jianbo Shi,et al.  Multi-hypothesis motion planning for visual object tracking , 2011, 2011 International Conference on Computer Vision.

[7]  Thierry Fraichard,et al.  Safe motion planning in dynamic environments , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[8]  Vladik Kreinovich,et al.  Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness , 1999, IJCAI.

[9]  Oliver Brock,et al.  Planning Long Dynamically-Feasible Maneuvers for Autonomous Vehicles , 2009 .

[10]  Kostas E. Bekris,et al.  Greedy but Safe Replanning under Kinodynamic Constraints , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[11]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[12]  John N. Tsitsiklis,et al.  The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..

[13]  Anthony Stentz,et al.  DD* Lite: Efficient Incremental Search with State Dominance , 2006, AAAI.

[14]  Maxim Likhachev,et al.  SIPP: Safe interval path planning for dynamic environments , 2011, 2011 IEEE International Conference on Robotics and Automation.

[15]  Mark H. Overmars,et al.  Roadmap-based motion planning in dynamic environments , 2005, IEEE Trans. Robotics.

[16]  Siddhartha S. Srinivasa,et al.  Planning-based prediction for pedestrians , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[17]  Wolfram Burgard,et al.  The dynamic window approach to collision avoidance , 1997, IEEE Robotics Autom. Mag..

[18]  Maxim Likhachev,et al.  Time-bounded lattice for efficient planning in dynamic environments , 2009, 2009 IEEE International Conference on Robotics and Automation.

[19]  Anthony Stentz,et al.  Using linear landmarks for path planning with uncertainty in outdoor environments , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[20]  Jean-Claude Latombe,et al.  Randomized Kinodynamic Motion Planning with Moving Obstacles , 2002, Int. J. Robotics Res..

[21]  Anthony Stentz,et al.  Mission-level path planning and re-planning for rover exploration , 2006, Robotics Auton. Syst..

[22]  Jur P. van den Berg,et al.  Anytime path planning and replanning in dynamic environments , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..