Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1909.05385

A geometrically based criterion to avoid infimum-gaps in Optimal Control

Michele Palladino·Franco Rampazzo
View original source ↗Read source document ↗Export metadata ↓

Abstract

In optimal control theory the expression infimum gap means a strictly negative difference between the infimum value of a given minimum problem and the infimum value of a new problem obtained by the former by extending the original family V of controls to a larger family W. Now, for some classes of domain-extensions -- like convex relaxation or impulsive embedding of unbounded control problems -- the normality of an extended minimizer has been shown to be sufficient for the avoidance of an infimum gaps. A natural issue is then the search of a general hypothesis under which the criterium 'normality implies no gap' holds true. We prove that, far from being a peculiarity of those specific extensions and from requiring the convexity of the extended dynamics, this criterium is valid provided the original family V of controls is abundant in the extended family W. Abundance, which is stronger than the mere C^0-density of the original trajectories in the set of extended trajectories, is a dynamical-topological notion introduced by J. Warga, and is here utilized in a 'non-convex' version which, moreover, is adapted to differential manifolds. To get the main result, which is based on set separation arguments, we prove an open mapping result valid for Quasi-Differential-Quotient (QDQ) approximating cones, a notion of 'tangent cone' resulted as a peculiar specification of H. Sussmann's Approximate-Generalized-Differential-Quotients (AGDQ) approximating cone.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michele Palladino, Franco Rampazzo. 2019-09-13. A geometrically based criterion to avoid infimum-gaps in Optimal Control. https://doi.org/10.1016/j.jde.2020.06.066

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Operational Impact of Registry size, Cycle length, and Blood Type Distribution in Multi-Registry Kidney Exchange Programs

Kidney exchange programs address donor recipient incompatibility by exchanging donors between incompatible pairs, but single center KEPs often suffer from limited donor pools, which reduce matching efficiency. Multi registry kidney exchange programs offer a promising solution but face challenges, including heterogeneous constraints across registries, cycle-length bounds, and data-sharing limitations. This study uses simulation to compare mKEP allocation against individual registry operation, contrasting unconstrained pooling with two safeguarded mechanisms: a cumulative individual-rationality guarantee and a Shapley value based fair-share mechanism. We examine how registry size, blood-type distribution, cycle-length bounds, and dropout probability affect the size and distribution of achievable gain. Our central finding is that the benefit of joining an mKEP is systematically uneven: under blood group composition asymmetry, the easier-to-match registry gains less than its partner even under both safeguarded mechanisms, and a larger registry gains less than a smaller one when pooled. A registry combining a larger arrival rate with an easier-to-match pool may see its gain under either safeguarded mechanism fall too small to be practically significant, while registries with a higher dropout rate see a larger benefit from pooling. This unevenness concentrates in O-type recipients: an easier-to-match registry sees fewer O-type transplants within itself under pooling, though O-type transplant rates rise system-wide. Tighter cycle-length bounds increase, rather than diminish, the relative transplant-volume benefit of pooling, while match quality is only modestly affected by any factor examined. These results highlight the importance of pairing multi-registry collaboration with a carefully designed, equitable benefit-sharing mechanism to keep participation attractive for all registries involved.

math.OC↗
arXiv2026

A polynomial approximation scheme for nonlinear model reduction by moment matching

We propose a procedure for the numerical approximation of invariance equations arising in the moment matching technique associated with reduced-order modeling of high-dimensional dynamical systems. The Galerkin residual method is employed to find an approximate solution to the invariance equation using a Newton iteration on the coefficients of a monomial basis expansion of the solution. These solutions to the invariance equations can then be used to construct reduced-order models. We assess the ability of the method to solve the invariance PDE system as well as to achieve moment matching and recover the steady-state behaviour of nonlinear systems with state dimension of order 1000 driven by linear and nonlinear signal generators.

math.OC↗
arXiv2026

Computationally Efficient Density-Driven Optimal Control via Analytical KKT Reduction and Contractive MPC

Efficient coordination for collective spatial distribution is a fundamental challenge in multi-agent systems. Prior research on Density-Driven Optimal Control (D2OC) established a framework to match agent trajectories to a desired spatial distribution. However, implementing this as a predictive controller requires solving a large-scale Karush-Kuhn-Tucker (KKT) system, whose computational complexity grows cubically with the prediction horizon. To resolve this, we propose an analytical structural reduction that transforms the T-horizon KKT system into a condensed quadratic program (QP). This formulation achieves O(T) linear scalability, significantly reducing the online computational burden compared to conventional O(T^3) approaches. Furthermore, to ensure rigorous convergence in dynamic environments, we incorporate a contractive Lyapunov constraint and prove the Input-to-State Stability (ISS) of the closed-loop system against reference propagation drift. Numerical simulations verify that the proposed method facilitates rapid density coverage with substantial computational speed-up, enabling long-horizon predictive control for large-scale multi-agent swarms.

math.OC↗