Task allocation strategies for cooperative task planning of multi-autonomous satellite constellation

2019 ◽  
Vol 63 (2) ◽  
pp. 1073-1084 ◽  
Author(s):  
Feng Yao ◽  
Jiting Li ◽  
Yuning Chen ◽  
Xiaogeng Chu ◽  
Bang Zhao
Author(s):  
Seenu N. ◽  
Kuppan Chetty R.M. ◽  
Ramya M.M. ◽  
Mukund Nilakantan Janardhanan

Purpose This paper aims to present a concise review on the variant state-of-the-art dynamic task allocation strategies. It presents a thorough discussion about the existing dynamic task allocation strategies mainly with respect to the problem application, constraints, objective functions and uncertainty handling methods. Design/methodology/approach This paper briefs the introduction of multi-robot dynamic task allocation problem and discloses the challenges that exist in real-world dynamic task allocation problems. Numerous task allocation strategies are discussed in this paper, and it establishes the characteristics features between them in a qualitative manner. This paper also exhibits the existing research gaps and conducive future research directions in dynamic task allocation for multiple mobile robot systems. Findings This paper concerns the objective functions, robustness, task allocation time, completion time, and task reallocation feature for performance analysis of different task allocation strategies. It prescribes suitable real-world applications for variant task allocation strategies and identifies the challenges to be resolved in multi-robot task allocation strategies. Originality/value This paper provides a comprehensive review of dynamic task allocation strategies and incites the salient research directions to the researchers in multi-robot dynamic task allocation problems. This paper aims to summarize the latest approaches in the application of exploration problems.


2013 ◽  
Vol 13 (1) ◽  
pp. 253-262 ◽  
Author(s):  
Hicham Hatime ◽  
Ravi Pendse ◽  
John M. Watkins

2020 ◽  
Author(s):  
Navid Hooshangi ◽  
Ali Asghar Alesheikh ◽  
Mahdi Panahi ◽  
Saro Lee

Abstract. Task allocation in uncertainty conditions is a key problem for agents attempting to achieve harmony in disaster environments. This paper presents an agent- based simulation to investigate tasks allocation through the consideration of appropriate spatial strategies to deal with uncertainty in urban search and rescue (USAR) operation. The proposed method is presented in five phases: ordering existing tasks, finding coordinating agent, holding an auction, applying allocation strategies, and implementation and observation of environmental uncertainties. The methodology was evaluated in Tehran's District 1 for 6.6, 6.9, and 7.2 magnitude earthquakes. The simulation started by calculating the number of injured individuals, which was 28856, 73195 and 111463 people for each earthquake, respectively. The Simulations were performed for each scenario for a variety of rescuers (1000, 1500, 2000 rescuer). In comparison with contract net protocol (CNP), the standard time of rescue operations in the proposed approach includes at least 13% of improvement and the best percentage of recovery was 21 %. Interval uncertainty analysis and the comparison of the proposed strategies showed that an increase in uncertainty leads to an increased rescue time for CNP of 67.7 hours, and for strategies one to four an increased rescue time of 63.4, 63.2, 63.7, and 56.5 hours, respectively. Considering strategies in the task allocation process, especially spatial strategies, resulted in the optimization and increased flexibility of the allocation as well as conditions for fault tolerance and agent-based cooperation stability in USAR simulation system.


2021 ◽  
Vol 21 (11) ◽  
pp. 3449-3463
Author(s):  
Navid Hooshangi ◽  
Ali Asghar Alesheikh ◽  
Mahdi Panahi ◽  
Saro Lee

Abstract. Task allocation under uncertain conditions is a key problem for agents attempting to achieve harmony in disaster environments. This paper presents an agent-based simulation to investigate task allocation considering appropriate spatial strategies to manage uncertainty in urban search and rescue (USAR) operations. The proposed method is based on the contract net protocol (CNP) and implemented over five phases: ordering existing tasks considering intrinsic interval uncertainty, finding a coordinating agent, holding an auction, applying allocation strategies (four strategies), and implementing and observing the real environment. Applying allocation strategies is the main innovation of the method. The methodology was evaluated in Tehran's District 1 for 6.6, 6.9, and 7.2 magnitude earthquakes. The simulation began by calculating the numbers of injured individuals, which were 28 856, 73 195, and 111 463 people for each earthquake, respectively. Simulations were performed for each scenario for a variety of rescuers (1000, 1500, and 2000 rescuers). In comparison with the CNP, the standard duration of rescue operations with the proposed approach exhibited at least 13 % improvement, with a maximal improvement of 21 %. Interval uncertainty analysis and comparison of the proposed strategies showed that increased uncertainty led to increased rescue time for the CNP and strategies 1 to 4. The time increase was less with the uniform distribution strategy (strategy 4) than with the other strategies. The consideration of strategies in the task allocation process, especially spatial strategies, facilitated both optimization and increased flexibility of the allocation. It also improved conditions for fault tolerance and agent-based cooperation stability in the USAR simulation system.


Sign in / Sign up

Export Citation Format

Share Document