Smooth and collision-free navigation for multiple mobile robots and video game characters

The navigation of multiple mobile robots or virtual agents through environments containing static and dynamic obstacles to specified goal locations is an important problem in mobile robotics, many video games, and simulated environments. Moreover, technological advances in mobile robot hardware and video games consoles have allowed increasing numbers of mobile robots or virtual agents to navigate shared environments simultaneously. However, coordinating the navigation of large groups of mobile robots or virtual agents remains a difficult task. Kinematic and dynamic constraints and the effects of sensor and actuator uncertainty exaggerate the challenge of navigating multiple physical mobile robots, and video games players demand plausible motion and an ever increasing visual fidelity of virtual agents without sacrificing frame rate. We present new methods for navigating multiple mobile robots or virtual agents through shared environments, each using formulations based on velocity obstacles. These include algorithms that allow navigation through environments in two-dimensional or three-dimensional workspaces containing both static and dynamic obstacles without collisions or oscillations. Each mobile robot or virtual agent senses its surroundings and acts independently, without central coordination or inter-communication with its neighbors, implicitly assuming the neighbors use the same navigation strategy based on the notion of reciprocity. We use the position, velocity, and physical extent of neighboring mobile robots or virtual agents to compute their future trajectories to avoid collisions locally and show that, in principle, it is possible to theoretically guarantee that the motion of each mobile robot or virtual agent is smooth. Moreover, we demonstrate direct, collision-free, and oscillation-free navigation in experiments using physical iRobot Create mobile robots, simulations of multiple differential-drive robots or simple-airplanes, and video games levels containing hundreds of virtual agents.

[1]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[2]  Anthony Stentz,et al.  The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.

[3]  Kostas E. Bekris,et al.  A decentralized planner that guarantees the safety of communicating vehicles with complex dynamics that replan online , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[4]  Wolfram Burgard,et al.  Towards a navigation system for autonomous indoor flying , 2009, 2009 IEEE International Conference on Robotics and Automation.

[5]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[6]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[8]  Craig W. Reynolds.  Flocks, herds, and schools: a distributed behavioral model , 1987, SIGGRAPH.

[9]  Christian Laugier,et al.  Planning sub-optimal and continuous-curvature paths for car-like robots , 1998, Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190).

[10]  K. K. Nambiar,et al.  Foundations of Computer Science , 2001, Lecture Notes in Computer Science.

[11]  Erwin Prassler,et al.  Recursive Probabilistic Velocity Obstacles for Reflective Navigation , 2003, FSR.

[12]  Manuela Veloso,et al.  Real-Time Multi-Robot Motion Planning with Safe Dynamics , 2005 .

[13]  J. Sussmann,et al.  SHORTEST PATHS FOR THE REEDS-SHEPP CAR: A WORKED OUT EXAMPLE OF THE USE OF GEOMETRIC TECHNIQUES IN NONLINEAR OPTIMAL CONTROL. 1 , 1991 .

[14]  Christian Laugier,et al.  Dynamic Obstacle Avoidance in uncertain environment combining PVOs and Occupancy Grid , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[15]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[16]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[17]  Roland Siegwart,et al.  Smooth and efficient obstacle avoidance for a tour guide robot , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[18]  Dinesh Manocha,et al.  Way portals: efficient multi-agent navigation with line-segment goals , 2012, I3D '12.

[19]  Takashi Chikayama,et al.  Simulating the Collision Avoidance Behavior of Pedestrians , 2000 .

[20]  Nidhi Kalra,et al.  Replanning with RRTs , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[21]  Jonathan P. How,et al.  COORDINATION AND CONTROL OF MULTIPLE UAVs , 2002 .

[22]  H. Hexmoor,et al.  Cooperative Navigation Function based Navigation of Multiple Mobile Robots , 2007, 2007 International Conference on Integration of Knowledge Intensive Multi-Agent Systems.

[23]  Erwin Prassler,et al.  Coordinating the Motion of a Human and a Robot in a Crowded, Natural Environment , 2005 .

[24]  Dinesh Manocha,et al.  ClearPath: highly parallel collision avoidance for multi-agent simulation , 2009, SCA '09.

[25]  Nancy M. Amato,et al.  A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[26]  Helbing,et al.  Social force model for pedestrian dynamics. , 1995, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[27]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[28]  Dinesh Manocha,et al.  Least-effort trajectories lead to emergent crowd behaviors. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[30]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[31]  Jonathan P. How,et al.  Aircraft trajectory planning with collision avoidance using mixed integer linear programming , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[32]  Mark H. Overmars,et al.  Real Time Animation of Virtual Humans: A Trade‐off Between Naturalness and Control , 2010, Comput. Graph. Forum.

[33]  Devin J. Balkcom,et al.  Time Optimal Trajectories for Bounded Velocity Differential Drive Vehicles , 2002, Int. J. Robotics Res..

[34]  Jean-Claude Latombe.  A Fast Path Planner for a Car-Like Indoor Mobile Robot , 1991, AAAI.

[35]  Mark H. Overmars,et al.  Using the Corridor Map Method for Path Planning for a Large Number of Characters , 2008, MIG.

[36]  Dinesh Manocha,et al.  Interactive navigation of multiple agents in crowded environments , 2008, I3D '08.

[37]  Ronald C. Arkin,et al.  Cooperative control of multiple heterogeneous unmanned vehicles for coverage and surveillance [From the guest editors] , 2009 .

[38]  Yasuaki Abe,et al.  Collision avoidance method for multiple autonomous mobile agents by implicit cooperation , 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).

[39]  Zvi Shiller,et al.  Efficient and safe on-line motion planning in dynamic environments , 2009, 2009 IEEE International Conference on Robotics and Automation.

[40]  J.K. Hedrick,et al.  Border patrol and surveillance missions using multiple unmanned air vehicles , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[41]  Vijay Kumar,et al.  Experimental Testbed for Large Multirobot Teams , 2008, IEEE Robotics Autom. Mag..

[42]  Robert Evans,et al.  A Maneuvering-Board Approach to Path Planning with Moving Obstacles , 1989, IJCAI.

[43]  Thierry Siméon,et al.  A PRM-based motion planner for dynamically changing environments , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[44]  Maja J. Mataric,et al.  Motion planning using dynamic roadmaps , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[45]  Paolo Fiorini,et al.  Motion Planning in Dynamic Environments Using Velocity Obstacles , 1998, Int. J. Robotics Res..

[46]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

[47]  Jean-Paul Laumond,et al.  Guidelines in nonholonomic motion planning for mobile robots , 1998 .

[48]  Mark H. Overmars,et al.  Simulating the local behaviour of small pedestrian groups , 2010, VRST '10.

[49]  G. Muscato,et al.  The Alicia/sup 3/ climbing robot: a three-module robot for automatic wall inspection , 2006, IEEE Robotics & Automation Magazine.

[50]  Dinesh Manocha,et al.  Smooth Coordination and Navigation for Multiple Differential-Drive Robots , 2010, ISER.

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

[52]  D. Thalmann,et al.  A navigation graph for real-time crowd animation on multilayered and uneven terrain , 2005 .

[53]  Steven M. LaValle,et al.  Time-optimal paths for a Dubins airplane , 2007, 2007 46th IEEE Conference on Decision and Control.

[54]  Dinesh Manocha,et al.  Reciprocal Velocity Obstacles for real-time multi-agent navigation , 2008, 2008 IEEE International Conference on Robotics and Automation.

[55]  Jean-Daniel Boissonnat,et al.  Shortest paths of bounded curvature in the plane , 1994, J. Intell. Robotic Syst..

[56]  Jeremy A. Salinger,et al.  A Unified Approach to Forward and Lane-Change Collision Warning for Driver Assistance and Situational Awareness , 2008 .

[57]  Timothy W. McLain,et al.  Cooperative forest fire surveillance using a team of small unmanned air vehicles , 2006, Int. J. Syst. Sci..

[58]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

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

[60]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .

[61]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[62]  Paolo Fiorini,et al.  Introducing service robotics to the pharmaceutical industry , 2008, Intell. Serv. Robotics.

[63]  Dinesh Manocha,et al.  Reciprocal collision avoidance with acceleration-velocity obstacles , 2011, 2011 IEEE International Conference on Robotics and Automation.

[64]  Paolo Fiorini,et al.  Navigating a Robotic Wheelchair in a Railway Station during Rush Hour , 1999, Int. J. Robotics Res..

[65]  Antonio Bicchi,et al.  Decentralized Cooperative Policy for Conflict Resolution in Multivehicle Systems , 2007, IEEE Transactions on Robotics.

[66]  Esther M. Arkin,et al.  Maximum thick paths in static and dynamic environments , 2008, SCG '08.

[67]  Dinesh Manocha,et al.  Reciprocal n-Body Collision Avoidance , 2011, ISRR.

[68]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[69]  Javier González,et al.  Extending obstacle avoidance methods through multiple parameter-space transformations , 2008, Auton. Robots.

[70]  Yi-Jen Chiang,et al.  Geometric algorithms for conflict detection/resolution in air traffic management , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[71]  Roland Geraerts,et al.  Navigation meshes for realistic multi-layered environments , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[72]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[73]  Marcelo Kallmann.  Shortest paths with arbitrary clearance from navigation meshes , 2010, SCA '10.

[74]  Debasish Ghose,et al.  Obstacle avoidance in a dynamic environment: a collision cone approach , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[75]  Micha Sharir,et al.  Motion Planning in the Presence of Moving Obstacles , 1985, FOCS.

[76]  Stergios I. Roumeliotis,et al.  Propagation of Uncertainty in Cooperative Multirobot Localization: Analysis and Experimental Results , 2004, Auton. Robots.

[77]  Srinivas Akella,et al.  Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths , 2005, Int. J. Robotics Res..

[78]  F. Large,et al.  Using non-linear velocity obstacles to plan motions in a dynamic environment , 2002, 7th International Conference on Control, Automation, Robotics and Vision, 2002. ICARCV 2002..

[79]  Vijay Kumar,et al.  Modeling and control of formations of nonholonomic mobile robots , 2001, IEEE Trans. Robotics Autom..

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

[81]  Hirokazu Kato,et al.  Marker tracking and HMD calibration for a video-based augmented reality conferencing system , 1999, Proceedings 2nd IEEE and ACM International Workshop on Augmented Reality (IWAR'99).

[82]  Universitgtt des Saarlandes.  Fast Triangulation of the Plane with Respect to Simple Polygons , 2005 .

[83]  James J. Kuffner,et al.  Multipartite RRTs for Rapid Replanning in Dynamic Environments , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.