A variable time transformation method for mixed-integer optimal control problems

被引:56
|
作者
Gerdts, M [1 ]
机构
[1] Univ Hamburg, Dept Math, D-20146 Hamburg, Germany
来源
关键词
optimal control; mixed-integer non-linear programming; direct discretization method;
D O I
10.1002/oca.778
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The article discusses a variable time transformation method for the approximate solution of mixed-integer non-linear optimal control problems (MIOCP). Such optimal control problems enclose real-valued and discrete-valued controls. The method transforms MIOCP using a discretization into an optimal control problem with only real-valued controls. The latter can be solved efficiently by direct shooting methods. Numerical results are obtained for a problem from automobile test-driving that involves a discrete-valued control for the gear shift of the car. The results are compared to those obtained by Branch&Bound and show a drastic reduction of computation time. This very good performance makes the suggested method applicable even for many discretization points. Copyright (C) 2006 John Wiley & Sons, Ltd.
引用
收藏
页码:169 / 182
页数:14
相关论文
共 50 条
  • [21] On mixed-integer optimal control with constrained total variation of the integer control
    Sager, Sebastian
    Zeile, Clemens
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2021, 78 (02) : 575 - 623
  • [22] Turnpike Properties in Discrete-Time Mixed-Integer Optimal Control
    Faulwasser, Timm
    Murray, Alexander
    IEEE CONTROL SYSTEMS LETTERS, 2020, 4 (03): : 704 - 709
  • [23] On mixed-integer optimal control with constrained total variation of the integer control
    Sebastian Sager
    Clemens Zeile
    Computational Optimization and Applications, 2021, 78 : 575 - 623
  • [24] Mixed-integer optimal control problems with switching costs: a shortest path approach
    Bestehorn, Felix
    Hansknecht, Christoph
    Kirches, Christian
    Manns, Paul
    MATHEMATICAL PROGRAMMING, 2021, 188 (02) : 621 - 652
  • [25] Direct methods with maximal lower bound for mixed-integer optimal control problems
    Sebastian Sager
    Hans Georg Bock
    Gerhard Reinelt
    Mathematical Programming, 2009, 118 : 109 - 149
  • [26] Mixed-integer optimal control problems with switching costs: a shortest path approach
    Felix Bestehorn
    Christoph Hansknecht
    Christian Kirches
    Paul Manns
    Mathematical Programming, 2021, 188 : 621 - 652
  • [27] Direct methods with maximal lower bound for mixed-integer optimal control problems
    Sager, Sebastian
    Bock, Hans Georg
    Reinelt, Gerhard
    MATHEMATICAL PROGRAMMING, 2009, 118 (01) : 109 - 149
  • [28] A mixed-integer approximation of robust optimization problems with mixed-integer adjustments
    Kronqvist, Jan
    Li, Boda
    Rolfes, Jan
    OPTIMIZATION AND ENGINEERING, 2024, 25 (03) : 1271 - 1296
  • [29] Multiphase Iterative Algorithm for Mixed-Integer Optimal Control
    Pei, Chaoying
    You, Sixiong
    Di, Yu
    Dai, Ran
    JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 2025,
  • [30] Convex Relaxation for Mixed-Integer Optimal Power Flow Problems
    Chang, Chin-Yao
    Martinez, Sonia
    Cortes, Jorge
    2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2017, : 307 - 314