Anytime Control Using Input Sequences With Markovian Processor Availability

DOI10.1109/TAC.2014.2335311MaRDI QIDQ2982859zbMATH OpenFDO

Authors Daniel E. Quevedo, Wann-Jiun Ma, Vijay Gupta

Publication date 16 May 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.0751

Mathematics Subject Classification ID

Stochastic stability in control theory (93E15)

Abstract: We study an anytime control algorithm for situations where the processing resources available for control are time-varying in an a priori unknown fashion. Thus, at times, processing resources are insufficient to calculate control inputs. To address this issue, the algorithm calculates sequences of tentative future control inputs whenever possible, which are then buffered for possible future use. We assume that the processor availability is correlated so that the number of control inputs calculated at any time step is described by a Markov chain. Using a Lyapunov function based approach we derive sufficient conditions for stochastic stability of the closed loop.

Recommendations

• Sequence-Based Anytime Control
• On a control algorithm for time-varying processor availability
• On a Control Algorithm for Time-Varying Processor Availability
• Anytime Control Under Practical Communication Models
• Design and Stability Analysis for Anytime Control via Stochastic Scheduling
• On the control of incompletely described sequential machines
• Controllable delay-insensitive processes
• scientific article; zbMATH DE number 4204268
• Continuous average control of piecewise deterministic Markov processes
• On the controller synthesis for finite-state Markov decision processes

Cited in

(1)

• On a Control Algorithm for Time-Varying Processor Availability

This page was built for publication: Anytime Control Using Input Sequences With Markovian Processor Availability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2982859)