Efficient active set algorithms for solving constrained least squares problems in aircraft control allocation

In aircraft control, control allocation can be used to distribute the total control effort among the actuators when the number of actuators exceeds the number of controlled variables. The control allocation problem is often posed as a constrained least squares problem to incorporate the actuator pos...

Full description

Saved in:
Bibliographic Details
Published in41st IEEE Conference on Decision and Control Vol. 2; pp. 1295 - 1300 vol.2
Main Author Harkegard, O.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2002
Subjects
Online AccessGet full text
ISBN0780375165
9780780375161
ISSN0191-2216
DOI10.1109/CDC.2002.1184694

Cover

More Information
Summary:In aircraft control, control allocation can be used to distribute the total control effort among the actuators when the number of actuators exceeds the number of controlled variables. The control allocation problem is often posed as a constrained least squares problem to incorporate the actuator position and rate limits. Most proposed methods for real-time implementation, like the redistributed pseudoinverse method, only deliver approximate, and sometimes unreliable solutions. We investigate the use of classical active set methods for control allocation. We develop active set algorithms that always find the optimal control distribution, and show by simulation that the timing requirements are in the same range as for two previously proposed solvers.
ISBN:0780375165
9780780375161
ISSN:0191-2216
DOI:10.1109/CDC.2002.1184694