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
A Dual Ascent Method for the Hop-constrained Shortest Path with Application to Positioning of Unmanned Aerial Vehicles
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 Mathematics, Optimization . Linköping University, The Institute of Technology.ORCID iD: 0000-0001-5907-0087
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, The Institute of Technology.
2008 (English)Report (Other academic)
Abstract [en]

We study the problem of positioning unmanned aerial vehicles (UAVs) to maintain an unobstructed flow of communication from a surveying UAV to some base station through the use of multiple relay UAVs. This problem can be modeled as a hopconstrained shortest path problem in a large visibility graph. We propose a dual ascent method for solving this problem, optionally within a branch-and-bound framework. Computational tests show that realistic problems can be solved in a reasonably short time, and that the proposed method is faster than the classical dynamic programming approach.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press , 2008. , 30 p.
Series
Report / Department of Mathematics, Universitetet i Linköping, Tekniska högskolan, ISSN 0348-2960 ; 2008:7
Keyword [en]
Hop-constrained, shortest path, dual ascent, visibility graph, UAV, relay
National Category
Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-14997Local ID: LiTH-MAT-R-2008-07OAI: oai:DiVA.org:liu-14996DiVA: diva2:37550
Available from: 2008-10-07 Created: 2008-10-07 Last updated: 2015-06-02Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Burdakov, OlegHolmberg, KajOlsson, Per-Magnus
By organisation
Optimization The Institute of TechnologyKPLAB - Knowledge Processing Lab
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

Total: 637 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