By Topic

Entropy-Based Victim Search in RoboCup Rescue Agent Simulation

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)
Qingfa Meng ; Sch. of Mech. Eng., Southeast Univ., Nanjing, China ; Yingqiu Xu ; Yingzi Tan

Suddenly fall of unexpected disasters cause serious damage and casualties to our society. In order to minimize damage, search and rescue tasks should be carried out immediately after the disasters. This paper introduces an entropy based search model to RoboCup rescue agent simulation system which enables our search agents to find victims as early as possible. Key point of this proposed model lies in how to determine sequences of search targets from various candidate locations at each simulation step. Detailed illustration is then given to solve this key point using entropy based method. As for agent coordination, commonly used partition method is adopted to eliminate conflicts between agents. Simulation result validates this model when compared to random search and thus offers certain reference to real disaster emergencies.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:4 )

Date of Conference:

March 31 2009-April 2 2009