Sequence-based Anytime Control
arXiv:1308.1747 · doi:10.1109/TAC.2012.2209977
Abstract
We present two related anytime algorithms for control of nonlinear systems when the processing resources available are time-varying. The basic idea is to calculate tentative control input sequences for as many time steps into the future as allowed by the available processing resources at every time step. This serves to compensate for the time steps when the processor is not available to perform any control calculations. Using a stochastic Lyapunov function based approach, we analyze the stability of the resulting closed loop system for the cases when the processor availability can be modeled as an independent and identically distributed sequence and via an underlying Markov chain. Numerical simulations indicate that the increase in performance due to the proposed algorithms can be significant.
14 pages
Cited by in corpus (5)
- Stochastic Stability of Event-triggered Anytime Control
- Anytime Control using Input Sequences with Markovian Processor Availability
- Anytime Control under Practical Communication Model
- Stability analysis of event-triggered anytime control with multiple control laws
- A Formal Approach to Power Optimization in CPSs with Delay-Workload Dependence Awareness