Bienkowski Interference Identification.pdf (534.01 kB)
Interference Identification for Time-Varying Polyhedra
Identification of when and where moving areas intersect is an important problem in maritime operations and air traffic control. This problem can become particularly complicated when considering large numbers of objects, and when taking into account the curvature of the earth. In this paper, we present an approach to conflict identification as a series of stages where the earlier stages are fast, but may result in a false detection of a conflict. These early stages are used to reduce the number of potential conflict pairs for the later stages, which are slower, but more precise. The stages use R-trees, polygon intersection, linear projection and nonlinear programming. Our approach is generally applicable to objects moving in piece-wise straight lines on a 2D plane, and we present a specific case where the Mercator Projection is used to transform objects moving along rhumb lines on the earth into straight lines to fit in our approach. We present several examples to demonstrate our methods, as well as to quantify the empirical time complexity by using randomly generated areas.
Funding
N00014-18-1-1238
N00014-21-1-2187
N00173-16-1- G905
History
Email Address of Submitting Author
adam.bienkowski@uconn.eduORCID of Submitting Author
0000-0002-4738-8749Submitting Author's Institution
University of ConnecticutSubmitting Author's Country
- United States of America