arXiv subjects

Avishai Weiss

Publications and source records attributed to Avishai Weiss.

11 recordsLinked to original sources

arXiv2026

Optimization-Based Formation Flight on Libration Point Orbits

A model predictive control (MPC) framework is developed for station-keeping in spacecraft formation flight along libration point orbits. At each control period, the MPC policy solves a multi-vehicle optimal control problem (MVOCP) that tracks a reference trajectory, while enforcing path constraints on the relative motion of the formation. The control policy makes use of a limited set of control nodes consistent with operational constraints that allow only a small number of maneuver opportunities per revolution. To promote recursive feasibility, path constraints are progressively tightened across the prediction horizon. An isoperimetric reformulation of the constraints is used to prevent inter-sample violations. The resulting MVOCP is a nonconvex program, which is solved via sequential convex programming. The proposed approach is evaluated in a high-fidelity ephemeris model under realistic uncertainties for a formation along the near-rectilinear halo orbit (NRHO), and subject to path constraints on interspacecraft separation and relative Sun phase angle. The results demonstrate maintenance of a spacecraft formation that satisfies the path constraints with cumulative propellant consumption comparable to that of existing methods

eess.SY↗

arXiv2025

Set-based Optimal, Robust, and Resilient Control with Applications to Autonomous Precision Landing

We present a real-time-capable set-based framework for closed-loop predictive control of autonomous systems using tools from computational geometry, dynamic programming, and convex optimization. The control architecture relies on the offline precomputation of the controllable tube, i.e, a time-indexed sequence of controllable sets. Sets are represented using constrained zonotopes (CZs), which are efficient encodings of convex polytopes that support fast set operations and enable tractable dynamic programming in high dimensions. Online, we obtain a globally optimal control profile by solving a series of one-step optimal control problems. Our key contributions are: (1) free-final-time optimality: we devise an optimal horizon computation algorithm to achieve global optimality; (2) robustness: we handle stochastic uncertainty in both the state and control, with probabilistic guarantees, by constructing bounded disturbance sets; (3) resilience: we develop (i) an optimization-free approach to computing the instantaneous reachable set, i.e., the reachable set from the current state, to enable, for example, large/maximal divert maneuvers, and (ii) an approach to achieving maximal decision-deferral, i.e., maintaining reachability/divert-feasibility to multiple targets for as long as possible. By means of an autonomous precision landing case study, we demonstrate globally optimal free-final-time guidance, robustness to navigation and actuation uncertainties, instantaneous divert envelope computation, and maximal decision-deferral.

math.OC↗

arXiv2025

Autonomous Navigation and Station-Keeping on Near-Rectilinear Halo Orbits

This article develops an optical navigation (OPNAV) and station-keeping pipeline for the near-rectilinear halo orbit (NRHO) in high-fidelity ephemeris model dynamics, using synthetic images of the Moon in a non-iterative horizon-based OPNAV algorithm, applying the result in a navigation filter, and using the obtained estimates in a station-keeping control scheme that keeps the spacecraft in the vicinity of a reference orbit. We study differential correction-based and minimization-based implementations of the so-called x-axis and propose an improved targeting prediction scheme by incorporating the filter's state covariance with an unscented transform. We also introduce a hysteresis mechanism, which improves stationkeeping cost and provides insight into the difference in performance between the differential correction-based and minimization-based approaches. We perform Monte-Carlo experiments to assess the pipeline's tracking and Delta-V performances. We report several key findings, including the variability of the filter performance with the sensor field of view and measurement locations, station-keeping cost reduction achieved by the unscented transform-based prediction and hysteresis, as well as the variability of the cumulative Delta-V as a function of maneuver location due to the periodic structure in the OPNAV-based filter's estimation accuracy.

eess.SY↗

arXiv2025

Multi-Vehicle Guidance for Formation Flight on Libration Point Orbits

The multiple spacecraft guidance problem for proximity flight in libration point orbit is considered. A nonlinear optimal control problem with continuous-time path constraints enforcing minimum separation between each spacecraft is formulated. The path constraints are enforced via an isoperimetric reformulation, and the problem is solved via a sequential convex programming. The proposed approach does not necessitate specific dynamic system structures to provide continuous-time guarantees for minimum separation within a fuel-optimal solution. The optimal control problem is deployed within a model predictive control scheme and demonstrated in the ephemeris model dynamics.

math.OC↗

arXiv2025

Successive Convexification for Passively-Safe Spacecraft Rendezvous on Near Rectilinear Halo Orbit

We present an optimization-based approach for fuel-efficient spacecraft rendezvous to the Gateway, a space station that will be deployed on a near rectilinear halo orbit (NRHO) around the Moon. The approach: i) ensures passive safety and satisfies path constraints at all times, ii) meets the specifications for critical decision points along the trajectory, iii) accounts for uncertainties that are common in real-world operation, such as due to orbital insertion, actuation, and navigation measurement, via chance constraints and utilizes a stabilizing feedback controller to bound the effect of uncertainties. We leverage sequential convex programming (SCP) and isoperimetric reformulation of path constraints, including passive safety, to eliminate the risk of inter-sample constraint violations that is common in existing methods. We demonstrate the proposed approach on a realistic simulation of a rendezvous to the Gateway.

math.OC↗

arXiv2025

A Comparative Study of MINLP and MPVC Formulations for Solving Complex Nonlinear Decision-Making Problems in Aerospace Applications

