Viability-Based Guaranteed Safe Robot Navigation

International audienceGuaranteeing safe, i.e. collision-free, motion for robotic systems is usually tackled in the Inevitable Collision State (ICS) framework. This paper explores the use of the more general Viability theory as an alternative when safe motion involves multiple motion constraints and not just collision avoidance. Central to Viability is the so-called viability kernel, i.e. the set of states of the robotic system for which there is at least one trajectory that satisfies the motion constraints forever. The paper presents an algorithm that computes off-line an approximation of the viability kernel that is both conservative and able to handle time-varying constraints such as moving obstacles. Then it demonstrates, for different robotic scenarios involving multiple motion constraints (collision avoidance, visibility, velocity), how to use the viability kernel computed off-line within an on-line reactive navigation scheme that can drive the robotic system without ever violating the motion constraints at hand

Approximate Safety Enforcement Using Computed Viability Envelopes

A numerical method is proposed for the constraint of the state of a dynamical system such that it cannot enter a predefined failure region. The proposed approach to this viability problem involves an explicit numerical approximation of a viability envelope, coupled with a practical strategy for enforcing containment that is based upon a predictive look-ahead strategy. The approach can be applied to achieve automated "intervention when necessary" to enforce system safety at interactive rates. Applications are shown to several low-dimensional systems, including steering control of a vehicle constrained to a given environment geometry