Searcharxiv⌕ Search

arXiv subjects

Kenshiro Oguri

Publications and source records attributed to Kenshiro Oguri.

At least 19 recordsLinked to original sources

On Covariance Steering with Nonlinear Measurements

This paper examines two ways nonlinear measurements complicate the statistical predictions during covariance steering. The covariance steering problem optimizes a control policy across a distribution of possible trajectories rather than a single specific trajectory. This approach has attracted growing interest as a way to account for uncertainty in aerospace applications such as trajectory optimization, stationkeeping, and landing. In many of these applications, covariance steering can account for measurement uncertainty through output feedback. Because standard formulations assume linear dynamics and measurements, applications with nonlinear measurements typically use an extended Kalman filter to estimate the state. This paper shows that techniques used to improve filter convergence, such as measurement underweighting, can reduce the accuracy of conventional covariance steering predictions by violating a key assumption. This is addressed with a new convex formulation that relaxes the assumption. This paper also demonstrates that adjusting the control policy during execution can improve agreement between predicted and actual state statistics. A numerical example of angles-only spacecraft rendezvous illustrates the benefits of the proposed method, and discussions are made regarding the implications of this generalized covariance steering formulation.

math.OC↗

Non-Gaussian Uncertainty Estimation via Semi-nonparametric Density

Accurate and efficient representation of non-Gaussian state distributions is critical for estimation, control, and decision-making, especially when the system is highly nonlinear. This paper develops a mathematical framework for estimating non-Gaussian uncertainty via semi-nonparametric (SNP), or Gallant-Nychka, densities. SNP densities use squared probabilists' Hermite polynomials to guarantee nonnegative probability densities while representing non-Gaussian behavior. For uncertainty propagation, once fitted to propagated state samples, SNP densities enable direct analytical density and probability evaluations without needing to tune additional hyperparameters besides the polynomial order. To enable their application to nonlinear dynamical systems, we derive analytic marginal and cumulative distribution functions and develop a lossless convex formulation of the coefficient estimation problem along a given sign branch. The approach is demonstrated on the chaotic Lorenz system and compared against Gaussian mixture models and Edgeworth approximations. Results demonstrate that SNP densities can accurately represent non-Gaussian state distributions while enabling direct probability and quantile evaluation, making them a promising tool for density estimation and uncertainty quantification in nonlinear estimation and control.

math.OC↗

Encrypted collision avoidance maneuver via variational optimization

We propose an encrypted collision avoidance maneuver (CAM) design protocol using homomorphic encryption (HE) that enables operators to outsource CAM design to an untrusted server without revealing their private covariance. To this end, we reformulate the constrained CAM optimization as a sampling based estimation problem via a variational approach, so that the private covariance dependent terms can be efficiently evaluated under HE. The protocol requires only a single round of communication, and experiments on six real-world conjunction data messages demonstrate improved feasibility and reduced fuel consumption compared with CAMs designed using public covariance.

eess.SY↗

Robust Halo Orbit Stationkeeping Under Missed Thrust Events and Maneuver Execution Errors

Spacecraft stationkeeping is subject to various operational uncertainties such as missed thrust events, maneuver execution errors, and dynamics modeling errors. Missed thrust events are the most disruptive of these, and current practices mitigate that risk through Monte Carlo-driven heuristics and conservative margins that offer no formal safety guarantees and do not scale to multiple missed thrust events. This paper models these unplanned thruster outages through the Markov Jump System framework, and represents maneuver execution errors and dynamics linearization errors as bounded multiplicative noise. The resulting closed-loop system is a linear time-varying periodic Markov jump system with multiplicative noise, for which Lyapunov-like mean square stability and periodic set invariance conditions are derived. A linear matrix inequality-based optimal controller synthesis framework then designs a periodic, mode-dependent mean-square stable feedback policy that respects path constraints with probability one. The framework is demonstrated on the Earth-Moon 9:2 near-rectilinear halo orbit (NRHO), under both impulsive and low-thrust propulsion, and on a Saturn-Enceladus $L_1$ NRHO using impulsive propulsion. Nonlinear Monte Carlo simulations show that the spacecraft recovers from an arbitrary number of missed thrust events while respecting path constraints, and that the multiplicative noise model introduces additional robustness to maneuver execution error and linearization error.

math.OC↗

Cubature-Based Statistical Moment Steering for Nonlinear, Non-Gaussian Trajectory Optimization

This paper addresses discrete-time non-Gaussian distribution steering in deterministic nonlinear systems. Distribution steering is a problem in which a control policy is designed over a distribution of trajectories rather than optimizing a single trajectory. The challenge with nonlinear systems is that even initially Gaussian distributions evolve into non-Gaussian distributions, often precluding a closed-form representation of the probability density. A method called statistical moment steering applies a cubature-based method to approximate non-Gaussian distributions for an approximate solution to this problem. This paper provides theoretical support and details how it can be solved with sequential convex optimization. A coupled, nonlinear, second-order ordinary differential equation describing a two-dimensional oscillator is provided as a numerical example.

