arXiv subjects

Ilya Kolmanovsky

Publications and source records attributed to Ilya Kolmanovsky.

At least 19 recordsLinked to original sources

arXiv2026

Dynamically Feasible Planning and Control in Complex Environments: a Scalable Systematic Approach

In this article we present a method to generate safe sets for linear discrete-time systems subject to non-convex constraints that can be represented as a union of polytopes. It is then shown how a reference governor can be implemented for safe reference tracking tasks. A theoretical analysis of the safe set is presented and properties of the reference governor scheme are derived. The guarantees include safety at any time as well as finite-time convergence of the applied reference command to any strictly admissible reference command. For the proposed reference governor, online computational overhead is low. Moreover, it is shown that for specific instances of the complex constraint sets, the safe set can be computed efficiently. Extensive simulation results demonstrating the applicability of the method and online/offline computation times are reported.

eess.SY↗

arXiv2026

Computationally Efficient Near-Optimal Control for Current Ripple Reduction and Optimization of Three-Phase Motors via LMIs

The optimal control of three-phase permanent-magnet synchronous motors (PMSMs) is challenging due to their nonlinearity and the discrete nature of the control set. Existing approaches either rely on mixed-integer trajectory optimization or require computationally intensive value-iteration procedures. This paper proposes a Linear Matrix Inequality (LMI)-based method for approximating the infinite-horizon value function using a quadratic parameterization and iterated Bellman inequalities, yielding a tractable convex program. The computed function can be obtained efficiently offline and used online as a tail cost in a horizon-one optimal control law. Simulation results show that the proposed approach achieves a favorable trade-off between switching effort and current ripple, with performance comparable to that of finite-control-set MPC but with a significantly lower computational cost.

math.OC↗

arXiv2026

Constrained Lyapunov Stabilization based on Gauss Variational Equations: From Spacecraft Orbital Transfers to Rendezvous

Lyapunov feedback laws can be constructed for performing orbital transfer maneuvers based on Gauss Variational Equations, or GVEs, while satisfying specified state and control constraints. These state and control constraints are enforced using barrier functions and saturation, respectively, while the reference governor, employed as a convergence governor, is used to avoid getting stuck at spurious equilibria that may be created by barrier functions. In this article, these Lyapunov feedback laws are extended to rendezvous maneuvers where not only five orbital elements are matched to prescribed target values, but also the true anomaly matches its time dependent target value. The modification involves altering the commanded semi major axis with an outer loop feedback law, also designed using Lyapunov techniques. We illustrate the resulting safe closed loop rendezvous maneuvers in simulations for conventional thrust based propulsion and Lorentz force-based propulsion. In the latter case, only the current through the tether is controlled, subject to current limits, to accomplish prescribed orbital transfer and rendezvous maneuvers.

math.OC↗

arXiv2026

A Safe and Stable Controller for Fuel Cell Systems Using Adaptation and Reference Governors

This paper proposes a control architecture integrating adaptation with Lyapunov-based Reference Governors (LRGs) to ensure state constraint satisfaction for first-order systems with parametric uncertainties. Adaptation combined with LRGs guarantees stability, ensures good control performance, and remains safe even with parametric uncertainties. Simulations of the fuel cell temperature regulation problem demonstrate that the proposed control architecture successfully meets all control and safety objectives, whereas the standard adaptation fails to achieve the latter.

eess.SY↗

arXiv2026

Distributionally Robust Planning with $\mathcal{L}_1$ Adaptive Control

Safe operation of autonomous systems requires robustness to both model uncertainty and uncertainty in the environment. We propose DRP-$\mathcal{L}_1$AC, a hierarchical framework for stochastic nonlinear systems that integrates distributionally robust model predictive control (DR-MPC) with $\mathcal{L}_1$-adaptive control. The key idea is to use the $\mathcal{L}_1$-adaptive controller's online distributional certificates that bound the Wasserstein distance between nominal and true state distributions, thereby certifying the ambiguity sets used for planning without requiring distribution samples. Environmental uncertainty is captured via data-driven ambiguity sets constructed from finite samples. These are incorporated into a DR-MPC planner enforcing distributionally robust chance constraints over a receding horizon. Using Wasserstein duality, the resulting problem admits tractable reformulations and a sample-based implementation. We show theoretically and via numerical experimentation that our framework ensures certifiable safety in the presence of simultaneous system and environmental uncertainties.

