Metraipolis › archive › dc_b1fcfe82a4fb

On the optimal control of entry-exit phenomena in planar fast-slow dynamical systems — arXiv:2609.25747

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25747
License (as archived)
CC0-1.0
Archived
2026-10-08T15:53:17.662Z
SHA-256 of the archived text
920ac69e6a13b7a617742765a280162c6493822979ddb79f54dae5c1832b6f74
Stable URL of this page
https://metraipolis.com/documento/dc_b1fcfe82a4fb

How to cite

On the optimal control of entry-exit phenomena in planar fast-slow dynamical systems — arXiv:2609.25747 — arXiv (en), https://arxiv.org/abs/2609.25747 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b1fcfe82a4fb (Metraipolis archive dc_b1fcfe82a4fb, sha256 920ac69e6a13b7a617742765a280162c6493822979ddb79f54dae5c1832b6f74)
BibTeX
@misc{dcb1fcfe82a4fb,
  title = {On the optimal control of entry-exit phenomena in planar fast-slow dynamical systems — arXiv:2609.25747},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25747},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b1fcfe82a4fb; sha256 920ac69e6a13b7a617742765a280162c6493822979ddb79f54dae5c1832b6f74},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25747. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study a geometric singular perturbation theory (GSPT) approach to optimal control problems involving entry-exit phenomena in planar fast-slow dynamical systems. In contrast to previous work, we assume that the control acts only on the slow dynamics and we consider minimum-time optimal control problems (i.e., we aim at minimizing the time to reach a certain target). We apply this method to a simplified fast-slow toy model, characterized by a repetition of entry-exit processes, enabling a transparent analytical exploration of the control dynamics and allowing us to derive the key results explicitly. First, we analyze each non-autonomous entry-exit phenomenon separately, and we derive the optimal way to control them. Second, by artificially generating a stable limit cycle, we determine under which conditions it is possible to reach the target. Finally, under such conditions, we combine all entry-exit processes together and we demonstrate the existence of an optimal control. Our approach mainly exploits techniques of GSPT and dynamic programming. Indeed, we show that our problem can be formulated in a way resembling the Bellman equation, even though not in its standard setting. Numerical simulations, built on such Bellman-like formulation, illustrate our analytical results. In particular, the optimal control is derived with an algorithm that converges in a finite number of steps. Lastly, we extend this novel approach to more complex planar fast-slow dynamical systems.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.OC).
Categorie arXiv: Optimization and Control (math.OC) ; Dynamical Systems (math.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.25747 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T15:12:09.727Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).