Suitable rescue path selection is very important to rescue lives and reduce the loss of disasters, and has been a key issue in the field of disaster response management. In this paper, we present a path selection algo...Suitable rescue path selection is very important to rescue lives and reduce the loss of disasters, and has been a key issue in the field of disaster response management. In this paper, we present a path selection algorithm based on Q-learning for disaster response applications. We assume that a rescue team is an agent, which is operating in a dynamic and dangerous environment and needs to find a safe and short path in the least time. We first propose a path selection model for disaster response management, and deduce that path selection based on our model is a Markov decision process. Then, we introduce Q-learning and design strategies for action selection and to avoid cyclic path. Finally, experimental results show that our algorithm can find a safe and short path in the dynamic and dangerous environment, which can provide a specific and significant reference for practical management in disaster response applications.展开更多
Coalitional skill games (CSGs) are a simple model of cooperation in an uncertain environment where each agent has a set of skills that are required to accomplish a variety of tasks and each task requires a set of sk...Coalitional skill games (CSGs) are a simple model of cooperation in an uncertain environment where each agent has a set of skills that are required to accomplish a variety of tasks and each task requires a set of skills to be completed, but each skill is very hard to be quantified and can only be qualitatively expressed. Thus far, many computational questions surrounding CSGs have been studied. However, to the best of our knowledge, the coalition structure generation problem (CSGP), as a central issue of CSGs, is extremely challenging and has not been well solved. To this end, two different computational intelligence algorithms are herein evaluated: binary particle swarm optimization (BPSO) and binary differential evolution (BDE). In particular, we develop the two stochastic search algorithms with two-dimensional binary encoding and corresponding heuristic for individual repairs. After that, we discuss some fundamental properties of the proposed heuristic. Finally, we compare the improved BPSO and BDE with the state-of-the-art algorithms for solving CSGP in CSGs. The experimental results show that our algorithms can find the same near optimal solutions with the existing approaches but take extremely short time, especially under the large problem size.展开更多
基金supported by National Basic Research Program of China (973 Program) (No. 2009CB326203)National Natural Science Foundation of China (No. 61004103)+5 种基金the National Research Foundation for the Doctoral Program of Higher Education of China (No. 20100111110005)China Postdoctoral Science Foundation (No. 20090460742)National Engineering Research Center of Special Display Technology (No. 2008HGXJ0350)Natural Science Foundation of Anhui Province (No. 090412058, No. 070412035)Natural Science Foundation of Anhui Province of China (No. 11040606Q44, No. 090412058)Specialized Research Fund for Doctoral Scholars of Hefei University of Technology (No. GDBJ2009-003, No. GDBJ2009-067)
文摘Suitable rescue path selection is very important to rescue lives and reduce the loss of disasters, and has been a key issue in the field of disaster response management. In this paper, we present a path selection algorithm based on Q-learning for disaster response applications. We assume that a rescue team is an agent, which is operating in a dynamic and dangerous environment and needs to find a safe and short path in the least time. We first propose a path selection model for disaster response management, and deduce that path selection based on our model is a Markov decision process. Then, we introduce Q-learning and design strategies for action selection and to avoid cyclic path. Finally, experimental results show that our algorithm can find a safe and short path in the dynamic and dangerous environment, which can provide a specific and significant reference for practical management in disaster response applications.
基金This work was partially supported by the National Natural Science Foundation of China under Grant Nos. 61573125 and 61371155, and the Anhui Provincial Natural Science Foundation of China under Grant Nos. 1608085MF131, 1508085MF132, and 1508085QF129.
文摘Coalitional skill games (CSGs) are a simple model of cooperation in an uncertain environment where each agent has a set of skills that are required to accomplish a variety of tasks and each task requires a set of skills to be completed, but each skill is very hard to be quantified and can only be qualitatively expressed. Thus far, many computational questions surrounding CSGs have been studied. However, to the best of our knowledge, the coalition structure generation problem (CSGP), as a central issue of CSGs, is extremely challenging and has not been well solved. To this end, two different computational intelligence algorithms are herein evaluated: binary particle swarm optimization (BPSO) and binary differential evolution (BDE). In particular, we develop the two stochastic search algorithms with two-dimensional binary encoding and corresponding heuristic for individual repairs. After that, we discuss some fundamental properties of the proposed heuristic. Finally, we compare the improved BPSO and BDE with the state-of-the-art algorithms for solving CSGP in CSGs. The experimental results show that our algorithms can find the same near optimal solutions with the existing approaches but take extremely short time, especially under the large problem size.