In this paper, a density-driven multi-agent swarm control problem is investigated. Robot swarms can provide a great benefit, especially for applications where a single robot cannot effectively achieve a given task. For large spatial-scale applications such as search and rescue, environmental monitoring, and surveillance, a new multi-agent swarm control strategy is necessary because of physical constraints including a robot number and operation time. This paper provides a novel density-driven swarm control strategy for multi-agent systems based on the Optimal Transport theory, to cover a spacious domain with limited resources. In such a scenario, \textit{efficiency} will likely be a key point in achieving an efficient robot swarm behavior rather than uniform coverage that might be infeasible. With the given reference density, pre-constructed from available information, the proposed swarm control method will drive the multi-agent system such that their time-averaged behavior becomes similar to the reference density. In this way, density-driven swarm control will enable the multiple agents to spend most of their time on high-priority regions that are reflected in the reference density, leading to efficiency. To protect the agents from collisions, the Artificial Potential Field method is employed and combined with the proposed density-driven swarm control scheme. Simulations are conducted to validate density-driven swarm control as well as to test collision avoidance. Also, the swarm performance is analyzed by varying the agent number in the simulation.
more »
« less
Adaptive Multiple Distributed Bidirectional Spiral Path Planning for Foraging Robot Swarms
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
- Award ID(s):
- 2112650
- PAR ID:
- 10591790
- Publisher / Repository:
- IEEE
- Date Published:
- ISBN:
- 979-8-3503-4139-3
- Page Range / eLocation ID:
- 225 to 232
- Subject(s) / Keyword(s):
- Path Planning, Task Partitioning, Distributed Spiral Search, Foraging Robot Swarms
- Location:
- Montreal, QC, Canada
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
This paper investigates a class of motion planning problems where multiple unicycle robots desire to safely reach their respective goal regions with minimal traveling times. We present a distributed algorithm which integrates decoupled optimal feedback planning and distributed conflict resolution. Collision avoidance and finite-time arrival at the goal regions are formally guaranteed. Further, the computational complexity of the proposed algorithm is independent of the robot number. A set of simulations are conduct to verify the scalability and near-optimality of the proposed algorithm.more » « less
-
Not AvailableUnmanned autonomous system (UAS) swarms empower groups of robotic agents (such as drones) to collectively accomplish complex missions by navigating intricate environments, but face significant challenges when operating in contested areas with electromagnetic jamming that disrupts inter-agent communication. This paper introduces an innovative hierarchical control strategy that enables a drone swarm to traverse complex terrains, including regions compromised by electromagnetic jamming intended to disrupt communications. The swarm is initially unaware of the existence or location of these jamming areas, making autonomous detection and avoidance critical for mission success. The proposed strategy synergistically combines communication-aware formation control, particle swarm optimization (PSO) for reactive navigation, and a global path planner for deadlock resolution to ensure the swarm maintains optimal communication quality and mission continuity. A gradient controller maintains the desired swarm formation by maximizing communication quality among agents, while a PSO-based movement controller navigates toward a destination, avoiding newly discovered jamming areas. To address potential deadlocks, a path planning algorithm is invoked to generate a globally optimal route. The framework operates without prior knowledge of jamming locations, learning threat positions through real-time environmental interaction. A comparative analysis of various path planning algorithms, including A*, Greedy Best-First Search, Breadth-First Search, Dijkstra’s algorithm, Jump Point Search, and Theta*, is presented through simulation. The results demonstrate that A* provides optimal performance for our integrated framework, facilitating efficient and robust navigation for the UAS swarms, while maintaining high communication quality among individual drones. The source code for this work is available at https://github.com/speccoud/Swarm-Control.more » « less
-
null (Ed.)Abstract Swarm robotic search aims at searching targets using a large number of collaborating simple mobile robots, with applications to search and rescue and hazard localization. In this regard, decentralized swarm systems are touted for their coverage scalability, time efficiency, and fault tolerance. To guide the behavior of such swarm systems, two broad classes of approaches are available, namely, nature-inspired swarm heuristics and multi-robotic search methods. However, the ability to simultaneously achieve efficient scalability and provide fundamental insights into the exhibited behavior (as opposed to exhibiting a black-box behavior) remains an open problem. To address this problem, this paper extends the underlying search approach in batch-Bayesian optimization to perform search with embodied swarm agents operating in a (simulated) physical 2D arena. Key contributions lie in (1) designing an acquisition function that not only balances exploration and exploitation across the swarm but also allows modeling knowledge extraction over trajectories and (2) developing its distributed implementation to allow asynchronous task inference and path planning by the swarm robots. The resulting collective informative path planning approach is tested on target-search case studies of varying complexity, where the target produces a spatially varying (measurable) signal. Notably, superior performance, in terms of mission completion efficiency, is observed compared to exhaustive search and random walk baselines as well as a swarm optimization-based state-of-the-art method. Favorable scalability characteristics are also demonstrated.more » « less
-
This paper conducts a comparative study of stochastic optimization strategies to enable multi-robot systems to search for and track an unknown number of targets. Each robot is equipped with a noisy sensor that has a limited field of view. The robots use a distributed version of the probability hypothesis density filter to estimate both the number and states of the targets. This online target estimate is used by the different search strategies to select actions for each robot. We compare Lloyd’s algorithm, a traditional method for distributed search, with four stochastic optimization techniques: Particle Swarm Optimization, Simulated Annealing, Ant Colony Optimization, and Artificial Immune Systems. Each of the methods is adapted from the traditional case of finding a single global optimum to locate all the local maxima (i.e.,targets). We demonstrate through extensive simulations that these techniques offer superior coverage of the search area and more accurate target localization compared to the baseline Lloyd’s algorithm when the ratio of robots to targets is low and that Lloyd’s algorithm performs best when the ratio of robots to targets is high. We also discuss the strengths and limitations of each method, assisting practitioners in the selection of the most appropriate strategy based on specific operational factors, such as the communication load in a multi-robot system.more » « less
An official website of the United States government

