Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Local Search for Hop-constrained Directed Steiner Tree Problem with Application to UAV-based Multi-target Surveillance
Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.ORCID-id: 0000-0003-1836-4200
Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.ORCID-id: 0000-0002-5500-8494
2014 (engelsk)Rapport (Annet vitenskapelig)
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.

sted, utgiver, år, opplag, sider
Linköping University Electronic Press, 2014. , s. 25
Serie
LiTH-MAT-R, ISSN 0348-2960 ; 2014:10
Emneord [en]
Steiner trees, hop constraints, local search heuristics, label correcting algorithms, unmanned vehicles placement
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-109605ISRN: LiTH-MAT-R--2014/10--SEOAI: oai:DiVA.org:liu-109605DiVA, id: diva2:739485
Prosjekter
CADICSELLIITCUASSHERPANFFP6Tilgjengelig fra: 2014-08-21 Laget: 2014-08-21 Sist oppdatert: 2018-01-11

Open Access i DiVA

Local Search for Hop-constrained Directed Steiner Tree Problem with Application to UAV-based Multi-target Surveillance(2224 kB)271 nedlastinger
Filinformasjon
Fil FULLTEXT03.pdfFilstørrelse 2224 kBChecksum SHA-512
76d9b210506ff1972f03a8b395089ef8579216b60e97f679c56df6fbc704da48755c723b5b4373ea5254a261081b3124577092cc0796e8d41f6a57aacd48f96a
Type fulltextMimetype application/pdf

Søk i DiVA

Av forfatter/redaktør
Burdakov, OlegDoherty, PatrickKvarnström, Jonas
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 276 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

urn-nbn

Altmetric

urn-nbn
Totalt: 537 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf