arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.0751math.OCcs.SYeess.SY
收藏

利用马尔可夫处理器可用性的输入序列进行 anytime 控制

Anytime Control using Input Sequences with Markovian Processor Availability

University of Newcastle(纽卡斯尔大学);University of Notre Dame(圣母大学)

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

AI总结:

研究了在处理资源未知变化时的 anytime 控制算法,通过缓冲未来控制输入序列以应对资源不足,基于Lyapunov函数推导了闭环系统的随机稳定性条件。

摘要:

我们研究了一种 anytime 控制算法,用于处理资源在事前未知变化的情况。此时,有时处理资源不足以计算控制输入。为此,该算法在可能时计算未来控制输入序列,并将它们缓冲以备将来使用。我们假设处理器可用性相关,因此任何时间步长计算的控制输入数量由马尔可夫链描述。使用基于Lyapunov函数的方法,我们推导了闭环系统随机稳定性的充分条件。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