不確実性下の宇宙機自律制御のためのチャンス制約付き凸計画法
Chance-Constrained Control for Safe Spacecraft Autonomy: Convex Programming Approach
ナビゲーション誤差や実行誤差などの不確実性下で、指定した信頼水準で安全性を保証する宇宙機の経路計画を、チャンス制約付き凸計画問題として定式化し効率的に解く手法を提案した。
著者: Kenshiro Oguri
分類: math.OC, cs.RO, cs.SY, eess.SY
原文アブストラクト
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.
