[HTML][HTML] The cloud-to-edge-to-IoT continuum as an enabler for search and rescue operations

L Militano, A Arteaga, G Toffetti, N Mitton - Future Internet, 2023 - mdpi.com
When a natural or human disaster occurs, time is critical and often of vital importance. Data
from the incident area containing the information to guide search and rescue (SAR) …

SOScheduler: Toward Proactive and Adaptive Wildfire Suppression via Multi-UAV Collaborative Scheduling

X Chen, Z Xiao, Y Cheng, CC Hsia… - IEEE Internet of …, 2024 - ieeexplore.ieee.org
Multi-UAV systems have shown immense potential in handling complex tasks in large-scale,
dynamic, and cold-start (ie, limited prior knowledge) scenarios, such as wildfire suppression …

Importance-based distributed persistent coverage strategy over environmental hotspots using quadrotors: Algorithm and experiments

M Thummalapeta, SW Chen, YC Liu - Journal of the Franklin Institute, 2024 - Elsevier
This paper proposes a novel importance-based persistent coverage for environments with
hotspots. Multiple quadrotors are utilized to maintain coverage while acquiring high-quality …

Adaptive Memetic Algorithm with Dual-Level Local Search for Cooperative Route Planning of Multi-Robot Surveillance Systems

H Cheng, J Yi, W Xia, H Pu, J Luo - Complex System Modeling …, 2024 - ieeexplore.ieee.org
The heightened autonomy and robust adaptability inherent in a multi-robot system have
proven pivotal in disaster search and rescue, agricultural irrigation, and environmental …

Optimal allocation of many robot guards for sweep-line coverage

SW Feng, T Guo, J Yu - 2023 IEEE International Conference on …, 2023 - ieeexplore.ieee.org
We study the problem of allocating many mobile robots for the execution of a pre-defined
sweep schedule in a known two-dimensional environment, with applications toward search …

Efficient algorithms for boundary defense with heterogeneous defenders

SW Feng, J Yu - arXiv preprint arXiv:2302.09706, 2023 - arxiv.org
This paper studies the problem of defending (1D and 2D) boundaries against a large
number of continuous attacks with a heterogeneous group of defenders. The defender team …

Deep and Decentralized Multi-Agent Coverage of a Target with Unknown Distribution

H Rastgoftar - arXiv preprint arXiv:2307.04407, 2023 - arxiv.org
This paper proposes a new architecture for multi-agent systems to cover an unknowingly
distributed fast, safely, and decentralizedly. The inter-agent communication is organized by …

Reduced state value iteration for multi-drone persistent surveillance with charging constraints

PH Washington, M Schwager - 2021 IEEE/RSJ International …, 2021 - ieeexplore.ieee.org
This paper presents Reduced State Value Iteration (RSVI), an algorithm to compute policies
for Markov Decision Processes (MDPs) that have natural checkpoints, allowing for a solution …

Quantum-assisted Rendezvous on Graphs: Explicit Algorithms and Quantum Computer Simulations

J Tucker, P Strange, P Mironowicz… - arXiv preprint arXiv …, 2024 - arxiv.org
We study quantum advantage in one-step rendezvous games on simple graphs analytically,
numerically, and using noisy intermediate-scale quantum (NISQ) processors. Our protocols …

Learning large graph-based MDPs with historical data

RN Haksar, M Schwager - IEEE Transactions on Control of …, 2021 - ieeexplore.ieee.org
Weconsider learning the dynamics and measurement model parameters of a graph-based
Markov decision process (GMDP) given a history of measurements. Graph-based models …