Enhanced Social Spider Optimization Algorithm for Increasing Performance of Multiple Pursuer Drones in Neutralizing Attacks From Multiple Evader Drones

Abstract

We propose an optimization algorithm for reducing execution time needed by multiple pursuers in solving a variant of the Multiple-Pursuer Multiple-Evader (MPME) problem where each evader tries to attack an area defended by pursuers. This problem is a variant of the Multi-Agent Pursuit Evasion problem. In our discussed problem, a group of pursuers tries to defend an area from a group of evaders’ attacks. The main task given in this problem is how pursuers can capture or immobilize as soon as possible any evader trying to get closer to the defended area (evaders’ target). We use Social Spider Optimization (SSO) algorithm as the basis of our proposed method. In SSO, there are female spiders, dominant-male spiders, and non-dominant-male spiders collaborating to catch their prey. In SSO, there are three main procedures usually exist: calculation of fitness value, the vibrational summons of surrounding spiders, and mating procedure. In this paper, we develop an enhanced SSO algorithm where excludes the mating procedure and propose a practical calculation process for solving our discussed problem. SSO is one of the recent optimization algorithms developed in the computer science field. Developing this algorithm for solving dynamic problem like the MPME variant surely brings a novelty in the computer science research area. We test our proposed method in a 3D simulation environment where we manifest all pursuers and evaders as drones. Based on our experiment result, our algorithm performs better than commonly used methods for solving the MPME problem.