Determining switching strategies of multiprocesses via time partitioning and Pontryagin’s maximum principle

This paper addresses necessary optimality conditions in the form of the Pontryagin Maximum Principle for optimal multiprocesses. By a multiprocess, we understand a finite system of classical control processes, between which switching is freely permitted at any point in time. A particular challenge in studying multiprocesses is determining an optimal switching strategy. To this end, we present a new approach that identifies possible switching strategies with certain partitions of the finite time horizon. This enables us to incorporate the switching strategies as control variables and to interpret the problem of optimal multiprocesses as a classical control problem. The identification of an optimal switching strategy is thus achieved without a priori assumptions. However, the proposed approach imposes limitations in that the state trajectories must be continuous and no switching costs are allowed.

Authors

Publication Details

Journal
IFAC Journal of Systems and Control
Published
2026-02-17
DOI
https://doi.org/10.1016/j.ifacsc.2026.100388
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Determining switching strategies of multiprocesses via time partitioning and Pontryagin’s maximum principle

Nico Tauchnitz
IFAC Journal of Systems and Control
Formal Methods in Verification
article

Determining switching strategies of multiprocesses via time partitioning and Pontryagin’s maximum principle

Nico Tauchnitz
article en

Abstract

This paper addresses necessary optimality conditions in the form of the Pontryagin Maximum Principle for optimal multiprocesses. By a multiprocess, we understand a finite system of classical control processes, between which switching is freely permitted at any point in time. A particular challenge in studying multiprocesses is determining an optimal switching strategy. To this end, we present a new approach that identifies possible switching strategies with certain partitions of the finite time horizon. This enables us to incorporate the switching strategies as control variables and to interpret the problem of optimal multiprocesses as a classical control problem. The identification of an optimal switching strategy is thus achieved without a priori assumptions. However, the proposed approach imposes limitations in that the state trajectories must be continuous and no switching costs are allowed.

IFAC Journal of Systems and ControlVol. 35
Openalex Percentile: Top 51%
Formal Methods in Verification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.