Deterministic Area Coverage by UAV Swarms via Multi-Eulerian Rotor-Router Walks
Mathematical Problems of Computer Science · 01.06.2026 · 65 · 7-15
DOI: 10.51408/1963-0142 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Problems of Computer Science, online erschienen am 01.06.2026. Verfasst von Vahagn Poghosyan.
Abstract (Originalsprache)
The deterministic area coverage problems for UAV swarms based on multi-Eulerian rotor-router walks are investigated. The rotor-router model provides a quasi-random analogue of random walks with strong structural properties. The loop reversibility theorem is used; that is, under mild connectivity assumptions on the underlying discretized environment, a swarm of UAVs executing coordinated multi-Eulerian rotorrouter walks achieves complete area coverage, in the sense that each directed edge is traversed exactly once by a single UAV. The results establish provable coverage guarantees that are robust to asynchronous execution. Furthermore, the loop reversibility theorem is generalized to the case of repeated coverage, where the area should be covered a prescribed number M of times, without requiring global synchronization among UAVs at the end of each traversal cycle. A multi-user and multi-agent platform has been developed to support mission planning and coordinated supervision of self-organizing UAV swarms.
Zitieren
APA
Poghosyan, V. (2026). Deterministic Area Coverage by UAV Swarms via Multi-Eulerian Rotor-Router Walks. Mathematical Problems of Computer Science, 65, 7-15. https://doi.org/10.51408/1963-0142
Vancouver
Poghosyan V. Deterministic Area Coverage by UAV Swarms via Multi-Eulerian Rotor-Router Walks. Mathematical Problems of Computer Science. 2026;65:7-15. doi:10.51408/1963-0142
BibTeX
@article{Poghosyan2026,
author = {Poghosyan, Vahagn},
title = {Deterministic Area Coverage by UAV Swarms via Multi-Eulerian Rotor-Router Walks},
journal = {Mathematical Problems of Computer Science},
year = {2026},
volume = {65},
pages = {7--15},
doi = {10.51408/1963-0142}
}
EUVIMED