Almost-Optimal Sensor Tasking using Auction Methods

摘要

The problem for efficient use of radar assets for space surveillance is unsolved. Partial solutions have been developed, such as covariance based tasking algorithms, but not all operational requirements for tracking support are quantified by accuracy, for example monitoring a non-cooperative maneuvering satellite for purposes of conjunction assessment. The following effort exposes a different approach, where competing requirements, each with quite different metrics, can compete for sensor resources and an efficient decision making process will provide for economic use of radar resources and thereby allowing greater use of the radar sites for other missions. The Auction we employ here is somewhat naive, as compared to sophisticated methods employed by domain experts, and yet provides evidence that the method can be quite useful for making assignments where competing requirements can stress the tracking systems.