Optimization Online


Mixed-Integer Optimal Control under Minimum Dwell Time Constraints

Clemens Zeile (clemens.zeile***at***ovgu.de)
Nicoḷ Robuschi (nicolo.robischi***at***polimi.it)
Sebastian Sager (sager***at***ovgu.de)

Abstract: Tailored mixed-integer optimal control policies for real-world applications usually have to avoid very short successive changes of the active integer control. Minimum dwell time constraints express this requirement and can be included into the combinatorial integral approximation decomposition, which solves mixed-integer optimal control problems by solving one continuous nonlinear program and one mixed-integer linear program. Within this work, we analyze the integrality gap of mixed-integer optimal control problems under minimum dwell time constraints by providing tight upper bounds on the mixed-integer linear program subproblem. We suggest different rounding schemes for constructing minimum dwell time feasible control solutions, e.g., we propose a modification of sum-up rounding. A numerical study supplements the theoretical results and compares objective values of integer solutions with a priori lower bounds.

Keywords: Mixed-integer linear programming, optimal control, discrete approximations, switched dynamic systems, approximation methods and heuristics, minimum dwell time constraints

Category 1: Nonlinear Optimization (Systems governed by Differential Equations Optimization )

Category 2: Integer Programming ((Mixed) Integer Nonlinear Programming )

Category 3: Integer Programming ((Mixed) Integer Linear Programming )


Download: [PDF]

Entry Submitted: 09/13/2019
Entry Accepted: 09/13/2019
Entry Last Modified: 10/25/2019

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society