17th International Symposium on
Mathematical Theory of Networks and Systems
Kyoto International Conference Hall, Kyoto, Japan, July 24-28, 2006

MTNS 2006 Paper Abstract


Paper TuP12.4

Spjøtvold, Jørgen (Norwegian Univ. of Science and Tech.), Tøndel, Petter (Sintef), Johansen, Tor Arne (Norwegian Univ. of Science and Tech.)

Decomposing Linear Control Allocation Problems

Scheduled for presentation during the Regular Session "Optimization" (TuP12), Tuesday, July 25, 2006, 16:35−17:00, Room 104b

17th International Symposium on Mathematical Theory of Networks and Systems, July 24-28, 2006, Kyoto, Japan

This information is tentative and subject to change. Compiled on May 27, 2023

Keywords Convex optimization, Mixed integer programming, Control of hybrid systems


A strategy for decomposing a class of constrained linear control allocation problems is considered. The actuators are partitioned into groups of mutually non-interacting actuators. The problem is then divided into a set of sub-problems and a master problem, whose solution approximates the solution to the original problem. For some classes of allocation problems the method is extended such that it also yields an optimal solution. The motivation behind the approach is to reduce the computational effort needed to find explicit solutions by obtaining sub-optimal solutions, increase possibilities of reconfigurable control allocation, and to provide a scheme that allows for a tradeoff between the drawbacks and benefits of the explicit solution to control allocation problems.