Geometric Programming Relaxations for Linear System Reachability
Files
Penn collection
General Robotics, Automation, Sensing and Perception Laboratory
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Contributor
Abstract
One of the main obstacles in the safety analysis of continuous and hybrid systems has been the computation of the reachable set for continuous systems in high dimensions. In this paper, we present a novel method that exploits the structure of linear dynamical systems, and the monotonicity of the exponential function in order to obtain safety certificates of continuous linear systems. By over-approximating the sets of initial and final states, the safety verification problem is expressed as a series of geometric programs which can be further transformed into linear programs. This provides the ability to verify the safety properties of high dimensional linear systems with realistic computation times. In addition, our optimization based formulation computes time intervals over which the system is safe and unsafe.
Advisor
Date of presentation
Conference name
Conference dates
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Comments
Reprinted from Proceedings of the 2004 American Control Conference, Volume 1, pages 553-559.