pith. sign in

arxiv: 1307.8232 · v1 · pith:MFLDJUHCnew · submitted 2013-07-31 · 🧮 math.OC · cs.IT· cs.SY· math.IT

Maximum-Hands-Off Control and L1 Optimality

classification 🧮 math.OC cs.ITcs.SYmath.IT
keywords controlmaximum-hands-offhands-offoptimalityproposesolutionadmissiblearticle
0
0 comments X
read the original abstract

In this article, we propose a new paradigm of control, called a maximum-hands-off control. A hands-off control is defined as a control that has a much shorter support than the horizon length. The maximum-hands-off control is the minimum-support (or sparsest) control among all admissible controls. We first prove that a solution to an L1-optimal control problem gives a maximum-hands-off control, and vice versa. This result rationalizes the use of L1 optimality in computing a maximum-hands-off control. The solution has in general the "bang-off-bang" property, and hence the control may be discontinuous. We then propose an L1/L2-optimal control to obtain a continuous hands-off control. Examples are shown to illustrate the effectiveness of the proposed control method.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.