Related papers: Time-Optimal Guidance for Intercepting Moving Targ…
We present a novel guidance law that uses observations consisting solely of seeker line of sight angle measurements and their rate of change. The policy is optimized using reinforcement meta-learning and demonstrated in a simulated terminal…
In this paper we consider an optimal control problem in large time horizon and solve it numerically. More precisely, we are interested in an aerial vehicle guidance problem: launched from a ground platform, the vehicle aims at reaching a…
In path-following methods for conic programming knowledge of the performance of the (damped) Newton method at finite distances from the minimizer of a self-concordant function is crucial for the tuning of the parameters of the method. The…
We study the tracking of a trajectory for a nonholonomic system by recasting the problem as a constrained optimal control problem. The cost function is chosen to minimize the error in positions and velocities between the trajectory of a…
We devise a polynomial-time approximation scheme for the classical geometric problem of finding an approximate short path amid weighted regions. In this problem, a triangulated region P comprising of n vertices, a positive weight associated…
This work proposes a cooperative strategy that employs deviated pursuit guidance to simultaneously intercept a moving (but not manoeuvring) target. As opposed to many existing cooperative guidance strategies which use estimates of…
This paper presents an input-constrained nonlinear guidance law to address the problem of intercepting a stationary target in contested environments with multiple defending agents. Contrary to prior approaches that rely on explicit…
Given a geometric domain $P$, visibility-based search problems seek routes for one or more mobile agents ("watchmen") to move within $P$ in order to be able to see a portion (or all) of $P$, while optimizing objectives, such as the…
This paper proposes a feedback guidance law to move the instantaneous impact point (IIP) of a rocket to a desired location. Analytic expressions relating the time derivatives of an IIP with the external acceleration of the rocket are…
In this paper we present a first-order method that admits near-optimal convergence rates for convex/concave min-max problems while requiring a simple and intuitive analysis. Similarly to the seminal work of Nemirovski and the recent…
This paper tackles the multi-objective optimization of the cost functional of a path-following model predictive control for vehicle longitudinal and lateral control. While the inherent optimal character of the model predictive control and…
In this paper, we consider a trajectory planning problem arising from a lunar vertical landing with minimum fuel consumption. The vertical landing requirement is written as a final steering angle constraint, and a nonnegative regularization…
Safety filters provide a practical approach for enforcing safety constraints in autonomous systems. While learning-based tools scale to high-dimensional systems, their performance depends on informative data that includes states likely to…
In this paper, we address a minimum-time steering problem for a drone modeled as point mass with bounded acceleration, across a set of desired waypoints in the presence of gravity. We first provide a method to solve for the minimum-time…
This paper is based on a crucial issue in the aviation world: how to optimize the trajectory and controls given to the aircraft in order to optimize flight time and fuel consumption. This study aims to provide elements of a response to this…
In this paper, we present a framework for solving continuous optimal control problems when the true system dynamics are approximated through an imperfect model. We derive a control strategy by applying Pontryagin's Minimum Principle to the…
This paper proposes a guidance strategy to achieve time-constrained interception of stationary targets, taking into account both the bounded field-of-view (FOV) of seeker-equipped interceptors and the actuator's physical constraints.…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
In this paper, we focus on a method based on optimal control to address the optimization problem. The objective is to find the optimal solution that minimizes the objective function. We transform the optimization problem into optimal…
In this paper, we develop an interior-point method for solving a class of convex optimization problems with time-varying objective and constraint functions. Using log-barrier penalty functions, we propose a continuous-time dynamical system…