Searcharxiv⌕ Search

arXiv subjects

Kenshiro Oguri

Publications and source records attributed to Kenshiro Oguri.

23 records · Page 2Linked to original sources

Successive Convexification with Feasibility Guarantee via Augmented Lagrangian for Non-Convex Optimal Control Problems

This paper proposes a new algorithm that solves non-convex optimal control problems with a theoretical guarantee for global convergence to a feasible local solution of the original problem. The proposed algorithm extends the recently proposed successive convexification (SCvx) algorithm by addressing one of its key limitations, that is, the converged solution is not guaranteed to be feasible to the original non-convex problem. The main idea behind the proposed algorithm is to incorporate the SCvx-based iteration into an algorithmic framework based on the augmented Lagrangian method to enable the feasibility guarantee while retaining favorable properties of SCvx. Unlike the original SCvx, this approach iterates on both of the optimization variables and the Lagrange multipliers, which facilitates the feasibility guarantee as well as efficient convergence, in a spirit similar to the alternating direction method of multipliers (ADMM) for large-scale convex programming. Convergence analysis shows the proposed algorithm's strong global convergence to a feasible local optimum of the original problem and its convergence rate. These theoretical results are demonstrated via numerical examples with comparison against the original SCvx algorithm.

math.OC↗

Robust Controller Synthesis under Markovian Mode Switching with Periodic LTV Dynamics

In this work, we propose novel LMI-based controller synthesis frameworks for periodically time-varying Markov-jump linear systems. We first discuss the necessary conditions for mean square stability and derive Lyapunov-like conditions for stability assurance. To relax strict stability requirements, we introduce a new criterion that doesn't require the Lyapunov function to decrease at each time step. Further, we incorporate these stability theorems in LMI-based controller synthesis frameworks while considering two separate problems: minimizing a quadratic cost, and maximizing the region of attraction. Numerical simulations verify the controllers' stability and showcase its applicability to fault-tolerant control.

math.OC↗

Chance-Constrained Gaussian Mixture Steering to a Terminal Gaussian Distribution

We address the problem of finite-horizon control of a discrete-time linear system, where the initial state distribution follows a Gaussian mixture model, the terminal state must follow a specified Gaussian distribution, and the state and control inputs must obey chance constraints. We show that, throughout the time horizon, the state and control distributions are fully characterized by Gaussian mixtures. We then formulate the cost, distributional terminal constraint, and affine/2-norm chance constraints on the state and control, as convex functions of the decision variables. This is leveraged to formulate the chance-constrained path planning problem as a single convex optimization problem. A numerical example demonstrates the effectiveness of the proposed method.

math.OC↗

Chance-Constrained Control for Safe Spacecraft Autonomy: Convex Programming Approach

This paper presents a robust path-planning framework for safe spacecraft autonomy under uncertainty and develops a computationally tractable formulation based on convex programming. We utilize chance-constrained control to formulate the problem. It provides a mathematical framework to solve for a sequence of control policies that minimizes a probabilistic cost under probabilistic constraints with a user-defined confidence level (e.g., safety with 99.9% confidence). The framework enables the planner to directly control state distributions under operational uncertainties while ensuring the vehicle safety. This paper rigorously formulates the safe autonomy problem, gathers and extends techniques in literature to accommodate key cost/constraint functions that often arise in spacecraft path planning, and develops a tractable solution method. The presented framework is demonstrated via two representative numerical examples: safe autonomous rendezvous and orbit maintenance in cislunar space, both under uncertainties due to navigation error from Kalman filter, execution error via Gates model, and imperfect force models.

math.OC↗

Smooth Indirect Solution Method for State-constrained Optimal Control Problems with Nonlinear Control-affine Systems

This paper proposes a new indirect solution method for solving state-constrained optimal control problems by revisiting the well-established optimal control theory and addressing the long-standing issue of discontinuous control and costate due to pure state inequality constraints. It is well-known that imposing pure state path constraints in optimal control problems introduces discontinuities in the control and costate, rendering the classical indirect solution methods ineffective to numerically solve state-constrained problems. This study re-examines the necessary conditions of optimality for a class of state-constrained optimal control problems, and shows the uniqueness of the optimal control input that minimizes the Hamiltonian on constrained arcs. This analysis leads to a unifying form of optimality necessary conditions and thereby address the issue of discontinuities in control and costate by modeling them via smooth functions, transforming the originally discontinuous problems to smooth two-point boundary value problems (TPBVPs), which can be readily solved by existing nonlinear root-finding algorithms. The proposed solution method is shown to have favorable properties, including its anytime algorithm-like property, which is often a desirable property for safety-critical applications, and numerically demonstrated by an optimal orbital transfer problem.

math.OC↗