By Topic

Optimal pursuer and moving target assignment using dynamic Voronoi diagrams

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
$31 $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

2 Author(s)
Bakolas, E. ; Sch. of Aerosp. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; Tsiotras, P.

We consider a Voronoi-like partitioning problem for a team of pursuers distributed in the plane. Each element of the partition is uniquely associated with a pursuer in the following sense: if a moving target at a given instant of time resides inside a particular member of the partition, then the pursuer associated with this set can intercept this moving target faster than any other pursuer. In our problem formulation, the moving target does not necessarily travel along prescribed trajectories, as it is typically assumed in the literature but, instead, it can apply an "evading" strategy in response to the actions of its pursuer. It is further assumed that the structure of the evading strategy of the target is only partially known to the pursuers. We characterize an approximate solution to this problem by associating it with a standard Voronoi partitioning problem. Simulation results are presented to highlight the theoretical developments.

Published in:

American Control Conference (ACC), 2011

Date of Conference:

June 29 2011-July 1 2011