Abstract
Consider a finite set of targets, with each target assigned a relative deadline, and each pair of targets assigned a fixed transit flight time. Given a flock of identical UAVs, can one ensure that every target is repeatedly visited by some UAV at intervals of duration at most the target’s relative deadline? The Cyclic-Routing UAV Problem (cr-uav) is the question of whether this task has a solution. This problem can straightforwardly be solved in PSPACE by modelling it as a network of timed automata. The special case of there being a single UAV is claimed to be NP-complete in the literature. In this paper, we show that the cr-uav Problem is in fact PSPACE-complete even in the single-UAV case.
Cite
CITATION STYLE
Ho, H. M., & Ouaknine, J. (2015). The cyclic-routing UAV problem is PSPACE-complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9034, pp. 328–342). Springer Verlag. https://doi.org/10.1007/978-3-662-46678-0_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
