By Topic

On active set algorithms for solving bound-constrained least squares control allocation problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Schofield, B. ; Dept. of Autom. Control, Lund Univ., Lund

Control allocation problems, in which optimal actuator values are assigned based on desired control actions and actuator constraints, are typically formulated as constrained optimization problems. Initially, only approximate solutions to the problems were deemed tractable for real-time applications. However, active set algorithms have been identified as a means for solving control allocation problems in real-time applications. In this paper a modified active set algorithm for the solution of bound-constrained least-squares problems is presented, which has numerous advantages particularly for time-varying control allocation problems. A vehicle dynamics control system for rollover mitigation is used as an example.

Published in:

American Control Conference, 2008

Date of Conference:

11-13 June 2008