Dynamics-Aware Fast Multi-Drone Exploration of Unknown Environments

Tasks such as surveillance, search and rescue operations, or disaster mapping require exploring unknown environments in the shortest possible time. Furthermore, when these tasks are performed by multiple robots, team coordination is crucial to achieve the desired efficiency. In this spirit, this paper proposes a method that introduces notions about each robot's dynamics into the planning process. We formulate novel costs into the Vehicle Routing Problem (VRP) to maintain each drone's inertia, required for efficiency. The costs of exploring regions are calculated based on the individual state of each robot, such as their speed and orientation, to favour distinct behaviours. The proposed solution is implemented on RACER, a state-of-the-art decentralized exploration system. The original implementation of RACER is modified to integrate our method, including a different optimization library to solve the VRP. To validate our approach, we conduct exhaustive experiments in four maps, with two and four agents and varying initial conditions, comparing our proposal with the state-of-the-art method. The results illustrate the advantages of incorporating knowledge about the team's dynamics into the planning process, demonstrating improvements in the efficiency and effectiveness of exploration in unknown environments.

Authors

Institutions

Publication Details

Published
2024-11-06
DOI
https://doi.org/10.1109/robot61475.2024.10797345
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamics-Aware Fast Multi-Drone Exploration of Unknown Environments

Eduardo Montijano, David Morilla-Cabello, Juan Zacarías Bardají
Robotic Path Planning Algorithms
article

Dynamics-Aware Fast Multi-Drone Exploration of Unknown Environments

Eduardo Montijano, David Morilla-Cabello, Juan Zacarías Bardají
article en

Abstract

Tasks such as surveillance, search and rescue operations, or disaster mapping require exploring unknown environments in the shortest possible time. Furthermore, when these tasks are performed by multiple robots, team coordination is crucial to achieve the desired efficiency. In this spirit, this paper proposes a method that introduces notions about each robot's dynamics into the planning process. We formulate novel costs into the Vehicle Routing Problem (VRP) to maintain each drone's inertia, required for efficiency. The costs of exploring regions are calculated based on the individual state of each robot, such as their speed and orientation, to favour distinct behaviours. The proposed solution is implemented on RACER, a state-of-the-art decentralized exploration system. The original implementation of RACER is modified to integrate our method, including a different optimization library to solve the VRP. To validate our approach, we conduct exhaustive experiments in four maps, with two and four agents and varying initial conditions, comparing our proposal with the state-of-the-art method. The results illustrate the advantages of incorporating knowledge about the team's dynamics into the planning process, demonstrating improvements in the efficiency and effectiveness of exploration in unknown environments.

Universidad de Zaragoza (ES)
Climate action
Openalex Percentile: Top 76%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Dynamics-Aware Fast Multi-Drone Exploration of Unknown Environments — Eduardo Montijano, David Morilla-Cabello, et al. · (2024) | TGRS Research Map | TGRS