math.OC↗

Global Regularization of the Spatial Elliptic Restricted Three-body Problem: Quaternionic, Hamiltonian Formulation

Any objects in space may encounter singularity due to the inverse-square law of the gravitational force, hindering the analysis and propagation of particle motion in space. Regularization in celestial mechanics removes such gravitational singularities in equations of motion by transforming the time and coordinates. This paper addresses a class of regularization methods known as global regularization for restricted three-body problems (R3BPs), which simultaneously removes the two singularities (e.g., Earth and Moon in cislunar space). It enables analysis, propagation, and prediction of particle motion throughout the domain of R3BPs, which is in stark contrast to regularizing each singularity individually. In particular, this paper develops a formulation for global regularization of the spatial elliptic R3BP (ER3BP) under external perturbations. The presented formulation leverages mathematical tools from quaternionic (hyper-complex) algebra and Hamiltonian mechanics. This approach enables us to (i) elegantly handle the four-dimensional coordinates arising from the dimension-lifting operation for spatial regularization, (ii) systematically derive the coordinate-momentum transformation while preserving the canonical structure and incorporating perturbing forces, and (iii) provide geometric insights for analyzing the regularity of the transformation, resulting Hamiltonian, and dynamical flow. Numerical examples demonstrate the validity of the mathematical results as well as significant numerical benefits of the regularization formulation in perturbed Earth-Moon ER3BP.

math.DS↗

Global Optimization Framework for Automated Low-Thrust Gravity-Assist Trajectory Design

Gravity-assist trajectory design requires searching numerous leg combinations, but applying nonlinear programming (NLP) for low-thrust trajectory optimization to all combinations is computationally prohibitive. Therefore, conventional frameworks first perform broad search using lightweight trajectory models such as Lambert-based calculation and simplified deep-space maneuver models, while pruning infeasible candidates. However, to maintain efficiency, conventional approaches handle only low-dimensional formulations with limited constraints such as up to a couple of impulse maneuvers per leg. Consequently, they cannot accommodate the constrained multivariable optimization required for low-thrust design, running the risk of prematurely pruning viable trajectories. To address this, this paper introduces a convex pruning approach capable of solving constrained multivariable problems directly within broad search while retaining the computational efficiency. We then augment the broad search stage with a robust local low-thrust optimization algorithm based on thrust regularization, which together enable global exploration and optimization in an automated fashion. We apply the proposed framework in a BepiColombo-inspired scenario involving nine gravity assists, successfully demonstrating its broad search capability to discover a far greater number of solutions (36,335) compared to a conventional approach (4,664) while identifying a wider feasible launch window by one year.

math.OC↗

Generalizing Output-Feedback Covariance Steering to Incorporate Non-Orthogonal Estimation Errors

This paper addresses the problem of steering a state distribution over a finite horizon in discrete time with output feedback. The incorporation of output feedback introduces additional challenges arising from the statistical coupling between the true state distribution and the corresponding filtered state distribution. In particular, this paper extends existing covariance steering formulations to scenarios in which estimation errors are not orthogonal to the state estimates. This paper presents a sequential convex programming framework with rank constraints to solve this more general covariance steering with output feedback problem. The proposed approach is validated through numerical examples and Monte Carlo simulations, including cases with non-orthogonal estimation errors that prior techniques cannot address.

math.OC↗

On the Optimality of Markovian Policies for Chance-Constrained Covariance Steering

Many studies on finite-horizon stochastic optimal control, including covariance steering, parameterize control policies as state-history-affine. This parameterization enables a convex reformulation, thereby yielding a tractable solution method. However, the necessity of dependence on previous states has not been well established. \textit{Is this dependence necessary, or merely an artifact of the convex reformulation?} We show that it is an artifact that can be removed losslessly. Given an optimal solution of the state-history-affine formulation, we construct a deterministic Markovian policy which is affine in the current state. We show that, even for the covariance steering problem with a broad class of commonly used state and control safety constraints, the synthesized Markovian policy almost surely produces the same control actions as the history-dependent policy and therefore the same state trajectories, cost, and moments. Thus, every optimum of the history-dependent formulation admits a lossless Markovian transformation. Geometrically, the history-dependent formulation lifts the policy space for convexity, and its optimal solution can be projected back to the Markovian policy space. We extend the analysis to output feedback and a convex upper-bounding surrogate for value-at-risk costs.

math.OC↗

Pontryagin-Bellman Differential Dynamic Programming for Low-Thrust Trajectory Optimization with Path Constraints

