Invariant Funnels around Trajectories using Sum-of-Squares Programming

Details Invariant Funnels around Trajectories using Sum-of-Squares Programming Invariant Funnels around Trajectories using Sum-of-Squares Programming

2010-10-14

arxiv.org/abs/1010.3013v1

Mathematics

Dynamical Systems

7 pages, 3 figures

Scientific paper

This paper presents numerical methods for computing regions of finite-time invariance (funnels) around solutions of polynomial differential equations. First, we present a method which exactly certifies sufficient conditions for invariance despite relying on approximate trajectories from numerical integration. Our second method relaxes the constraints of the first by sampling in time. In applications, this can recover almost identical funnels but is much faster to compute. In both cases, funnels are verified using Sum-of-Squares programming to search over a family of time-varying polynomial Lyapunov functions. Initial candidate Lyapunov functions are constructed using the linearization about the trajectory, and associated time-varying Lyapunov and Riccati differential equations. The methods are compared on stabilized trajectories of a six-state model of a satellite.

Affiliated with

Also associated with

No associations

Rating

Invariant Funnels around Trajectories using Sum-of-Squares Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Invariant Funnels around Trajectories using Sum-of-Squares Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Invariant Funnels around Trajectories using Sum-of-Squares Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286398