liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles
Linköping University, Department of Mathematics, Optimization . Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-1836-4200
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0002-5500-8494
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.
2017 (English)In: Annals of Operations Research, ISSN 0254-5330, E-ISSN 1572-9338, Vol. 249, no 1, 163-174 p.Article in journal (Refereed) Published
Abstract [en]

Guarding the perimeter of an area in order to detect potential intruders is an important task in a variety of security-related applications. This task can in many circumstances be performed by a set of camera-equipped unmanned aerial vehicles (UAVs). Such UAVs will occasionally require refueling or recharging, in which case they must temporarily be replaced by other UAVs in order to maintain complete surveillance of the perimeter. In this paper we consider the problem of scheduling such replacements. We present optimal replacement strategies and justify their optimality.

Place, publisher, year, edition, pages
Springer, 2017. Vol. 249, no 1, 163-174 p.
Keyword [en]
Scheduling problem, Optimal replacement strategies, Perimeter guarding, Unmanned aerial vehicles
National Category
Computer Science Computational Mathematics Information Systems
Identifiers
URN: urn:nbn:se:liu:diva-126459DOI: 10.1007/s10479-016-2169-5ISI: 000394151400010Scopus ID: 2-s2.0-84961644607OAI: oai:DiVA.org:liu-126459DiVA: diva2:914860
Funder
EU, FP7, Seventh Framework Programme, 600958VINNOVA, 2013-01206Linnaeus research environment CADICSELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Available from: 2016-03-27 Created: 2016-03-27 Last updated: 2017-03-30Bibliographically approved

Open Access in DiVA

fulltext(39 kB)22 downloads
File information
File name FULLTEXT02.pdfFile size 39 kBChecksum SHA-512
692b9068c1d9045b301550800d402de57c6da373fa961a7b18e8e5e9bed58971cf7fbf5b70a2a031eae555245ab8b9da60c4b991ac5c5e46923d7a89424350e2
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Burdakov, OlegKvarnström, JonasDoherty, Patrick
By organisation
Optimization Faculty of Science & EngineeringArtificial Intelligence and Integrated Computer Systems
In the same journal
Annals of Operations Research
Computer ScienceComputational MathematicsInformation Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 22 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 798 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf