Approximately Supermodular Scheduling Subject to Matroid Constraints

• 成果类型: Article
• 署名作者: Chamon, Luiz F. O.; Amice, Alexandre; Ribeiro, Alejandro
• 署名单位: University of Pennsylvania
• 刊物名称: IEEE TRANSACTIONS ON AUTOMATIC CONTROL
• ISSN/ISSBN: 0018-9286
• DOI: 10.1109/TAC.2021.3071024
• 发表日期: 2022
• 页码: 1384-1396
• 关键词: Schedules; actuators; dynamical systems; cost function; sensors; regulators; minimization; approximate submodularity; Greedy algorithms; linear quadratic Gaussian regulators; optimal control; Optimal scheduling

摘要

Control scheduling refers to the problem of assigning agents or actuators to act upon a dynamical system at specific times so as to minimize a quadratic control cost, such as the objectives of the linear-quadratic-Gaussian (LQG) or linear quadratic regulator problems. When budget or operational constraints are imposed on the schedule, this problem is in general NP-hard and its solution can therefore only be approximated even for moderately sized systems. The quality of this approximation depends on the structure of both the constraints and the objective. This article shows that greedy control scheduling is near-optimal when the constraints can be written as an intersection of matroids, algebraic structures that encode requirements such as limits on the number of agents deployed per time slot, total number of actuator uses, and duty cycle restrictions. To do so, it proves that the LQG cost function is alpha-supermodular and provides new alpha/(alpha+ P)-optimality certificates for the greedy minimization of such functions over an intersection of P matroids. These certificates are shown to approach the 1/(1+P) guarantee of supermodular functions in relevant settings. These results support the use of greedy algorithms in nonsupermodular quadratic control problems as opposed to typical heuristics such as convex relaxations and surrogate figures of merit, e.g., the log det of the controllability Gramian.