Sparsity-Promoting Reachability Analysis and Optimization of Constrained Zonotopes
The constrained zonotope is a polytopic set representation widely used for set-based analysis and control of dynamic systems. This paper considers the problem of tailoring a quadratic program (QP) optimization algorithm to the particular structure of constrained zonotopes and vice-versa. An alternating direction method of multipliers (ADMM) algorithm is presented that makes efficient use of the constrained zonotope structure. To increase the efficiency of the ADMM iterations, reachability calculations are presented that increase the sparsity of the matrices used to define a constrained zonotope. Numerical results show that the ADMM algorithm solves optimal control problems built using these reachability calculations faster than state-of-the-art QP solvers using conventional problem formulations, especially for large problems. Constrained zonotope reachability and optimization calculations are combined within a set-valued state estimation and moving horizon estimation algorithm, and a projection-based infeasibility detection method is presented for efficient safety verification of system trajectories.
Code (1)
Tasks
State EstimationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Safety-Constrained Reinforcement Learning with Post-Training Reachability Verification for Robot Navigation
Safe navigation for mobile robots demands policies that remain reliable under the high-consequence perception uncertainty of cluttered environments. Yet most existing safe reinforcement learning (RL) methods assess safet…
Reinforcement LearningRobot NavigationReachability Analysis Using Constrained Polynomial Logical Zonotopes
In this paper, we propose reachability analysis using constrained polynomial logical zonotopes. We perform reachability analysis to compute the set of states that could be reached. To do this, we utilize a recently intro…
Computational EfficiencyA Unified Alternating Optimization Framework for Joint Sensor and Actuator Configuration in LQG Systems
This paper fills a gap in the literature by considering a joint sensor and actuator configuration problem under the linear quadratic Gaussian (LQG) performance without assuming a predefined set of candidate components. D…
Learning sparsity-promoting regularizers for linear inverse problems
This paper introduces a novel approach to learning sparsity-promoting regularizers for solving linear inverse problems. We develop a bilevel optimization framework to select an optimal synthesis operator, denoted as $B$,…
Bilevel OptimizationLearning Sparsity-Promoting Regularizers using Bilevel Optimization
We present a method for supervised learning of sparsity-promoting regularizers for denoising signals and images. Sparsity-promoting regularization is a key ingredient in solving modern signal reconstruction problems; how…
Bilevel OptimizationCollaborative FilteringDenoisingDictionary Learning+1