Guaranteeing Safety in Spatially Situated Agents

"Mission-critical" systems, which include such diverse applications as nuclear power plant controllers, "fly-by-wire" airplanes, medical care and monitoring systems, and autonomous mobile vehicles, are characterized by the fact that system failure is potentially catastrophic. The high cost of failure justifies the expenditure of considerable effort at design-time in order to guarantee the correctness of system behavior. This paper examines the problem of guaranteeing safety in a well studied class of robot motion problems known as the "asteroid avoidance problem." We establish necessary and sufficient conditions for ensuring safety in the simple version of this problem which occurs most frequently in the literature, as well as sufficient conditions for a more general and realistic case. In doing so, we establish functional relationships between the number, size and speed of obstacles, the robot's maximum speed and the conditions which must be maintained in order to ensure safety.

[1]  Ashok K. Agrawala,et al.  Design and implementation of Maruti-II , 1993 .

[2]  Hanan Samet,et al.  A hierarchical strategy for path planning among moving obstacles [mobile robot] , 1989, IEEE Trans. Robotics Autom..

[3]  Journal of the Association for Computing Machinery , 1961, Nature.

[4]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[5]  A WesleyMichael,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979 .

[6]  S. LaValle,et al.  Motion Planning , 2008, Springer Handbook of Robotics.

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

[8]  David J. Musliner,et al.  World Modeling for the Dynamic Construction of Real-Time Control Plans , 1995, Artif. Intell..

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

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

[11]  Thøger Bang,et al.  A solution of the “plank problem.” , 1951 .

[12]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.

[13]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[14]  Kurt Mehlhorn,et al.  Multi-dimensional searching and computational geometry , 1984 .