Bauso, D. and Pesenti, R. (2007) A Polynomial algorithm solving a special class of hybrid optimal control problems. In: Proceedings of the IEEE International Conference on Control Applications. 2006 IEEE International Conference on Control Applications IEEE , 349 - 354. ISBN 0780397959
Abstract
Hybrid optimal control problems are, in general, difficult to solve. A current research goal is to isolate those problems that lead to tractable solutions [5]. In this paper, we identify a special class of hybrid optimal control problems which are easy to solve. We do this by using a paradigm borrowed from the Operations Research field. As main result, we present a solution algorithm that converges to the exact solution in polynomial time. Our approach consists in approximating the hybrid optimal control problem via an integer-linear programming reformulation. The integer-linear programming problem is a Set-covering one with a totally unimodular constraint matrix and therefore solving the Setcovering problem is equivalent to solving its linear relaxation. It turns out that any solution of the linear relaxation is a feasible solution for the hybrid optimal control problem. Then, given the feasible solution, obtained solving the linear relaxation, we find the optimal solution via local search. © 2006 IEEE.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2006 IEEE. |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Automatic Control and Systems Engineering (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 05 Feb 2016 10:40 |
Last Modified: | 05 Feb 2016 10:40 |
Published Version: | http://dx.doi.org/10.1109/CACSD-CCA-ISIC.2006.4776... |
Status: | Published |
Publisher: | IEEE |
Refereed: | Yes |
Identification Number: | 10.1109/CACSD-CCA-ISIC.2006.4776671 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:89758 |