We present a Differential Dynamic Programming framework that parameterizes the control via Pontryagin's Minimum Principle, for constrained low-thrust trajectory optimization. This approach, dubbed Pontryagin-Bellman Differential Dynamic Programming (PDDP), optimizes the costates using a null-space trust-region method, solving a series of quadratic subproblems derived from first- and second-order sensitivities. Terminal equality constraints are handled via a general augmented Lagrangian method, while continuous-time state-path constraints are enforced using a quadratic penalty approach. The resulting solution method represents a significant improvement over classical indirect methods, which are known to face challenges for state-constrained problems. The flexibility of PDDP in handling various state-path constraints is demonstrated through minimum-radius and eclipse-avoidance trajectories in cislunar space. Finally, a trade study against indirect multiple shooting shows that PDDP achieves higher convergence rates overall, indicating improved robustness to poor initial guesses.

math.OC↗

Chance-Constrained Covariance Steering for Discrete-Time Markov Jump Linear Systems

In this paper, we solve the chance-constrained covariance steering problem for discrete-time Markov Jump Linear Systems (MJLS) using a convex optimization framework. We derive the analytical expressions for the mean and covariance trajectories of time-varying discrete-time MJLS and show that they cannot be separated even without chance constraints, unlike the single-mode dynamics case. To solve the covariance steering problem, we propose a two-step convex optimization framework, which optimizes the mean and covariance subproblems sequentially. Further, we incorporate chance constraints and propose an iterative optimization framework to solve the chance-constrained covariance steering problem. Both problems are originally nonconvex, and we derive convex relaxations which are proved to be lossless at optimality using the Karush-Kuhn-Tucker (KKT) conditions. Numerical simulations demonstrate the proposed method by achieving target covariances while respecting chance constraints under additive noise, bias, and Markovian jump dynamics.

math.OC↗

Convex Bound of Nonlinear Dynamical Errors for Covariance Steering

Applying linear controllers to nonlinear systems requires the dynamical linearization about a reference. In highly nonlinear environments such as cislunar space, the region of validity for these linearizations varies widely and can negatively affect controller performance if not carefully formulated. This paper presents a formulation that minimizes the nonlinear errors experienced by linear covariance controllers. The formulation involves upper-bounding the remainder term from the linearization process using higher-order terms in a Taylor series expansion, and resolving it into a convex function. This can serve as a cost function for controller gain optimization, and its convex nature allows for efficient solutions through convex optimization. This formulation is then demonstrated and compared with the current methods within a halo orbit stationkeeping scenario. The results show that the formulation proposed in this paper maintains the Gaussianity of the distribution in nonlinear simulations more effectively, thereby allowing the linear covariance controller to perform more as intended in nonlinear environments.

math.OC↗

Convex Block-Cholesky Approach to Risk-Constrained Low-thrust Trajectory Design under Operational Uncertainty

Designing robust trajectories under uncertainties is an emerging technology that may represent a key paradigm shift in space mission design. As we pursue more ambitious scientific goals (e.g., multi-moon tours, missions with extensive components of autonomy), it becomes more crucial that missions are designed with navigation (Nav) processes in mind. The effect of Nav processes is statistical by nature, as they consist of orbit determination (OD) and flight-path control (FPC). Thus, this mission design paradigm calls for techniques that appropriately quantify statistical effects of Nav, evaluate associated risks, and design missions that ensure sufficiently low risk while minimizing a statistical performance metric; a common metric is Delta-V99: worst-case (99%-quantile) Delta-V expenditure including statistical FPC efforts. In response to the need, this paper develops an algorithm for risk-constrained trajectory optimization under operational uncertainties due to initial state dispersion, navigation error, maneuver execution error, and imperfect dynamics modeling. We formulate it as a nonlinear stochastic optimal control problem and develop a computationally tractable algorithm that combines optimal covariance steering and sequential convex programming (SCP). Specifically, the proposed algorithm takes a block-Cholesky approach for convex formulation of optimal covariance steering, and leverages a recent SCP algorithm, SCvx*, for reliable numerical convergence. We apply the developed algorithm to risk-constrained, statistical trajectory optimization for exploration of dwarf planet Ceres with a Mars gravity assist, and demonstrate the robustness of the statistically-optimal trajectory and FPC policies via nonlinear Monte Carlo simulation.

eess.SY↗

Square Root-Factorized Covariance Steering

