Search Results for « Multi-Swarm Herding »

Summary Detecting hiding communities is considered as a main topic in complex networks. In this article, we propose a multi‐swarm elephant herding optimization (EHO) algorithm to uncover community structures in complex environments. It adapts EHO algorithm to community detection problem. EHO algorithm relies on two procedures which are updating clan procedure and separating procedure. The main idea of our multi‐swarm approach is that the population is composed of a set of interacting clans. In each clan, a local search function is defined to determine best local individual called matriarch. Through updating clan procedure, the remaining individuals in the clan update their positions based on the matriarch position. In addition, to ensure significant individuals in the clan, a multi‐swarm cooperative algorithm is designed to implement separating procedure; clans interchange individuals to balance the exploration and exploitation abilities. A series of experiments are carried out on artificial and real networks. The results obtained by the proposed approach are better than the results obtained by some other approaches.

Abstract The present paper aims to design and simulate an adversarial strategy where a swarm of quadrotor UAVs is herding anti-aircraft land vehicles (AALV) that actively oppose the swarm’s objective by potentially taking them down. The main strategy is to block the AALVs’ line of sight to their goal zone (AALVs’ objective), shifting its trajectory so it reaches a kill zone instead (UAVs’ objective). The counter-swarm strategy performed by the AALVs consists of taking down the closest aerial units to the goal zone. As a result, a consensus algorithm is executed by the UAVs in order to assess the communication network and re-group. Consensus is based on the propagation of local observations that converge into a global agreement on a communication graph. Re-grouping is done via positioning around the kill zone vector or preferring an anti-clockwise formation to better close gaps. The adversarial strategy was tested in an empty arena and urban setting, the latter making use of a path-planning procedure that re-routes the AALV trajectory based on its current destination. Simulation results show a maximum UAV mission success rate converging to roughly 80% in the empty arena. When targeted elimination procedures are executed, UAV mission performance drops 5%, making no distinction between re-grouping strategies in the empty arena. The urban setting shows lower performance due to navigation complexity but favors the decision to re-group based on a formation that close gaps rather than positioning around the kill zone vector.

This paper studies a defense approach against one or more swarms of adversarial agents. In our earlier work, we employed a closed formation (“StringNet”) of defending agents (defenders) around a swarm of adversarial agents (attackers) to confine their motion within given bounds, and guide them to a safe area. The adversarial agents were assumed to remain close enough to each other, i.e., within a prescribed connectivity region. To handle situations when the attackers no longer stay within such a connectivity region, but rather split into smaller swarms (clusters) to maximize the chance or impact of attack, this paper proposes an approach to learn the attacking sub-swarms and reassign defenders toward the attackers. We use a “Density-based Spatial Clustering of Application with Noise (DBSCAN)” algorithm to identify the spatially distributed swarms of the attackers. Then, the defenders are assigned to each identified swarm of attackers by solving a constrained generalized assignment problem. We also provide conditions under which defenders can successfully herd all the attackers. The efficacy of the approach is demonstrated via computer simulations, as well as hardware experiments with a fleet of quadrotors.