Constrained nonlinear control allocation with singularity avoidance using sequential quadratic programming

Control allocation problems can be formulated as optimization problems, where the objective is typically to minimize the use of control effort (or power) subject to actuator rate and position constraints, and other operational constraints. Here we consider the additional objective of singularity avo...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on control systems technology Vol. 12; no. 1; pp. 211 - 216
Main Authors Johansen, T.A., Fossen, T.I., Berge, S.P.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.01.2004
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Control allocation problems can be formulated as optimization problems, where the objective is typically to minimize the use of control effort (or power) subject to actuator rate and position constraints, and other operational constraints. Here we consider the additional objective of singularity avoidance, which is essential to avoid loss of controllability in some applications, leading to a nonconvex nonlinear program. We suggest a sequential quadratic programming approach, solving at each sample a convex quadratic program approximating the nonlinear program. The method is illustrated by simulated maneuvers for a marine vessel equipped with azimuth thrusters. The example indicates reduced power consumption and increased maneuverability as a consequence of the singularity-avoidance.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1063-6536
1558-0865
DOI:10.1109/TCST.2003.821952