Translator Disclaimer
17 May 2006 A rollout algorithm to coordinate multiple sensor resources to track and discriminate targets
Author Affiliations +
This paper presents a novel, scalable optimization approach to coordinating multiple sensor resources to track and discriminate targets. The sensor resource management problem is one of allocating sensors on a time scale of seconds in a closed loop that includes a target tracker and discrimination system. Allocations specify how the sensors should be pointed and the modes in which they should operate. The objective is to optimize the collection of data to meet tracking and discrimination goals. Quality of the data collected will be different for different allocations, in part, because the quality of the data collected on a target by a sensor depends on the relative geometry between the sensor and target. The optimization of the data collection is to be done subject to constraints on sensors' fields of view as well as time required to slew a sensor into position, if it has mechanical gimbals, and to collect data in the selected mode. The problem is challenging because of the large number of possible sensor allocations as well as the complex dynamics. For this problem, we have developed a novel, approximate dynamic programming algorithm, a type of rollout algorithm, to optimize sensor allocations to coordinate multiple sensor resources. The approach is scalable to realistically sized problems. The paper overviews the approach and results from applying the algorithm.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Michael K. Schneider and Chee Chong "A rollout algorithm to coordinate multiple sensor resources to track and discriminate targets", Proc. SPIE 6235, Signal Processing, Sensor Fusion, and Target Recognition XV, 62350E (17 May 2006);

Back to Top