5 research outputs found
GAS: Generating Fast and Accurate Surrogate Models for Autonomous Vehicle Systems
Modern autonomous vehicle systems use complex perception and control
components. These components can rapidly change during development of such
systems, requiring constant re-testing. Unfortunately, high-fidelity
simulations of these complex systems for evaluating vehicle safety are costly.
The complexity also hinders the creation of less computationally intensive
surrogate models.
We present GAS, the first approach for creating surrogate models of complete
(perception, control, and dynamics) autonomous vehicle systems containing
complex perception and/or control components. GAS's two-stage approach first
replaces complex perception components with a perception model. Then, GAS
constructs a polynomial surrogate model of the complete vehicle system using
Generalized Polynomial Chaos (GPC). We demonstrate the use of these surrogate
models in two applications. First, we estimate the probability that the vehicle
will enter an unsafe state over time. Second, we perform global sensitivity
analysis of the vehicle system with respect to its state in a previous time
step. GAS's approach also allows for reuse of the perception model when vehicle
control and dynamics characteristics are altered during vehicle development,
saving significant time.
We consider five scenarios concerning crop management vehicles that must not
crash into adjacent crops, self driving cars that must stay within their lane,
and unmanned aircraft that must avoid collision. Each of the systems in these
scenarios contain a complex perception or control component. Using GAS, we
generate surrogate models for these systems, and evaluate the generated models
in the applications described above. GAS's surrogate models provide an average
speedup of for safe state probability estimation (minimum
) and for sensitivity analysis (minimum ),
while still maintaining high accuracy
Accelerating cerification of cyber-physical systems using symmetry
Autonomous systems are increasingly being deployed in safety-critical applications such as transportation and medicine. Numerous approaches to analyze their safety have been considered including testing, falsification, and formal verification. The major challenge for all of these approaches is scalability to large and complex models. To address this challenge, we propose to use the symmetry naturally present in the dynamics of many of these systems.
Reachability-based safety analysis simulates the dynamical models of the autonomous systems, such as differential equations or hybrid automata, and checks if any of their reachable states is unsafe. Symmetries in dynamical systems are maps that transform any of their trajectories to other trajectories. In this thesis, we show how to use known symmetries of autonomous systems to cache their reachable states and abstract their dynamical models to accelerate their safety analysis.
The main contributions of this thesis are as follows: 1. Augmenting a state-of-the-art data-driven safety verification algorithm with a cache to reuse computed sets of reachable states. The proposed algorithm uses symmetries of the model under verification to increase the cache hit rate. 2. Augmenting traditional hybrid automata safety verification algorithms with a cache to reuse computed sets of reachable states. The proposed algorithm uses symmetries to share computed reachable sets between different modes and automata being verified. 3. Abstracting hybrid automata by combining modes with symmetric dynamics in the same abstract modes. 4. Designing a symmetry-based counter-example guided abstraction-refinement (CEGAR) algorithm for hybrid automata with symmetric continuous dynamics to accelerate their safety verification. 5. Finally, designing an efficient testing algorithm for autonomous systems that uses a cache to share symmetric trajectories among the test cases of a test suite, avoiding repetition of high-fidelity simulations.
The algorithmic contributions of this thesis come with theoretical guarantees that ensure their soundness and completeness. The algorithms presented build on top of state-of-the-art reachability analysis and verification algorithms. They accelerate their computations, without affecting their soundness and completeness guarantees.
Finally, we present software implementations and empirical analyses of the different algorithms presented, showing up to orders of magnitude speedup in verification and testing time of different dynamical models including a car, fixed-wing aircraft, a neural network-controlled quadrotor, and a Gazebo-based Hector quadrotor