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: An Extended Bayesian Optimization Approach to Decentralized Swarm Robotic Search
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
Award ID(s):
1927462
PAR ID:
10201755
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Journal of Computing and Information Science in Engineering
Volume:
20
Issue:
5
ISSN:
1530-9827
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; ; (, IEEE)
    We present a dynamic multi-robot mapping framework that combines Blockchain technology for swarm management with a Hybrid Ant Colony Optimization (HACO) algorithm for path planning. Blockchain-based swarm contracts enable decentralized, transparent, and secure task allocation, acceptance, tracking, and reward distribution among multiple robots. HACO facilitates efficient path planning in complex environments through cooperative and competitive strategies. We deploy multiple LiDAR-equipped Unitree Go2 dog robots to collaboratively and competitively map divided sub-areas, with task reassignment based on real-time feedback and the selected strategy. In cooperative mode, robots share data to boost efficiency and accuracy; in competitive mode, they work independently to reduce redundancy and optimize resources. Swarm contracts also verify full sub-area coverage via the merged map. Results show that integrating blockchain-based management with HACO significantly enhances mapping performance, delivering a robust and scalable solution for realworld multi-robot systems. 
    more » « less
  2. ; (, 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
  3. ; ; ; (, Proceedings - International Conference on Computer Communications and Networks)
    Efficient path planning and communication of multi-robot systems in the case of a search and rescue operation is a critical issue facing robotics disaster relief efforts. Ensuring all the nodes of a specialized robotic search team are within range, while also covering as much area as possible to guarantee efficient response time, is the goal of this paper. We propose a specialized search-and-rescue model based on a mesh network topology of aerial and ground robots. The proposed model is based on several methods. First, each robot determines its position relative to other robots within the system, using RSSI. Packets are then communicated to other robots in the system detailing important information regarding robot system status, status of the mission, and identification number. The results demonstrate the ability to determine multi-robot navigation with RSSI, allowing low computation costs and increased search-and-rescue time efficiency. 
    more » « less
  4. ; (, Springer Nature Switzerland)
    This paper compares different distributed control approaches which enable a team of robots search for and track an unknown number of targets. The robots are equipped with sensors which have a limited field of view (FoV) and they are required to explore the environment. The team uses a distributed formulation of the Probability Hypothesis Density (PHD) filter to estimate the number and the position of the targets. The resulting target estimate is used to select the subsequent search locations for each robot. This paper compares Lloyd’s algorithm, a traditional method for distributed search, with two typical stochastic optimization methods: Particle Swarm Optimization (PSO) and Simulated Annealing (SA). This paper presents novel formulations of PSO and SA to solve the multi-target tracking problem, which more effectively trade off between exploration and exploitation. Simulations demonstrate that the use of these stochastic optimization techniques improves coverage of the search space and reduces the error in the target estimates compared to the baseline approach. 
    more » « less
  5. ; ; (, ASCE International Conference on Computing in Civil Engineering 2021)
    Issa, R. (Ed.)
    The construction industry has traditionally been a labor-intensive industry. Typically, labor cost takes a significant portion of the total project cost. In spite of the good pay, there was a big gap recently between demand and supply in construction trades position. A survey shows that more than 80% of construction companies in the Midwest of US are facing workforce shortage and suffering in finding enough skilled trades people to hire. This workforce shortage is also nationwide or even worldwide in many places. Construction automation provides a potential solution to mitigate this problem by seeking to replace some of the demanding, repetitive, and/or dangerous construction operations with robotic automation. Currently, robots have been used in bricklaying or heavy-lifting operations in the industry, and other uses remain to be explored. In this paper, the authors proposed a feasibility breakdown structure (FBS)-based robotic system method that can be used to test the feasibility of performing target construction operations with specific robotic systems, including a top-down work breakdown structure and a bottom-up set of feasibility analysis components based on literature search and/or simulation. The proposed method was demonstrated in testing the use of a KUKA robot and a Fetch robot to perform rebar mesh construction. Results showed that the overall workflow is feasible, whereas certain limitations presented in path planning. In addition, a smooth and timely information flow from the Fetch robot sensor and computer vision-based control to the two robots for a coordinated path planning and cooperation is critical for such constructability. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email