Covariance steering (CS) synthesizes a control policy which drives the state's mean and covariance matrix towards desired values. Offering tractable computation of a closed-loop policy which can obey chance constraints in uncertain environments, application to many real-world control problems have been proposed. We consider the chance-constrained, discrete-time, linear time-varying CS with Gaussian noise. The contribution of this paper is a novel solution method for this problem, explicitly writing the propagation equations of the Cholesky factor of the state covariance matrix by using the QR decomposition. The use of the square-root form of covariance matrices brings two key benefits over other existing methods: (i) computational scalability and (ii) numerical reliability. (i) Compared to solution methods that require large block matrix formulations, the proposed method scales better with the growth in horizon length, shows better optimality, and uses memoryless state feedback. (ii) Compared to another class of methods that explicitly define the covariance matrix as variables, the proposed method allows flexible cost formulations and shows better numerical reliability when uncertainty terms are smaller than the mean. On the other hand, these benefits come with a minor drawback: the propagation equation of covariance square roots is non-convex, necessitating sequential convex programming to solve. However, this paper proves the global optimality of the proposed approach for CS without chance constraints. When chance constraints are present, the existing optimal CS formulation is also non-convex, and we prove that the proposed approach shares the same local minima. We verify the mathematical arguments via extensive numerical simulations.

math.OC↗

Autonomous Horizon-based Asteroid Navigation With Observability-constrained Maneuvers

Small body exploration is a pertinent challenge due to low gravity environments and strong sensitivity to perturbations like Solar Radiation Pressure (SRP). Thus, autonomous methods are being developed to enable safe navigation and control around small bodies. These methods often involve using Optical Navigation (OpNav) to determine the spacecraft's location. Ensuring OpNav reliability would allow the spacecraft to maintain an accurate state estimate throughout its mission. This research presents an observability-constrained Lyapunov controller that steers a spacecraft to a desired target orbit while guaranteeing continuous OpNav observability. We design observability path constraints to avoid regions where horizon-based OpNav methods exhibit poor performance, ensuring control input that maintains good observability. This controller is implemented with a framework that simulates small body dynamics, synthetic image generation, edge detection, horizon-based OpNav, and filtering. We evaluate the approach in two representative scenarios, orbit maintenance and approach with circularization, around spherical and ellipsoidal target bodies. In Monte Carlo simulations, the proposed approach improves the rate of attaining target orbits without observability violations by up to 94% compared to an unconstrained Lyapunov baseline, demonstrating improved robustness over conventional methods.

cs.RO↗

Non-Gaussian Distribution Steering in Nonlinear Dynamics with Conjugate Unscented Transformation

In highly nonlinear systems such as the ones commonly found in astrodynamics, Gaussian distributions generally evolve into non-Gaussian distributions. This paper introduces a method for effectively controlling non-Gaussian distributions in nonlinear environments using optimized linear feedback control. This paper utilizes Conjugate Unscented Transformation to quantify the higher-order statistical moments of non-Gaussian distributions. The formulation focuses on controlling and constraining the sigma points associated with the uncertainty quantification, which would thereby reflect the control of the entire distribution and constraints on the moments themselves. This paper develops an algorithm to solve this problem with sequential convex programming, and it is demonstrated through a two-body and three-body example. The examples show that individual moments can be directly controlled, and the moments are accurately approximated for non-Gaussian distributions throughout the controller's time horizon in nonlinear dynamics.

eess.SY↗

Hands-Off Covariance Steering: Inducing Feedback Sparsity via Iteratively Reweighted $\ell_{1,p}$ Regularization

We consider the problem of optimally steering the state covariance matrix of a discrete-time linear stochastic system to a desired terminal covariance matrix, while inducing the control input to be zero over many time intervals. We propose to induce sparsity in the feedback gain matrices by using a sum-of-norms version of the iteratively reweighted $\ell_1$-norm minimization. We show that the lossless convexification property holds even with the regularization term. Numerical simulations show that the proposed method produces a Pareto front of transient cost and sparsity that is not achievable by a simple $\ell_1$-norm minimization and closely approximates the $\ell_0$-norm minimization obtained from brute-force search.

math.OC↗

Robust Cislunar Low-Thrust Trajectory Optimization under Uncertainties via Sequential Covariance Steering

Spacecraft operations are influenced by uncertainties such as dynamics modeling, navigation, and maneuver execution errors. Although mission design has traditionally incorporated heuristic safety margins to mitigate the effect of uncertainties, particularly before/after crucial events, it is yet unclear whether this practice will scale in the cislunar region, which features locally chaotic nonlinear dynamics and involves frequent lunar flybys. This paper applies chance-constrained covariance steering and sequential convex programming to simultaneously design an optimal trajectory and trajectory correction policy that can probabilistically guarantee safety constraints under the assumed physical/navigational error models. The results show that the proposed method can effectively control the state uncertainty in a highly nonlinear environment. The framework allows faster computation and lossless convexification of linear covariance propagation compared to existing methods, enabling a rapid and accurate comparison of $ΔV_{99}$ costs for different uncertainty parameters. We demonstrate the algorithm on several transfers in the Earth-Moon Circular Restricted Three Body Problem.

math.OC↗