The cyclic-routing UAV problem is PSPACE-complete
- Submitting institution
-
Sheffield Hallam University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2999
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-662-46678-0_21
- Title of conference / published proceedings
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- First page
- 328
- Volume
- 9034
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Out of scope for open access requirements
- Month of publication
- April
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 13
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Asghar, Smith and Sundaram (IEEE, 2019) use the result to propose a novel algorithm for multi-robot routing for persistent monitoring with latency constraints. Katsikas uses examples from the article to illustrate his PhD thesis on Game Theoretic Models of Networks Security (University of Warwick, 2017) as does Asghar in his PhD thesis Multi-Robot Path Planning for Persistent Monitoring in Stochastic and Adversarial Environments (University of Waterloo, Ontario, Canada, 2020).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -