arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.00385eess.SYcs.SY
收藏

离散时间线性动力系统的稀疏执行器调度

Sparse Actuator Scheduling for Discrete-Time Linear Dynamical Systems

Krishna Praveen V. S. Kondapi, Chandrasekhar Sriram, Geethu Joseph, Chandra R. Murthy

AI总结:

本文研究离散时间线性系统在每步限制活跃执行器数量下的稀疏控制问题,提出一种贪心调度算法,通过优化可控性格拉姆矩阵逆的迹来最小化输入能量,并在保证可控性的同时实现低平均能量消耗。

摘要:

我们考虑使用稀疏输入控制离散时间线性动力系统,其中在每个时间步限制活跃执行器的数量。我们开发了一种算法,用于确定稀疏执行器调度,该调度确保存在一个遵循该调度的稀疏控制输入序列,能够将系统从任意给定初始状态驱动到任意期望最终状态。由于这样的执行器调度并不唯一,我们寻找一个使稀疏输入能量最小化的调度。为此,我们优化所得可控性格拉姆矩阵的逆的迹,该迹是输入平均能量的近似度量。我们提出了一种贪心算法及其理论保证。最后,我们通过实验表明,与完全驱动系统相比,我们的贪心算法在每个时间步使用少量活跃执行器即可确保线性系统的可控性,且不会产生显著的平均能量消耗。

英文摘要:

We consider the control of discrete-time linear dynamical systems using sparse inputs where we limit the number of active actuators at every time step. We develop an algorithm for determining a sparse actuator schedule that ensures the existence of a sparse control input sequence, following the schedule, that takes the system from any given initial state to any desired final state. Since such an actuator schedule is not unique, we look for a schedule that minimizes the energy of sparse inputs. For this, we optimize the trace of the inverse of the resulting controllability Gramian, which is an approximate measure of the average energy of the inputs. We present a greedy algorithm along with its theoretical guarantees. Finally, we empirically show that our greedy algorithm ensures the controllability of the linear system with a small number of active actuators per time step without a significant average energy expenditure compared to the fully actuated system.

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

↑