By Topic

Path planning for optimal classification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
M. Faied ; Department of Aerospace Engineering, University of Michigan, Ann Arbor, 48109, USA ; P. Kabamba ; B. Hyun ; A. Girard

As stated in the Office of the Secretary of Defense's Unmanned Aircraft Systems Roadmap 2005-2030, reconnaissance is the number one priority mission for Unmanned Air Vehicles (UAVs) of all sizes. During reconnaissance missions, classification of objects of interest (e.g, as friend or foe) is key to mission performance. Classification is based on information collection, and it has generally been assumed that the more information collected, the better the classification decision. Although this is a correct general trend, a recent study has shown it does not hold in all cases. This paper focuses on presenting methods to plan paths for unmanned vehicles that optimize classification decisions (as opposed to the amount of information collected). We consider an unmanned vehicle (agent) classifying an object of interest in a given area. The agent plans its path to collect the information most relevant to optimizing its classification performance, based on the maximum likelihood ratio. In addition, a classification performance measure for multiple measurements is analytically derived.

Published in:

2012 IEEE 51st IEEE Conference on Decision and Control (CDC)

Date of Conference:

10-13 Dec. 2012