Using auction-based task allocation scheme for simulation optimization of search and rescue in disaster relief |
| |
| Affiliation: | 1. School of Marine Engineering, Northwestern Polytechnical University, 127 Youyixi Road, Xi’an 710072, Shaanxi, China;2. National Key Laboratory of Underwater Information Process and Control, 127 Youyixi Road, Xi’an 710072, Shaanxi, China;1. School of Computing and Information Technology, University of Wollongong, Australia;2. School of Computer and Mathematical Sciences, Auckland University of Technology, New Zealand;1. School of Robotics, Hunan University, Changsha 410082, China;2. School of Information Science and Engineering, Lanzhou University, Lanzhou, 730000 China;3. Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;4. Department of Computer Science and Engineering, University of Nevada, Reno, NV, 89557, USA;5. School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore;1. Computer Science Department, King Saud University, Riyadh, Saudi Arabia;2. Aeronautics and Astronautics Department, Massachusetts Institute of Technology (MIT), Cambridge, MA, United States;3. Computer Science Department, Al Imam Muhammad Ibn Saud Islamic University, Riyadh, Saudi Arabia;4. Decision Support Centre, King Abdulaziz City for Science and Technology, Riyadh, Saudi Arabia |
| |
| Abstract: | In order to improve the efficiency of search and rescue (SAR) in disaster relief, we optimize the SAR through agent-based simulation in this paper. The Truncated Lévy walks model is adopted to simulate rescuers’ search behaviors, and we improve it to fit the disaster environment. An auction-based task allocation scheme is used to develop a cooperative rescue plan. To verify the effectiveness of the proposed scheme, we illustrate it with the case of landslide disaster relief, and simulate it in three scenarios ("fatal", "serious" and "normal"). We compare it with non-cooperative rescue plan and the rescue plan based on well-known F-Max-Sum. The simulation results indicate that the cooperative rescue plan could improve the rescue efficiency significantly, and it performs somewhat better than the F-Max-Sum-based approach in regard to some indicators. Furthermore, its low complexity has made it more appropriate for the cooperation among rescue teams than F-Max-Sum. The robustness analysis shows that search radius can affect the rescue efficiency significantly, while the scope of cooperation has little effect on the rescue efficiency. The sensitivity analysis shows that the two parameters, the time limit for completing rescue operations in one buried site and the maximum turning angle for next step, both have great influence on rescue efficiency, and there exist optimal value for both of them in view of rescue efficiency. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