High-level decision-making for dynamical systems often involves performance and safety specifications that are activated or deactivated depending on conditions related to the system state and commands. Such decision-making problems can be naturally formulated as optimization problems where these conditional activations are regulated by discrete variables. However, solving these problems can be challenging numerically, even on powerful computing platforms, especially when the dynamics are nonlinear. In this work, we consider decision-making for nonlinear systems where certain constraints, as well as possible terms in the cost function, are activated or deactivated depending on the system state and commands. We show that these problems can be formulated either as mixed-integer nonlinear programs (MINLPs) or as mathematical programs with vanishing constraints (MPVCs), where the former formulation involves discrete decision variables, whereas the latter relies on continuous variables subject to structured nonconvex constraints. We discuss the different solution methods available for both formulations and demonstrate them on optimal trajectory planning problems in various aerospace applications. Finally, we compare the strengths and weaknesses of the MINLP and MPVC approaches through a focused case study on powered descent guidance with divert-feasible regions.

math.OC↗

arXiv2025

Revolution-Spaced Output-Feedback Model Predictive Control for Station Keeping on Near-Rectilinear Halo Orbits

We develop a model predictive control (MPC) policy for station keeping on a Near-Rectilinear Halo Orbit (NRHO). The proposed policy achieves full-state tracking of a reference NRHO via a multiple-maneuver control horizon, each spaced one revolution apart to abide by typical mission operation requirements. We prove that the proposed policy is recursively feasible, and perform numerical evaluation in an output-feedback setting by incorporating a navigation filter and realistic operational uncertainties, where the proposed MPC is compared against the state-of-the-art station-keeping algorithm adopted for the Gateway. Our approach successfully maintains the spacecraft in the vicinity of the reference NRHO at a similar cumulative cost as existing station-keeping methods without encountering phase deviation issues, a common drawback of existing methods with one maneuver per revolution.

eess.SY↗

arXiv2024

Autonomous Station Keeping of Satellites in Areostationary Mars Orbit: A Predictive Control Approach

The continued exploration of Mars will require a greater number of in-space assets to aid interplanetary communications. Future missions to the surface of Mars may be augmented with stationary satellites that remain overhead at all times as a means of sending data back to Earth from fixed antennae on the surface. These areostationary satellites will experience several important disturbances that push and pull the spacecraft off of its desired orbit. Thus, a station-keeping control strategy must be put into place to ensure the satellite remains overhead while minimizing the fuel required to elongate mission lifetime. This paper develops a model predictive control policy for areostationary station keeping that exploits knowledge of non-Keplerian perturbations in order to minimize the required annual station-keeping $\Delta v$. The station-keeping policy is applied to a satellite placed at various longitudes, and simulations are performed for an example mission at a longitude of a potential future crewed landing site. Through careful tuning of the controller constraints, and proper placement of the satellite at stable longitudes, the annual station-keeping $\Delta v$ can be reduced relative to a naive mission design.

physics.space-ph↗

arXiv2024

Projection-free computation of robust controllable sets with constrained zonotopes

We study the problem of computing robust controllable sets for discrete-time linear systems with additive uncertainty. We propose a tractable and scalable approach to inner- and outer-approximate robust controllable sets using constrained zonotopes, when the additive uncertainty set is a symmetric, convex, and compact set. Our least-squares-based approach uses novel closed-form approximations of the Pontryagin difference between a constrained zonotopic minuend and a symmetric, convex, and compact subtrahend. Unlike existing approaches, our approach does not rely on convex optimization solvers, and is projection-free for ellipsoidal and zonotopic uncertainty sets. We also propose a least-squares-based approach to compute a convex, polyhedral outer-approximation to constrained zonotopes, and characterize sufficient conditions under which all these approximations are exact. We demonstrate the computational efficiency and scalability of our approach in several case studies, including the design of abort-safe rendezvous trajectories for a spacecraft in near-rectilinear halo orbit under uncertainty. Our approach can inner-approximate a 20-step robust controllable set for a 100-dimensional linear system in under 15 seconds on a standard computer.

math.OC↗

arXiv2017

Path Planning using Positive Invariant Sets

We present an algorithm for steering the output of a linear system from a feasible initial condition to a desired target position, while satisfying input constraints and non-convex output constraints. The system input is generated by a collection of local linear state-feedback controllers. The path-planning algorithm selects the appropriate local controller using a graph search, where the nodes of the graph are the local controllers and the edges of the graph indicate when it is possible to transition from one local controller to another without violating input or output constraints. We present two methods for computing the local controllers. The first uses a fixed-gain controller and scales its positive invariant set to satisfy the input and output constraints. We provide a linear program for determining the scale-factor and a condition for when the linear program has a closed-form solution. The second method designs the local controllers using a semi-definite program that maximizes the volume of the positive invariant set that satisfies state and input constraints. We demonstrate our path-planning algorithm on docking of a spacecraft. The semi-definite programming based control design has better performance but requires more computation.

eess.SY↗

arXiv2014

Extremum Seeking-based Iterative Learning Linear MPC

In this work we study the problem of adaptive MPC for linear time-invariant uncertain models. We assume linear models with parametric uncertainties, and propose an iterative multi-variable extremum seeking (MES)-based learning MPC algorithm to learn on-line the uncertain parameters and update the MPC model. We show the effectiveness of this algorithm on a DC servo motor control example.

eess.SY↗