Fast Marching and Fast Sweeping are the two most commonly used methods for solving the
eikonal equation. Each of these methods performs best on a different set of problems. Fast …

The task of constructing higher-dimensional invariant manifolds for dynamical systems can
be computationally expensive. We demonstrate that this problem can be locally reduced to …

In sampled data systems the controller receives periodically sampled state feedback about
the evolution of a continuous time plant, and must choose a constant control signal to apply …

Stochastic shortest path (SSP) problems arise in a variety of discrete stochastic control
contexts. An optimal solution to such a problem is typically computed using the value …

We consider two different non-autonomous anisotropic time-optimal control problems. For
the min-time-from-boundary problem, we show that the value function is recovered as a …

In sampled data systems the controller receives periodically sampled state feedback about
the evolution of a continuous time plant, and must choose a constant control signal to apply …

Abstract A general Hybrid Minimum Principle (HMP) for hybrid optimal control problems
(HOCPs) is presented in [1, 2, 3, 4] and in [4, 5], a class of efficient, provably convergent …

This work describes the development of a network-centric unmanned aircraft system (UAS)
for in situ sampling of supercell thunderstorms. UAS have been identified as a well-suited …

This paper explores a new risk-hedged approach for re-routing air traffic around forecast
convective weather. In this work, flying through a more likely weather instantiation is …

A class of problems in air traffic management (ATM) asks for a scheduling algorithm that
supplies the air traffic services authority not only with a schedule of arrivals and departures …