HO, Hsi-Ming and OUAKNINE, J. (2015). The cyclic-routing UAV problem is PSPACE-complete. In: PITTS, Andrew, (ed.) Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science book series, 9034 . Springer Berlin Heidelberg, 328-342.
|
PDF
Ho_Cycling-RoutingUAVProblem(AM).pdf - Accepted Version All rights reserved. Download (626kB) | Preview |
Abstract
© 2015, Springer-Verlag Berlin Heidelberg. 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.
Item Type: | Book Section |
---|---|
Additional Information: | Series Online ISSN 1611-3349 |
Uncontrolled Keywords: | 08 Information and Computing Sciences; Artificial Intelligence & Image Processing |
Identification Number: | https://doi.org/10.1007/978-3-662-46678-0_21 |
Page Range: | 328-342 |
SWORD Depositor: | Symplectic Elements |
Depositing User: | Symplectic Elements |
Date Deposited: | 05 Aug 2020 13:49 |
Last Modified: | 17 Mar 2021 23:48 |
URI: | https://shura.shu.ac.uk/id/eprint/25239 |
Actions (login required)
View Item |
Downloads
Downloads per month over past year