SearcharxivSearch

arXiv subjects

Christopher Petersen

Publications and source records attributed to Christopher Petersen.

9 recordsLinked to original sources

Information-Aware Model Predictive Control for Satellite Inspection

Autonomous spacecraft inspection requires trajectories that satisfy safety and control constraints while enabling the collection of informative measurements about a target spacecraft. Traditional guidance and control methods typically decouple estimation from control, resulting in trajectories that do not explicitly optimize sensing geometry. This work presents a model predictive control (MPC) framework that incorporates estimation covariance in the control objective using a formulation inspired by dual control and covariance steering. The estimation covariance evolves according to a linear Kalman filter, and the measurement model depends on the relative geometry between the agent spacecraft and the target. By embedding the covariance dynamics within the MPC problem, the resulting trajectories account for measurement quality, actively reduce uncertainty, and improve observability in the estimated features of the target. The problem is formulated using relative motion dynamics via the Hill-Clohessy-Wiltshire equations with constraints on control input, relative distance, and terminal maximum covariance. Numerical simulations demonstrate that the proposed framework generates feasible inspection trajectories that actively reduce estimation covariance of points of interest on a target while satisfying input and safety constraints of the agent. A mesh analysis of initial conditions further illustrates how feasibility and the value function of the trajectory depend on the initial conditions and constraint activity.

eess.SY

Uniting Iteration Limits for Mixed-Integer Quadratic MPC

Iteration limited model predictive control (MPC) can stabilize a feedback control system under sufficient conditions; this work explores combining a low iteration limit MPC with a high iteration limit MPC for mixed-integer quadratic programs (MIQPs) where the suboptimality is due to solver iteration limits. To combine the two MPCs a hybrid systems controller is developed that ``unites'' two MIQP-MPC solvers where the iteration limits of interest are the branch-and-bound and quadratic programming iteration limits. Asymptotic stability and robustness of the hybrid feedback control system are theoretically derived. Then an interpretable branch-and-bound algorithm and implementable uniting controller algorithm are developed. Finally, the developed algorithms and varying iteration limits are empirically evaluated in simulation for the switching thruster and minimum thrust spacecraft rendezvous problems.

math.OC

Comparison of Forced and Unforced Rendezvous, Proximity Operations, and Docking Under Model Mismatch

This paper compares the required fuel usage for forced and unforced motion of a chaser satellite engaged in Rendezvous, Proximity Operations, and Docking (RPOD) maneuvers. Improved RPOD models are vital, particularly as the space industry expands and demands for improved fuel efficiency, cost effectiveness, and mission life span increase. This paper specifically examines the Clohessy- Wiltshire (CW) Equations and the extent of model mismatch by comparing pre- dicted trajectories from this model with a more computationally complex, higher fidelity RPOD model. This paper assesses several test cases of similar mission parameters, in each case comparing natural motion circumnavigation (NMC) with comparable forced motion circumnavigation. The Guidance, Navigation, and Con- trol (GNC) impulse maneuvers required to maintain the supposedly zero fuel CW trajectories is representative of the extent of CW model mismatch. This paper demonstrates that unforced motions are not inherently more fuel efficient than forced motions, thus permitting extended orbital operations given the higher fuel efficiency.

eess.SY

Development of a Linear Guide-Rail Testbed for Physically Emulating ISAM Operations

In-Space Servicing, Assembly, and Manufacturing (ISAM) is a set of emerging operations that provides several benefits to improve the longevity, capacity, mo- bility, and expandability of existing and future space assets. Serial robotic ma- nipulators are particularly vital in accomplishing ISAM operations, however, the complex perturbation forces and motions associated with movement of a robotic arm on a free-flying satellite presents a complex controls problem requiring addi- tional study. While many dynamical models are developed, experimentally test- ing and validating these models is challenging given that the models operate in space, where satellites have six-degrees-of-freedom (6-DOF). This paper attempts to resolve those challenges by presenting the design and development of a new hardware-in-the-loop (HIL) experimental testbed utilized to emulate ISAM. This emulation will be accomplished by means of a 6-DOF UR3e robotic arm attached to a satellite bus. This satellite bus is mounted to a 1-DOF guide-rail system, en- abling the satellite bus and robotic arm to move freely in one linear direction. This experimental ISAM emulation system will explore and validate models for space motion, serial robot manipulation, and contact mechanics.

cs.RO

