Approximate Dynamic Programming For Sensor Management

Approximate Dynamic Programming For Sensor Management (1997)

Cached

Download Links

[mdsp.bu.edu]

by David A. Castanon

Citations:

34 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Approximate Dynamic Programming For Sensor Management	user correction - Legacy Corrections
AUTHOR NAME	David A. Castanon	user correction - Legacy Corrections
AUTHOR AFFIL	Dept. Electrical & Computer Eng., Boston University; 8 St. Mary’s St., Boston	user correction - Legacy Corrections
AUTHOR ADDR	MA 02215	user correction - Legacy Corrections
ABSTRACT	This paper studies the problem of dynamic scheduling of multi-mode sensor resources for the problem of classification of multiple unknown objects. Because of the uncertain nature of the object types, the problem is formulated as a partially observed Markov decision problem with a large state space. The paper describes a hierarchical algorithm approach for e#cient solution of sensor scheduling problems with large numbers of objects, based on combination of stochastic dynamic programming and nondi#erentiable optimization techniques. The algorithm is illustrated with an application involving classification of 10,000 unknown objects. 1 Introduction Many modern avionics systems include multiple sensors as well as individual sensors capable of focusing on different objects with di#erent modes. In order to achieve an accurate possible representation of all objects of interest, it is important to coordinate the allocation and scheduling of the di#erent sensors and sensor modes across the di#...	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	1202--1207	INFERENCE
VOLUME	2	INFERENCE
CITATIONS	12 found	ParsCit 1.0