By Topic

Path planning for cooperative time-optimal information collection

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

3 Author(s)
Andrew T. Klesh ; Aerospace Engineering, University of Michigan, 1320 Beal Ave, Ann Arbor, USA ; Pierre T. Kabamba ; Anouck R. Girard

Motivated by cooperative exploration missions, this paper considers constant velocity, level flight path planning for Unmanned Air Vehicles (UAVs) equipped with range limited, omni-directional sensors. These active energy-based sensors collect information about objects of interest at rates that depend on the range to the objects according to Shannon's channel capacity equation, where the signal-to-noise ratio is governed by the radar equation. The mission of the UAVs is to travel through a given area and collect a specified amount of information about each object of interest while minimizing the total mission time. This information can then be used to classify the objects of interest. An optimal path planning problem is formulated where the states are the Cartesian coordinates of the UAVs and the amounts of information collected about each object of interest, the control inputs are the UAV heading angles, the objective function is the total mission time, and the boundary conditions are subject to inequality constraints that reflect the requirements of information collection. Necessary conditions for optimality are given, whose solutions yield extremal paths, and whose utilization highlights analytical properties of these extremal paths. The problem exhibits several limiting regimes, including the so-called Watchtower and the Multi-Vehicle Traveling Salesman Problem. These results are illustrated on several time-optimal cooperative exploration scenarios.

Published in:

2008 American Control Conference

Date of Conference:

11-13 June 2008