Joint Optimization of Connectivity, Coverage, and Revisit Time in Multi-UAV Path Planning

Multi-UAV systems are deployed for many civil applications, such as search and rescue, surveillance, environmental monitoring, that require efficient area coverage and connectivity between UAVs and ground control station (GCS) to enable teamwork and information exchange. In dynamic missions, such as disaster management, or in case the sensors on the UAVs lead to uncertain measurements, it is desirable that whole or part of the area of interest is revisited by UAVs for information update or reliability. In this work, we propose a novel multiUAV path planning algorithm that incorporates revisit times into path decisions, without compromising coverage and connectivity requirements. We model the proposed planner by a multiobjective optimization problem and we provide an NSGA-II based solver that leads to a set of Pareto-optimal solutions. We compare our results with a benchmark path planner that only optimizes coverage and connectivity and show the tradeoffs between the proposed objective functions. We observe up to 4-fold improvement in terms of observed times between revisits.

Authors

Institutions

Publication Details

Published
2025-06-17
DOI
https://doi.org/10.1109/vtc2025-spring65109.2025.11174361
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

Joint Optimization of Connectivity, Coverage, and Revisit Time in Multi-UAV Path Planning

Evşen Yanmaz, Kadircan Kara
Robotic Path Planning Algorithms
article

Joint Optimization of Connectivity, Coverage, and Revisit Time in Multi-UAV Path Planning

Evşen Yanmaz, Kadircan Kara
article en

Abstract

Multi-UAV systems are deployed for many civil applications, such as search and rescue, surveillance, environmental monitoring, that require efficient area coverage and connectivity between UAVs and ground control station (GCS) to enable teamwork and information exchange. In dynamic missions, such as disaster management, or in case the sensors on the UAVs lead to uncertain measurements, it is desirable that whole or part of the area of interest is revisited by UAVs for information update or reliability. In this work, we propose a novel multiUAV path planning algorithm that incorporates revisit times into path decisions, without compromising coverage and connectivity requirements. We model the proposed planner by a multiobjective optimization problem and we provide an NSGA-II based solver that leads to a set of Pareto-optimal solutions. We compare our results with a benchmark path planner that only optimizes coverage and connectivity and show the tradeoffs between the proposed objective functions. We observe up to 4-fold improvement in terms of observed times between revisits.

Özyeğin University (TR)
Openalex Percentile: Top 73%
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.

Joint Optimization of Connectivity, Coverage, and Revisit Time in Multi-UAV Path Planning — Evşen Yanmaz, Kadircan Kara · (2025) | TGRS Research Map | TGRS