Guaranteeing in-polytope permanence times of nonlinear system trajectories via approximate solutions

Causing the system trajectory to remain within a given region over some time interval is a key requirement of many control strategies. This may involve prediction of the future state evolution. However, general nonlinear systems often lack analytical solutions, making numerical approximations the only available tool. Even if error bounds for approximate solutions exist, these only ensure that the exact solution remains within the given region at discrete time instants. This fact may nonetheless not be sufficient to guarantee that the exact continuous-time solution remains within the region at all intermediate times. In this work, we develop a method to guarantee that the exact solution remains within a convex set throughout a time interval, by employing approximate solutions. When the convex set is a polytope, every step of the method becomes easily and completely computable. The applicability of the method is illustrated by means of numerical examples.

Authors

Institutions

Publication Details

Published
2025-12-09
DOI
https://doi.org/10.1109/cdc57313.2025.11312929
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Guaranteeing in-polytope permanence times of nonlinear system trajectories via approximate solutions

Felipe Cinto, Alexis J. Vallarella, Hernan Haimovich
Advanced Optimization Algorithms Research
article

Guaranteeing in-polytope permanence times of nonlinear system trajectories via approximate solutions

Felipe Cinto, Alexis J. Vallarella, Hernan Haimovich
article en

Abstract

Causing the system trajectory to remain within a given region over some time interval is a key requirement of many control strategies. This may involve prediction of the future state evolution. However, general nonlinear systems often lack analytical solutions, making numerical approximations the only available tool. Even if error bounds for approximate solutions exist, these only ensure that the exact solution remains within the given region at discrete time instants. This fact may nonetheless not be sufficient to guarantee that the exact continuous-time solution remains within the region at all intermediate times. In this work, we develop a method to guarantee that the exact solution remains within a convex set throughout a time interval, by employing approximate solutions. When the convex set is a polytope, every step of the method becomes easily and completely computable. The applicability of the method is illustrated by means of numerical examples.

University of Bergamo (IT), Centro Internacional Franco-Argentino de Ciencias de la Información y de Sistemas (AR)
Openalex Percentile: Top 23%
Advanced Optimization Algorithms Research
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.

Guaranteeing in-polytope permanence times of nonlinear system trajectories via approximate solutions — Felipe Cinto, Alexis J. Vallarella, et al. · (2025) | TGRS Research Map | TGRS