Inevitable collision states — a step towards safer robots?

An inevitable collision state for a robotic system can be defined as a state for which, no matter what the future trajectory followed by the system is, a collision with an obstacle eventually occurs. An inevitable collision state takes into account the dynamics of both the system and the obstacles, fixed or moving. The main contribution of this paper is to lay down and explore this novel concept (and the companion concept of inevitable collision obstacle). Formal definitions of the inevitable collision states and obstacles are given. Properties fundamental for their characterization are established. This concept is very general, and can be useful both for navigation and motion planning purposes (for its own safety, a robotic system should never find itself in an inevitable collision state). To illustrate the interest of this concept, it is applied to a problem of safe motion planning for a robotic system subject to sensing constraints in a partially known environment (i.e. that may contain unexpected obstacles). In safe motion planning, the issue is to compute motions for which it is guaranteed that, no matter what happens at execution time, the robotic system never finds itself in a situation where there is no way for it to avoid collision with an unexpected obstacle.

[1]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

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

[3]  Reid G. Simmons,et al.  The curvature-velocity method for local obstacle avoidance , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[4]  Hajime Asama,et al.  Inevitable collision states. A step towards safer robots? , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[5]  Amy R. Pritchett,et al.  Experimental Studies Of Pilot Performance At Collision Avoidance During Closely Spaced Parallel Approaches , 1997 .

[6]  Steven Skiena,et al.  The Algorithm Design Manual , 2020, Texts in Computer Science.

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

[8]  K. Madhava Krishna,et al.  On the influence of sensor capacities and environment dynamics onto collision-free motion plans , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[9]  Thierry Fraichard,et al.  Trajectory planning in a dynamic workspace: a 'state-time space' approach , 1998, Adv. Robotics.

[10]  Stefan Näher,et al.  LEDA: A Library of Efficient Data Types and Algorithms , 1989, STACS.

[11]  Rodney Teo Computing danger zones for provably safe closely spaced parallel approaches: Theory and experiment , 2003 .

[12]  G. Swaminathan Robot Motion Planning , 2006 .

[13]  Kurt Mehlhorn,et al.  LEDA: A Library of Efficient Data Types and Algorithms , 1990, ICALP.

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

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

[16]  Wyatt S. Newman,et al.  Reflexive collision avoidance: a generalized approach , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[17]  Oliver Brock,et al.  High-speed navigation using the global dynamic window approach , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[18]  Christian Laugier,et al.  Towards real-time global motion planning in a dynamic environment using the NLVO concept , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[19]  Reid G. Simmons,et al.  The lane-curvature method for local obstacle avoidance , 1998, Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190).

[20]  P. N. Paraskevopoulos,et al.  Modern Control Engineering , 2001 .

[21]  S. LaValle Rapidly-exploring random trees : a new tool for path planning , 1998 .

[22]  Jean-Paul Laumond,et al.  Obstacle Growing in a Nonpolygonal World , 1987, Inf. Process. Lett..

[23]  Thierry Fraichard,et al.  Dynamic trajectory planning with dynamic constraints: A 'state-time space' approach , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[24]  Patrick Gordon Xavier Provably-good approximation algorithms for optimal kinodynamic robot motion plans , 1992 .