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
  • 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
Local Search for Hop-constrained Directed Steiner Tree Problem with Application to UAV-based Multi-target Surveillance
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.ORCID iD: 0000-0003-1836-4200
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-5500-8494
2014 (English)Report (Other academic)
Abstract [en]

We consider the directed Steiner tree problem (DSTP) with a constraint on the total number of arcs (hops) in the tree. This problem is known to be NP-hard, and therefore, only heuristics can be applied in the case of its large-scale instances.   For the hop-constrained DSTP, we propose local search strategies aimed at improving any heuristically produced initial Steiner tree. They are based on solving a sequence of hop-constrained shortest path problems for which we have recently developed ecient label correcting algorithms.   The presented approach is applied to nding suitable 3D locations where unmanned aerial vehicles (UAVs) can be placed to relay information gathered in multi-target monitoring and surveillance. The eciency of our algorithms is illustrated by results of numerical experiments involving problem instances with up to 40 000 nodes and up to 20 million arcs.

Place, publisher, year, edition, pages
Linköping University Electronic Press, 2014. , 25 p.
Series
LiTH-MAT-R, ISSN 0348-2960 ; 2014:10
Keyword [en]
Steiner trees, hop constraints, local search heuristics, label correcting algorithms, unmanned vehicles placement
National Category
Discrete Mathematics Computer Vision and Robotics (Autonomous Systems)
Identifiers
URN: urn:nbn:se:liu:diva-109605ISRN: LiTH-MAT-R--2014/10--SEOAI: oai:DiVA.org:liu-109605DiVA: diva2:739485
Projects
CADICSELLIITCUASSHERPANFFP6
Available from: 2014-08-21 Created: 2014-08-21 Last updated: 2017-02-24

Open Access in DiVA

Local Search for Hop-constrained Directed Steiner Tree Problem with Application to UAV-based Multi-target Surveillance(2224 kB)175 downloads
File information
File name FULLTEXT03.pdfFile size 2224 kBChecksum SHA-512
76d9b210506ff1972f03a8b395089ef8579216b60e97f679c56df6fbc704da48755c723b5b4373ea5254a261081b3124577092cc0796e8d41f6a57aacd48f96a
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Burdakov, OlegDoherty, PatrickKvarnström, Jonas
By organisation
Optimization The Institute of TechnologyArtificial Intelligence and Integrated Computer Systems
Discrete MathematicsComputer Vision and Robotics (Autonomous Systems)

Search outside of DiVA

GoogleGoogle Scholar
Total: 180 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

Total: 211 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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