Saved in:
Bibliographic Details
Main Authors: Tabib, Wennie, Stecklein, John, McDowell, Caleb, Goel, Kshitij, Jonathan, Felix, Rathod, Abhishek, Kokoski, Meghan, Burkholder, Edsel, Wallace, Brian, Navarro-Serment, Luis Ernesto, Bakshi, Nikhil Angad, Gupta, Tejus, Papernick, Norman, Guttendorf, David, Kahn, Erik E., Kasemer, Jessica, Holdaway, Jesse, Schneider, Jeff
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2410.08507
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908401098817536
author Tabib, Wennie
Stecklein, John
McDowell, Caleb
Goel, Kshitij
Jonathan, Felix
Rathod, Abhishek
Kokoski, Meghan
Burkholder, Edsel
Wallace, Brian
Navarro-Serment, Luis Ernesto
Bakshi, Nikhil Angad
Gupta, Tejus
Papernick, Norman
Guttendorf, David
Kahn, Erik E.
Kasemer, Jessica
Holdaway, Jesse
Schneider, Jeff
author_facet Tabib, Wennie
Stecklein, John
McDowell, Caleb
Goel, Kshitij
Jonathan, Felix
Rathod, Abhishek
Kokoski, Meghan
Burkholder, Edsel
Wallace, Brian
Navarro-Serment, Luis Ernesto
Bakshi, Nikhil Angad
Gupta, Tejus
Papernick, Norman
Guttendorf, David
Kahn, Erik E.
Kasemer, Jessica
Holdaway, Jesse
Schneider, Jeff
contents Rapid search and rescue is critical to maximizing survival rates following natural disasters. However, these efforts are challenged by the need to search large disaster zones, lack of reliability in the communications infrastructure, and a priori unknown numbers of objects of interest (OOIs), such as injured survivors. Aerial robots are increasingly being deployed for search and rescue due to their high mobility, but there remains a gap in deploying multi-robot autonomous aerial systems for methodical search of large environments. Prior works have relied on preprogrammed paths from human operators or are evaluated only in simulation. We bridge these gaps in the state of the art by developing and demonstrating a decentralized active search system, which biases its trajectories to take additional views of uncertain OOIs. The methodology leverages stochasticity for rapid coverage in communication denied scenarios. When communications are available, robots share poses, goals, and OOI information to accelerate the rate of search. Detections from multiple images and vehicles are fused to provide a mean and covariance for each OOI location. Extensive simulations and hardware experiments in Bloomingdale, OH, are conducted to validate the approach. The results demonstrate the active search approach outperforms greedy coverage-based planning in communication-denied scenarios while maintaining comparable performance in communication-enabled scenarios. The results also demonstrate the ability to detect and localize all a priori unknown OOIs with a mean error of approximately 3m at flight altitudes between 50m-60m.
format Preprint
id arxiv_https___arxiv_org_abs_2410_08507
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Decentralized Uncertainty-Aware Active Search with a Team of Aerial Robots
Tabib, Wennie
Stecklein, John
McDowell, Caleb
Goel, Kshitij
Jonathan, Felix
Rathod, Abhishek
Kokoski, Meghan
Burkholder, Edsel
Wallace, Brian
Navarro-Serment, Luis Ernesto
Bakshi, Nikhil Angad
Gupta, Tejus
Papernick, Norman
Guttendorf, David
Kahn, Erik E.
Kasemer, Jessica
Holdaway, Jesse
Schneider, Jeff
Robotics
Rapid search and rescue is critical to maximizing survival rates following natural disasters. However, these efforts are challenged by the need to search large disaster zones, lack of reliability in the communications infrastructure, and a priori unknown numbers of objects of interest (OOIs), such as injured survivors. Aerial robots are increasingly being deployed for search and rescue due to their high mobility, but there remains a gap in deploying multi-robot autonomous aerial systems for methodical search of large environments. Prior works have relied on preprogrammed paths from human operators or are evaluated only in simulation. We bridge these gaps in the state of the art by developing and demonstrating a decentralized active search system, which biases its trajectories to take additional views of uncertain OOIs. The methodology leverages stochasticity for rapid coverage in communication denied scenarios. When communications are available, robots share poses, goals, and OOI information to accelerate the rate of search. Detections from multiple images and vehicles are fused to provide a mean and covariance for each OOI location. Extensive simulations and hardware experiments in Bloomingdale, OH, are conducted to validate the approach. The results demonstrate the active search approach outperforms greedy coverage-based planning in communication-denied scenarios while maintaining comparable performance in communication-enabled scenarios. The results also demonstrate the ability to detect and localize all a priori unknown OOIs with a mean error of approximately 3m at flight altitudes between 50m-60m.
title Decentralized Uncertainty-Aware Active Search with a Team of Aerial Robots
topic Robotics
url https://arxiv.org/abs/2410.08507