Interference Identification for Time-Varying Polyhedra

Abstract

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.