eess.SY↗

arXiv2026

Robust Adaptive MPC in the Presence of Nonlinear Time-Varying Uncertainties: An Uncertainty Compensation Approach

This paper introduces an uncertainty compensation-based robust adaptive model predictive control (MPC) framework for linear systems with nonlinear time-varying uncertainties. The framework integrates an L1 adaptive controller to compensate for the matched uncertainty and a robust feedback controller, designed using linear matrix inequalities, to mitigate the effect of unmatched uncertainty on target output channels. Uniform bounds on the errors between the system's states and control inputs and those of a nominal (i.e., uncertainty-free) system are derived. These error bounds are then used to tighten the actual system's state and input constraints, enabling the design of an MPC for the nominal system under these tightened constraints. Referred to as uncertainty compensation-based MPC (UC-MPC), this approach ensures constraint satisfaction while delivering enhanced performance compared to existing methods. Simulation results for a flight control example and a spacecraft landing on an asteroid demonstrate the effectiveness of the proposed framework.

eess.SY↗

arXiv2025

Suboptimal Shrinking Horizon MPC with a Lower Hessian Condition Number from Adjustable Terminal Cost

A strategy for reducing the number of iterations and computational burden in shrinking horizon Model Predictive Control (SH-MPC) when steering into a prescribed terminal set despite unmeasured disturbances is proposed. This strategy exploits dynamic adjustment of the terminal cost weight and horizon length while ensuring that the terminal set is reached within a desired number of steps. A lower Hessian condition number which facilitates the computational reduction is proved under assumptions, and an example of spacecraft nutation damping using the proposed approach is reported.

math.OC↗

arXiv2025

Symptom-Driven Personalized Proton Pump Inhibitors Therapy Using Bayesian Neural Networks and Model Predictive Control

Proton Pump Inhibitors (PPIs) are the standard of care for gastric acid disorders but carry significant risks when administered chronically at high doses. Precise long-term control of gastric acidity is challenged by the impracticality of invasive gastric acid monitoring beyond 72 hours and wide inter-patient variability. We propose a noninvasive, symptom-based framework that tailors PPI dosing solely on patient-reported reflux and digestive symptom patterns. A Bayesian Neural Network prediction model learns to predict patient symptoms and quantifies its uncertainty from historical symptom scores, meal, and PPIs intake data. These probabilistic forecasts feed a chance-constrained Model Predictive Control (MPC) algorithm that dynamically computes future PPI doses to minimize drug usage while enforcing acid suppression with high confidence - without any direct acid measurement. In silico studies over diverse dietary schedules and virtual patient profiles demonstrate that our learning-augmented MPC reduces total PPI consumption by 65 percent compared to standard fixed regimens, while maintaining acid suppression with at least 95 percent probability. The proposed approach offers a practical path to personalized PPI therapy, minimizing treatment burden and overdose risk without invasive sensors.

eess.SY↗

arXiv2025

Time Shift Governor-Guided MPC with Collision Cone CBFs for Safe Adaptive Cruise Control in Dynamic Environments

This paper introduces a Time Shift Governor (TSG)-guided Model Predictive Controller with Control Barrier Functions (CBFs)-based constraints for adaptive cruise control (ACC). This MPC-CBF approach is defined for obstacle-free curved road tracking, while following distance and obstacle avoidance constraints are handled using standard CBFs and relaxed Collision Cone CBFs. In order to address scenarios involving rapidly moving obstacles or rapidly changing leading vehicle's behavior, the TSG augmentation is employed which alters the target reference to enforce constraints. Simulation results demonstrate the effectiveness of the TSG-guided MPC-CBF approach.

eess.SY↗

arXiv2025

Control Invariant Sets for Neural Network Dynamical Systems and Recursive Feasibility in Model Predictive Control

