Iterative Switching Time Optimization for Mixed-integer Optimal Control Problems

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Abbasi-Esfeden, Ramin, Van Roy, Wim, Swevers, Jan
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866912753568972800
author Abbasi-Esfeden, Ramin
Van Roy, Wim
Swevers, Jan
author_facet Abbasi-Esfeden, Ramin
Van Roy, Wim
Swevers, Jan
contents This paper proposes an iterative method to solve Mixed-Integer Optimal Control Problems arising from systems with switched dynamics. The so-called relaxed problem plays a central role within this context. Through a numerical example, it is shown why relying on the relaxed problem can lead the solution astray. As an alternative, an iterative Switching Time Optimization method is proposed. The method consists of two components that iteratively interact: a Switching Time Optimization (STO) problem and a sequence optimization. Each component is explained in detail, and the numerical example is resolved, the results of which shows the efficiency of the proposed algorithm. Finally, the advantages and disadvantages of the method are discussed and future lines of research are sketched.
format Preprint
id arxiv_https___arxiv_org_abs_2512_07213
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Iterative Switching Time Optimization for Mixed-integer Optimal Control Problems
Abbasi-Esfeden, Ramin
Van Roy, Wim
Swevers, Jan
Optimization and Control
This paper proposes an iterative method to solve Mixed-Integer Optimal Control Problems arising from systems with switched dynamics. The so-called relaxed problem plays a central role within this context. Through a numerical example, it is shown why relying on the relaxed problem can lead the solution astray. As an alternative, an iterative Switching Time Optimization method is proposed. The method consists of two components that iteratively interact: a Switching Time Optimization (STO) problem and a sequence optimization. Each component is explained in detail, and the numerical example is resolved, the results of which shows the efficiency of the proposed algorithm. Finally, the advantages and disadvantages of the method are discussed and future lines of research are sketched.
title Iterative Switching Time Optimization for Mixed-integer Optimal Control Problems
topic Optimization and Control
url https://arxiv.org/abs/2512.07213