How Good are Distributed Allocation Algorithms for Solving Urban Search and Rescue Problems? A Comparative Study With Centralized Algorithms

Abstract

In this paper, a modified centralized algorithm based on particle swarm optimization (MCPSO) is presented to solve the task allocation problem in the search and rescue domain. The reason for this paper is to provide a benchmark against distributed algorithms in search and rescue application area. The hypothesis of this paper is that a centralized algorithm should perform better than distributed algorithms because it has all the available information at hand to solve the problem. Therefore, the centralized approach will provide a benchmark for evaluating how well the distributed algorithms are working and how much improvement can still be gained. Among the distributed algorithms, the consensus-based bundle algorithm (CBBA) is a relatively recent method based on the market auction mechanism, which is receiving considerable attention. Other distributed algorithms, such as PI and PI with softmax, have shown to perform better than CBBA. Therefore, in this paper, the three distributed algorithms mentioned earlier are compared against three centralized algorithms. They are particle swarm optimization, MCPSO, described in this paper, and genetic algorithms. Two experiments were conducted. The first involved comparing all the abovementioned algorithms, both centralized and distributed, using the same set of application scenarios. It is found that MCPSO always outperforms the other five algorithms in time cost. Due to the high failure rate of CBBA and the other two centralized methods, the second experiment focused on carrying out more tests to compare MCPSO against PI and PI with softmax. All the results are shown and analyzed to determine the performance gaps between the distributed algorithms and the MCPSO. Note to Practitioners-This paper was motivated by the limitation of current distributed task allocation algorithms as they cannot achieve performances that are as good as the centralized ones. Therefore, a centralized algorithm is designed to evaluate the performance gap between the state-of-the-art distributed and centralized approaches. In the future research section, a new distributed particle swarm optimization (PSO) algorithm

Particle swarm optimization algorithm for the optimization of rescue task allocation with uncertain time constraints

“…Very limited evidence can be found in the literature that rigorously assesses the time factor in robot rescue. Some of our previous researches show positive outcomes in handling complex rescue routes in real-world situations with an assumption that survival time values are stable [18,19]. Still, estimating the survival time in destructive locations remains a challenging issue.…”

Parallel discrete lion swarm optimization algorithm for solving traveling salesman problem

“…In recent years, in some NP-hard combinatorial optimization problems related to TSP, the discretized heuristic optimization algorithm also performs well. Han [14] et al proposed the discrete ABC (DABC) algorithm to solve the flow shop scheduling problem; at the same time, the distributed heuristic optimization algorithm has an excellent performance in solving urban search and rescue prob-lems [15], localizing odor sources [16,17]. Inspired by the above papers, we extend the original lion swarm optimization (LSO) algorithms to parallel and discrete forms.…”

Rotary unmanned aerial vehicles path planning in rough terrain based on multi-objective particle swarm optimization

“…Multi-objective PSO (MOPSO) has been applied to plan the path in different scenarios. Geng et al [19] applied MOPSO in uncertain environments comparing with centralized algorithms. Geng and Gong [20] applied interval PSO by combining the local optimal criterion in multiple obstacle environments.…”