Neural networks are powerful tools for data-driven modeling of complex dynamical systems, enhancing predictive capability for control applications. However, their inherent nonlinearity and black-box nature challenge control designs that prioritize rigorous safety and recursive feasibility guarantees. This paper presents algorithmic methods for synthesizing control invariant sets specifically tailored to neural network based dynamical models. These algorithms employ set recursion, ensuring termination after a finite number of iterations and generating subsets in which closed-loop dynamics are forward invariant, thus guaranteeing perpetual operational safety. Additionally, we propose model predictive control designs that integrate these control invariant sets into mixed-integer optimization, with guaranteed adherence to safety constraints and recursive feasibility at the computational level. We also present a comprehensive theoretical analysis examining the properties and guarantees of the proposed methods. Numerical simulations in an autonomous driving scenario demonstrate the methods' effectiveness in synthesizing control-invariant sets offline and implementing model predictive control online, ensuring safety and recursive feasibility.

eess.SY↗

arXiv2025

A Survey of Reinforcement Learning-Based Motion Planning for Autonomous Driving: Lessons Learned from a Driving Task Perspective

Reinforcement learning (RL), with its ability to explore and optimize policies in complex, dynamic decision-making tasks, has emerged as a promising approach to addressing motion planning (MoP) challenges in autonomous driving (AD). Despite rapid advancements in RL and AD, a systematic description and interpretation of the RL design process tailored to diverse driving tasks remains underdeveloped. This survey provides a comprehensive review of RL-based MoP for AD, focusing on lessons from task-specific perspectives. We first outline the fundamentals of RL methodologies, and then survey their applications in MoP, analyzing scenario-specific features and task requirements to shed light on their influence on RL design choices. Building on this analysis, we summarize key design experiences, extract insights from various driving task applications, and provide guidance for future implementations. Additionally, we examine the frontier challenges in RL-based MoP, review recent efforts to addresse these challenges, and propose strategies for overcoming unresolved issues.

cs.LG↗

arXiv2025

Learning Hamiltonian Dynamics with Bayesian Data Assimilation

In this paper, we develop a neural network-based approach for time-series prediction in unknown Hamiltonian dynamical systems. Our approach leverages a surrogate model and learns the system dynamics using generalized coordinates (positions) and their conjugate momenta while preserving a constant Hamiltonian. To further enhance long-term prediction accuracy, we introduce an Autoregressive Hamiltonian Neural Network, which incorporates autoregressive prediction errors into the training objective. Additionally, we employ Bayesian data assimilation to refine predictions in real-time using online measurement data. Numerical experiments on a spring-mass system and highly elliptic orbits under gravitational perturbations demonstrate the effectiveness of the proposed method, highlighting its potential for accurate and robust long-term predictions.

cs.LG↗

arXiv2024

Newton Methods in Generalized Nash Equilibrium Problems with Applications to Game-Theoretic Model Predictive Control

We prove input-to-state stability (ISS) of perturbed Newton-type methods for generalized equations arising from Nash equilibrium (NE) and generalized NE (GNE) problems. This ISS property allows the use of inexact computations in equilibrium-seeking to enable fast solution tracking in dynamic systems such as in model predictive control (MPC). For NE problems, we address the local convergence of perturbed Josephy-Newton methods from the variational inequality (VI) stability analysis, and establish the ISS result under less restrictive regularity conditions compared to the existing results established for nonlinear optimization. Agent-distributed algorithms are also developed. For GNE problems, since they cannot be reduced to VI problems in general, we use semismooth Newton methods to solve the semismooth equations arising from the Karush-Kuhn-Tucker (KKT) systems of the GNE problem and establish the ISS result under a quasi-regularity condition. To illustrate the use of the ISS in dynamic systems, applications to constrained game-theoretic MPC (CG-MPC) are studied with time-distributed solution-tracking for real-time implementation. Boundness of tracking errors is proven. Numerical examples are reported.

eess.SY↗

arXiv2024

Constrained Control for Autonomous Spacecraft Rendezvous: Learning-Based Time Shift Governor