A Hybrid Perspective on Suboptimal Mixed-Integer Quadratic Programming

This work solves suboptimal mixed-integer quadratic programs recursively for feedback control of dynamical systems. The proposed framework leverages parametric mixed-integer quadratic programming (MIQP) and hybrid systems theory to model a recursive MIQP feedback controller and a feedback controlled dynamical system. The proposed hybrid framework theoretically encodes the suboptimal part via solver parameters as bounded perturbations from the optimal solution set. The stability of the proposed hybrid framework is theoretically guaranteed and validated through MIQP model predictive control simulations with multiple solver parameters.

math.OC

Distributed Asynchronous Mixed-Integer Linear Programming with Feasibility Guarantees

In this paper we solve mixed-integer linear programs (MILPs) via distributed asynchronous saddle point computation. This work is motivated by the MILPs being able to model problems in multi-agent autonomy, such as task assignment problems and trajectory planning with collision avoidance constraints in multi-robot systems. To solve a MILP, we relax it with a linear program approximation. We first show that if the linear program relaxation satisfies Slater's condition, then relaxing the problem, solving it, and rounding the relaxed solution produces a point that is guaranteed to satisfy the constraints of the original MILP. Next, we form a Lagrangian saddle point problem that is equivalent to the linear program relaxation, and then we regularize the Lagrangian in both the primal and dual spaces. Doing so gives a regularized Lagrangian that is strongly convex-strongly concave. We then develop a parallelized algorithm to compute saddle points of the regularized Lagrangian, and we show that it is tolerant to asynchrony in the computations and communications of primal and dual variables. Suboptimality bounds and convergence rates are presented for convergence to a saddle point. The suboptimality bound accounts for (i) the error induced by regularizing the Lagrangian and (ii) the suboptimality gap between the solution to the original MILP and the solution to its relaxed form. Simulation results illustrate these theoretical developments in practice, and show that relaxation and regularization combined typically have only a mild impact on the suboptimality of the solution obtained.

math.OC

Attitude Trajectory Optimization and Momentum Conservation with Control Moment Gyroscopes

In this work, we develop a numerically tractable trajectory optimization problem for rest-to-rest attitude transfers with CMG-driven spacecraft. First, we adapt a specialized dynamical model which avoids many of the numerical challenges (singularities) introduced by common dynamical approximations. To formulate and solve our specialized trajectory optimization problem, we design a locally stabilizing Linear Quadratic (LQ) regulator on the system's configuration manifold then lift it into the ambient state space to produce suitable terminal and running LQ cost functionals. Finally, we examine the performance benefits and drawbacks of solutions to this optimization problem via the PRONTO solver and find significant improvements in maneuver time, terminal state accuracy, and total control effort. This analysis also highlights a critical shortcoming for objective functions which penalize only the norm of the control input rather than electrical power usage.

math.OC

Approximate Stochastic Optimal Control for Linear Time Invariant Systems with Heavy-tailed Disturbances

We propose an open loop control scheme for linear time invariant systems perturbed by multivariate $t$ disturbances through the use of quantile reformulations. The multivariate $t$ disturbance is motivated by heavy tailed phenomena that arise in multi-vehicle planning planning problems through unmodeled perturbation forces, linearization effects, or faulty actuators. Our approach relies on convex quantile reformulations of the polytopic target sets and norm based collision avoidance constraints to enable fast computation. We embed quantile approximations of the Student's $t$ distribution and the beta prime distribution in a difference-of-convex function framework to compute provably safe but likely suboptimal controllers. We demonstrate our method with three satellite rendezvous examples and provide a comparison with particle control.

eess.SY

Approximate Quantiles for Stochastic Optimal Control of LTI Systems with Arbitrary Disturbances

We propose a method for open-loop stochastic optimal control of LTI systems based on Taylor approximations of quantile functions. This approach enables efficient computation of quantile functions that arise in chance constrained reformulations. We are motivated by multi-vehicle planning problems for LTI systems with norm-based collision avoidance constraints, and polytopic feasibility constraints. Respectively, these constraints can be posed as reverse-convex and convex chance constraints that are affine in the control and disturbance. We show for constraints of this form, piecewise affine approximations of the quantile function can be embedded in a difference-of-convex program that enables use of conic solvers. We demonstrate our method for multi-satellite coordination with Gaussian and Cauchy disturbances, and provide a comparison with particle control.

math.OC