Stability of sequence-based anytime control with Markovian processor availability
Stability of sequence-based anytime control with Markovian processor availability
复制标题
具有马尔可夫处理器可用性的基于序列的随时控制的稳定性
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
V. Gupta
中科院分区：
文献类型：
--
作者：
D. Quevedo;V. Gupta
研究了当可用的处理资源是时变的情况下，计算非线性过程的控制输入的Anytime算法。基本思想是在每个时间步长计算在可用处理资源允许的到未来的尽可能多的时间步长的控制输入，以便在处理器不可用于计算任何控制输入时补偿那些未来的时间步长。我们考虑用马尔可夫链来描述处理器的可用性以及在任意时间步计算的控制输入的数量的情况。利用基于随机Lyapunov函数的方法，我们得到了闭环系统稳定的充分条件。
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.