Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.659
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.
Yingqiu Xu, Qingfa Meng, Yingzi Tan, "Entropy-Based Victim Search in RoboCup Rescue Agent Simulation", Computer Science and Information Engineering, World Congress on, vol. 04, no. , pp. 692-696, 2009, doi:10.1109/CSIE.2009.659