A dynamic algorithm for approximate flow computations

Pavithra Prabhakar, Mahesh Viswanathan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we consider the problem of approximating the set of states reachable within a time bound T in a linear dynamical system, to within a given error bound ε. Fixing a degree d, our algorithm divides the interval [0,T] into sub-intervals of not necessarily equal size, such that a polynomial of degree d approximates the actual flow to within an error bound of ε, and approximates the reach set within each sub-interval by the polynomial tube. Our experimental evaluation of the algorithm when the degree d is fixed to be either 1 or 2, shows that the approach is promising, as it scales to large dimensional dynamical systems, and performs better than previous approaches that divided the interval [0,T] evenly into sub-intervals.

Original languageEnglish (US)
Title of host publicationHSCC'11 - Proceedings of the 2011 ACM/SIGBED Hybrid Systems
Subtitle of host publicationComputation and Control
Pages133-142
Number of pages10
DOIs
StatePublished - May 20 2011
Event14th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2011 - Chicago, IL, United States
Duration: Apr 12 2011Apr 14 2011

Publication series

NameHSCC'11 - Proceedings of the 2011 ACM/SIGBED Hybrid Systems: Computation and Control

Other

Other14th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2011
CountryUnited States
CityChicago, IL
Period4/12/114/14/11

Keywords

  • Approximation
  • Linear dynamical systems
  • Post computation

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'A dynamic algorithm for approximate flow computations'. Together they form a unique fingerprint.

Cite this