The Community for Technology Leaders
Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
ISBN: 978-0-7695-3507-4
pp: 692-696
ABSTRACT
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.
INDEX TERMS
CITATION

Y. Xu, Q. Meng and Y. Tan, "Entropy-Based Victim Search in RoboCup Rescue Agent Simulation," 2009 WRI World Congress on Computer Science and Information Engineering, CSIE(CSIE), Los Angeles, CA, 2009, pp. 692-696.
doi:10.1109/CSIE.2009.659
84 ms
(Ver 3.3 (11022016))