On the use of mixed-integer linear programming for predictive control with avoidance constraints

• Published in: International journal of robust and nonlinear control Vol. 19; no. 7; pp. 822 - 828
• Main Authors: Maia, Marcelo H., Galvão, Roberto K. H.
• Format: Journal Article
• Language: English
• Published: Chichester, UK John Wiley & Sons, Ltd 10.05.2009
• Subjects: constrained predictive control; mixed-integer programming; vehicle maneuvering
• ISSN: 1049-8923; 1099-1239
• DOI: 10.1002/rnc.1341

This technical note concerns the predictive control of discrete‐time linear models subject to state, input and avoidance polyhedral constraints. Owing to the presence of avoidance constraints, the optimization associated with the predictive control law is non‐convex, even though the constraints themselves are convex. The inclusion of the avoidance constraints in the predictive control law is achieved by the use of a modified version of a mixed‐integer programming approach previously derived in the literature. The proposed modification consists of adding constraints to ensure that linear segments of the system trajectories between consecutive sampling times do not cross existing obstacles. This avoids the significant extra computation that would be incurred if the sampling time was reduced to prevent these crossings. Simulation results show that the inclusion of these additional constraints successfully prevents obstacle collisions that would otherwise occur. Copyright © 2008 John Wiley & Sons, Ltd.