Characterization of maximum hands-off control
arXiv:1602.08834 · doi:10.1016/j.sysconle.2016.05.002
Abstract
Maximum hands-off control aims to maximize the length of time over which zero actuator values are applied to a system when executing specified control tasks. To tackle such problems, recent literature has investigated optimal control problems which penalize the size of the support of the control function and thereby lead to desired sparsity properties. This article gives the exact set of necessary conditions for a maximum hands-off optimal control problem using an -(semi)norm, and also provides sufficient conditions for the optimality of such controls. Numerical example illustrates that adopting an cost leads to a sparse control, whereas an -relaxation in singular problems leads to a non-sparse solution.
arXiv comment6 pages
References in corpus (5)
- Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers
- Maximum Hands-Off Control: A Paradigm of Control Effort Minimization
- Sparse Packetized Predictive Control for Networked Control over Erasure Channels
- Maximum-Hands-Off Control and L1 Optimality
- A convex analysis approach to optimal controls with switching structure for partial differential equations
Cited by in corpus (5)
- Optimal multiplexing of sparse controllers for linear systems
- Queueing Subject To Action-Dependent Server Performance: Utilization Rate Reduction
- Characterization of Minimum Time-Fuel Optimal Control for LTI Systems
- Necessary condition for sparse optimal control problem with intermediate constraints
- Sparse Packetized Predictive Control of Disturbed Plants Over Channels with Data Loss