Reachable Sets for Tracking

Peter J. Wong and Andrew J. Korsak
Additional contact information
Peter J. Wong: Stanford Research Institute, Menlo Park, California
Andrew J. Korsak: Stanford Research Institute, Menlo Park, California

Operations Research, 1974, vol. 22, issue 3, 497-509

Abstract: 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.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.3.497 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:22:y:1974:i:3:p:497-509

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().