This paper develops a Time Shift Governor (TSG)-based control scheme to enforce constraints during rendezvous and docking (RD) missions in the setting of the Two-Body problem. As an add-on scheme to the nominal closed-loop system, the TSG generates a time-shifted Chief spacecraft trajectory as a target reference for the Deputy spacecraft. This modification of the commanded reference trajectory ensures that constraints are enforced while the time shift is reduced to zero to effect the rendezvous. Our approach to TSG implementation integrates an LSTM neural network which approximates the time shift parameter as a function of a sequence of past Deputy and Chief spacecraft states. This LSTM neural network is trained offline from simulation data. We report simulation results for RD missions in the Low Earth Orbit (LEO) and on the Molniya orbit to demonstrate the effectiveness of the proposed control scheme. The proposed scheme reduces the time to compute the time shift parameter in most of the scenarios and successfully completes rendezvous missions.

eess.SY↗

arXiv2024

CIKAN: Constraint Informed Kolmogorov-Arnold Networks for Autonomous Spacecraft Rendezvous using Time Shift Governor

The paper considers a Constrained-Informed Neural Network (CINN) approximation for the Time Shift Governor (TSG), which is an add-on scheme to the nominal closed-loop system used to enforce constraints by time-shifting the reference trajectory in spacecraft rendezvous applications. We incorporate Kolmogorov-Arnold Networks (KANs), an emerging architecture in the AI community, as a fundamental component of CINN and propose a Constrained-Informed Kolmogorov-Arnold Network (CIKAN)-based approximation for TSG. We demonstrate the effectiveness of the CIKAN-based TSG through simulations of constrained spacecraft rendezvous missions on highly elliptic orbits and present comparisons between CIKANs, MLP-based CINNs, and the conventional TSG.

eess.SY↗

arXiv2024

Safe Adaptive Cruise Control Under Perception Uncertainty: A Deep Ensemble and Conformal Tube Model Predictive Control Approach

Autonomous driving heavily relies on perception systems to interpret the environment for decision-making. To enhance robustness in these safety critical applications, this paper considers a Deep Ensemble of Deep Neural Network regressors integrated with Conformal Prediction to predict and quantify uncertainties. In the Adaptive Cruise Control setting, the proposed method performs state and uncertainty estimation from RGB images, informing the downstream controller of the DNN perception uncertainties. An adaptive cruise controller using Conformal Tube Model Predictive Control is designed to ensure probabilistic safety. Evaluations with a high-fidelity simulator demonstrate the algorithm's effectiveness in speed tracking and safe distance maintaining, including in Out-Of-Distribution scenarios.

cs.RO↗

arXiv2024

Suboptimal MPC with a Computation Governor: Stability, Recursive Feasibility, and Applications to ADMM

The paper considers a computational governor strategy to facilitate the implementation of Model Predictive Control (MPC) based on inexact optimization when the time available to compute the solution may be insufficient. In the setting of linear-quadratic MPC and a class of optimizers that includes Alternating Direction Method of Multipliers (ADMM), we derive conditions on the reference command adjustment by the computational governor and on a constraint tightening strategy which ensure recursive feasibility, convergence of the modified reference command, and closed-loop stability. An online procedure to select the modified reference command and construct an implicit terminal set is also proposed. A simulation example is reported which illustrates the developed procedures.

math.OC↗

arXiv2024

Robust Adaptive MPC Using Uncertainty Compensation

This paper presents an uncertainty compensation-based robust adaptive model predictive control (MPC) framework for linear systems with both matched and unmatched nonlinear uncertainties subject to both state and input constraints. In particular, the proposed control framework leverages an L1 adaptive controller (L1AC) to compensate for the matched uncertainties and to provide guaranteed uniform bounds on the error between the states and control inputs of the actual system and those of a nominal i.e., uncertainty-free, system. The performance bounds provided by the L1AC are then used to tighten the state and control constraints of the actual system, and a model predictive controller is designed for the nominal system with the tightened constraints. The proposed control framework, which we denote as uncertainty compensation-based MPC (UC-MPC), guarantees constraint satisfaction and achieves improved performance compared with existing methods. Simulation results on a flight control example demonstrate the benefits of the proposed framework.

eess.SY↗