Cart (Loading....) | Create Account
Close category search window
 

Probability map partitioning for multi-player pursuit-evasion game

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)
Dong Jun Kwak ; Sch. of Mech. & Aerosp. Eng., Seoul Nat. Univ., Seoul, South Korea ; Kim, H.J.

In this paper, we consider a probabilistic pursuit-evasion game, in which a team of pursuers try to capture multiple evaders in a 2-D environment. We apply map partition and assignment algorithm to overcome the concentration of agents caused by global-max pursuit policy. To this effect, k-Means clustering is employed. From the simulation results, we analyze the characteristics of the proposed algorithm.

Published in:

Control Automation and Systems (ICCAS), 2010 International Conference on

Date of Conference:

27-30 Oct. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.