Searcharxiv⌕ Search

arXiv · 2610.12774

Distributionally Robust Adaptive Iterative Covariance Steering for Small-Body Proximity Operations

Abstract

Autonomous small-body proximity operations require continuous-thrust guidance under uncertain gravity, solar-radiation pressure (SRP), and stochastic disturbances. We combine iterative covariance steering (iCS) with $L_1$ distributionally robust adaptive control ($L_1$-DRAC) to provide risk-aware collision avoidance despite mismatch between the nominal planning model and the true dynamics. Iterative covariance steering plans a nominal feedback policy satisfying distributionally robust conditional value-at-risk keep-out constraints, while $L_1$-DRAC compensates for dynamics uncertainty and bounds the residual distributional mismatch through a Wasserstein radius used by the planner. In $\mathbf{1000}$ paired Monte Carlo trials with gravity, SRP, and diffusion mismatch, $L_1$-DRAC adaptive control reduces the keep-out violation rate from $\mathbf{32.7\%}$ to $\mathbf{0.2\%}$ and the physical collision rate from $\mathbf{16.4\%}$ to zero, without actuator saturation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vivek Khatana, Aditya Gahlawat, Naira Hovakimyan, Petros Voulgaris. 2026-10-08. Distributionally Robust Adaptive Iterative Covariance Steering for Small-Body Proximity Operations. https://arxiv.org/abs/2610.12774

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

KEEP EXPLORING

Related papers

Scenario-Game ADMM: A Parallelized Scenario-Based Solver for Stochastic Noncooperative Games

Decision-making in multi-player games can be extremely challenging, particularly under uncertainty. In this work, we propose a new sample-based approximation to a class of stochastic, general-sum, pure Nash games, where each player has an expected-value objective and a set of chance constraints. This new approximation scheme inherits the accuracy of objective approximation from the established sample average approximation (SAA) method and enjoys a feasibility guarantee derived from the scenario optimization literature. We characterize the sample complexity of this new game-theoretic approximation scheme, and observe that high accuracy usually requires a large number of samples, which results in a large number of sampled constraints. To accommodate this, we decompose the approximated game into a set of smaller games with few constraints for each sampled scenario, and propose a decentralized, consensus-based ADMM algorithm to efficiently compute a generalized Nash equilibrium (GNE) of the approximated game. We prove the convergence of our algorithm to a GNE and empirically demonstrate superior performance relative to a recent baseline algorithm based on ADMM and interior point method.

eess.SY↗

Learning event-triggered controllers for linear parameter-varying systems from data

Nonlinear dynamical behaviors in engineering applications can be approximated by linear-parameter varying (LPV) representations, but obtaining precise model knowledge to develop a control algorithm is difficult in practice. In this paper, we develop data-driven control strategies for event-triggered linear parameter-varying (LPV) systems with stability verifications. First, we theoretically analyze the $θ$-persistence of excitation condition for LPV systems, which leads to feasible data-based representations. Then, in terms of the available perturbed data, we establish the stability certificates for event-triggered LPV systems with the aid of Petersen's lemma, in the sense of robust control, resulting in computationally tractable semidefinite programs whose feasible solutions yield the gain-scheduling controllers. Besides, we generalize the data-driven event-triggered LPV stabilization methods to the case of trajectory tracking, and discuss robust tracking stability accordingly. Finally, we verify the effectiveness of our theoretical derivations through numerical examples.

eess.SY↗

A Fully Analog Implementation of Model Predictive Control with Application to Buck Converters

This paper proposes a novel approach to design analog electronic circuits that implement Model Predictive Control (MPC) policies for dynamical systems described by affine models. Effective approaches to define a reduced-complexity explicit MPC are combined and applied to realize an analog circuit comprising a limited set of low-latency, commercially available components. The practical feasibility and effectiveness of the proposed approach are demonstrated through its application in the design of a novel controller for DC-DC Buck converters. We formally analyze the stability of the resulting system and conduct extensive numerical simulations to demonstrate the control system's performance in rejecting line and load disturbances.

eess.SY↗