arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1712.01232math.OC
收藏

鲁棒控制的最小输入选择

Minimal Input Selection for Robust Control

Zhipeng Liu, Yao Long, Andrew Clark, Phillip Lee, Linda Bushnell, Daniel Kirschen, Radha Poovendran

摘要:

研究了在存在不确定性和时滞的网络系统中,如何选择最小的输入节点集以保证系统的稳定性。当前网络动力系统的输入选择方法主要针对无时滞、参数已知的标称系统。我们推导出一个不确定性系统的稳定控制器存在的充分条件,是基于一个子集的系统模式躺在可控性子空间内诱导的一组输入。然后,我们制定的最小输入选择问题,并证明它是等价于一个离散最优化问题,有界的子模块比,导致多项式时间算法可证明的最优性界限。我们表明,我们的方法是适用于不同类型的不确定性,包括加性和乘性的不确定性的系统矩阵以及不确定的时间延迟。我们证明了我们的方法在IEEE 39节点测试电力系统的数值案例研究。

英文摘要:

This paper studies the problem of selecting a minimum-size set of input nodes to guarantee stability of a networked system in the presence of uncertainties and time delays. Current approaches to input selection in networked dynamical systems focus on nominal systems with known parameter values in the absence of delays. We derive sufficient conditions for existence of a stabilizing controller for an uncertain system that are based on a subset of system modes lying within the controllability subspace induced by the set of inputs. We then formulate the minimum input selection problem and prove that it is equivalent to a discrete optimization problem with bounded submodularity ratio, leading to polynomial-time algorithms with provable optimality bounds. We show that our approach is applicable to different types of uncertainties, including additive and multiplicative uncertainties in the system matrices as well as uncertain time delays. We demonstrate our approach in a numerical case study on the IEEE 39-bus test power system.

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

↑