skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Aerial Swarm Defense by StringNet Herding: Theory and Experiments
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.  more » « less
Award ID(s):
1738714
PAR ID:
10291984
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Frontiers in Robotics and AI
Volume:
8
ISSN:
2296-9144
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; (, Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems (APPLIED Workshop))
    Due to the increasing complexity of robot swarm algorithms, ana- lyzing their performance theoretically is often very difficult. Instead, simulators are often used to benchmark the performance of robot swarm algorithms. However, we are not aware of simulators that take advantage of the naturally highly parallel nature of distributed robot swarms. This paper presents ParSwarm, a parallel C++ frame- work for simulating robot swarms at scale on multicore machines. We demonstrate the power of ParSwarm by implementing two applications, task allocation and density estimation, and running simulations on large numbers of agents. 
    more » « less
  2. ; ; ; ; ; (, Biomimetics)
    A swarm of unmanned aerial vehicles (UAVs) can be used for many applications, including disaster relief, search and rescue, and establishing communication networks, due to its mobility, scalability, and robustness to failure. However, a UAV swarm’s performance is typically limited by each agent’s stored energy. Recent works have considered the usage of thermals, or vertical updrafts of warm air, to address this issue. One challenge lies in a swarm of UAVs detecting and taking advantage of these thermals. Inspired by hawks, a swarm could take advantage of thermals better than individuals due to the swarm’s distributed sensing abilities. To determine which emergent behaviors increase survival time, simulation software was created to test the behavioral models of UAV gliders around thermals. For simplicity and robustness, agents operate with limited information about other agents. The UAVs’ motion was implemented as a Boids model, replicating the behavior of flocking birds through cohesion, separation, and alignment forces. Agents equipped with a modified behavioral model exhibit dynamic flocking behavior, including relative ascension-based cohesion and relative height-based separation and alignment. The simulation results show the agents flocking to thermals and improving swarm survival. These findings present a promising method to extend the flight time of autonomous UAV swarms. 
    more » « less
  3. ; (, IEEE)
    The Distributed Deterministic Spiral Algorithm (DDSA) has shown great foraging efficiency in robot swarms. However, when the number of robots in the swarm increases, scalability becomes a significant bottleneck due to increased collisions among robots, making it challenging to deploy them in the search space (e.g., 20 robots). To address this issue, we propose an adaptive Multiple-Distributed Bidirectional Spiral Algorithm (MDBSA) that enhances scalability. Our proposed algorithm partitions the squared search arena into multiple identical squared regions and assigns robots to regions dynamically based on the number of regions. In each region, a bidirectional spiral search path is planned, and when a robot completes its search, it is assigned to either an unassigned region or a region with one robot. The two robots will then travel along the path from the starting and ending points of the spiral path. We evaluated the performance of robot swarms using the MDBSA algorithm in the ARGoS robot simulator. Our experimental results show that the proposed MDBSA algorithm outperforms DDSA. When robots deliver collected resources to regions instead of the center, it reduces collisions and significantly improves the scalability of the robot swarm. Our findings suggest that a multiple-distributed search strategy is an efficient solution for foraging robot swarms. 
    more » « less
  4. ; ; ; (, Proceedings of the 34th Florida Artificial Intelligence Research Society Conference)
    null (Ed.)
    Decentralized computational swarms have been used to simulate the workings of insect colonies or hives, often utilizing a response threshold model which underlies agent interaction with dynamic environmental stimuli. Here, we propose a logistics resupply problem in which agents must select from multiple incoming scheduled tasks that generate competing resource demands for workers. This work diverges from previous attempts toward analyzing swarm behaviors by examining relative amounts of stress placed on a multi-agent system in conjunction with two mechanisms of response: variable threshold distribution, or duration level. Further, we demonstrate changes to the general swarm performance’s dependence on paired desynchronization type and schedule design, as the result of varied swarm conditions. 
    more » « less
  5. ; ; (, Proceedings of the 9th International Conference on Bioinspired Optimisation Methods and Their Applications)
    null (Ed.)
    In self-organizing multi-agent systems, inter-agent variation is known to improve swarm performance significantly. Response duration, the amount of time that an agent spends on a task, has been proposed as a form of inter-agent variation that may be beneficial. In the biological literature, variability in agent response duration in natural swarms for desynchronizing agent actions has been discussed for some time. This form of variation, however, is not well understood in artificial swarms. In this work, we explore inter-agent variation in response duration as a desynchronization technique. We find that variation in response duration does desynchronize agent behaviors and does improve swarm performance on a two-dimensional tracking problem in which the swarm must push a tracker, staying as close as possible to a moving target. By preventing agents from reacting identically to task stimuli and keeping some agents on task longer, response duration helps smooth the swarm’s path and allows it to better track the target into path features such as corners. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email