Skip to Main content Skip to Navigation
Book sections

Mixed-Integer Programming Techniques in Distributed MPC Problems

Abstract : This chapter proposes a distributed approach for the resolution of a multi-agent problem under collision and obstacle avoidance conditions. Using hyperplane arrangements and mixed integer programming, we provide an efficient description of the feasible region verifying the avoidance constraints. We exploit geometric properties of hyperplane arrangements and adapt this description to the distributed scheme in order to provide an efficient Model Predictive Control (MPC) solution. Furthermore, we prove constraint validation for a hierarchical ordering of the agents.
Document type :
Book sections
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-00826633
Contributor : Josiane Dartron <>
Submitted on : Monday, March 16, 2020 - 3:55:52 PM
Last modification on : Thursday, July 9, 2020 - 4:08:02 PM
Document(s) archivé(s) le : Wednesday, June 17, 2020 - 2:36:07 PM

File

dist-MIP.pdf
Files produced by the author(s)

Identifiers

Citation

Ionela Prodan, Florin Stoican, Sorin Olaru, Cristina Stoica, Silviu-Iulian Niculescu. Mixed-Integer Programming Techniques in Distributed MPC Problems. Maestre; José M. and Negenborn; Rudy R. Distributed Model Predictive Control Made Easy, Springer, pp.273-288, 2013, ⟨10.1007/978-94-007-7006-5_17⟩. ⟨hal-00826633⟩

Share

Metrics

Record views

538

Files downloads

241