SearcharxivSearch

arXiv · 2510.23454

Individual Minima-Informed Multi-Objective Model Predictive Control for Fixed Point Stabilization

Abstract

Multi-objective model predictive control (MOMPC) for fixed point stabilization requires an automated a priori decision-making (DM) mechanism to translate a high-level preference into a single solution. To this aim, we introduce an approach called individual minima-informed DM. This class of methods can be implemented through two sequential optimizations, regardless of the number of objectives, thereby improving the real-time capability of MOMPC. These methods operate on Pareto fronts (PFs) and leverage the individual minima (IM), which are characteristic Pareto-optimal points. By this, we aim to facilitate mapping a high-level preference to a point on the PF. Several approaches exist to guarantee the closed-loop stability of an MOMPC scheme. This work builds upon an approach known from the literature, which combines a quasi-infinite horizon scheme with an additional descent condition on the costs. Assuming that the terminal ingredients of the quasi-infinite horizon approach are fixed, then the size of a PF or the DM space is determined solely by the descent condition. This paper examines both the IM-informed DM methods and their integration into a stabilizing MOMPC scheme. The main contributions are twofold. First, we propose and systematically analyze six variants of IM-informed DM methods, including two novel methods, designed to facilitate the translation of a high-level preference to a point on the PF. Second, to retain the largest possible DM space for these methods, we show that they can be embedded into an MOMPC framework while preserving closed-loop stability under a descent condition that is less restrictive than in the literature. We further present a practical method for constructing the required terminal ingredients. A numerical case study confirms the closed-loop stability of the proposed framework and illustrates the potential benefit of adapting the preference online.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Markus Herrmann-Wicklmayr, Kathrin Flaßkamp. 2025-10-27. Individual Minima-Informed Multi-Objective Model Predictive Control for Fixed Point Stabilization. https://arxiv.org/abs/2510.23454

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

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC