Reachable Sets for Tracking

Published Online:https://doi.org/10.1287/opre.22.3.497

In many aircraft-tracking systems the following problem is of importance in correlating radar returns with tracks: Given the aircraft position and velocity at time t − Δt and the limits on the ability of the aircraft to maneuver and/or change speed, what is the set of all possible aircraft positions at time t? We call this set the reachable set (or set of attainability) at time t. This paper uses the Pontryagin maximum principle to derive a set of equations for describing the reachable set.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.