Stability of sequence-based anytime control with Markovian processor availability | NOVA. The University of Newcastle's Digital Repository

Home

Description	Size	Format
Author final version	184 KB	Adobe Acrobat PDF	View/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/929747

Title: Stability of sequence-based anytime control with Markovian processor availability
Author/Creator: Quevedo, Daniel E.; Gupta, Vijay
Description: We study an anytime algorithm to calculate the control input for nonlinear processes when the processing resources available are time-varying. The basic idea is to calculate the control input for as many time steps into the future as allowed by the available processing resources at every time step so as to compensate for those future time steps when the processor is not available to calculate any control input. We consider the case when the processor availability, and hence the number of control inputs calculated at any time step, is described by a Markov chain. Using a stochastic Lyapunov function based approach, we derive sufficient conditions for stability of the closed loop system.
Relation: 2011 Australian Control Conference (AUCC 2011). Proceedings of the 2011 Australian Control Conference (Melbourne, Vic. 10-11 November, 2011) p. 56-61
Relation: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6114328
Date: 2011
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Keyword(s): algorithm design and analysis; asymptotic stability; availability; control systems; Markov processes; process control; stability analysis
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.13/929747
Identifier: ISBN:9780858259874
Language: eng

9 Visitors

13 Hits

NOVA. The University of Newcastle's Digital Repository