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

Direct link
A Dual Ascent Method for the Hop-constrained Shortest Path with Application to Positioning of Unmanned Aerial Vehicles
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, pages
Linköping: Linköping University Electronic Press, 2008. , 30 p.
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
URN: urn:nbn:se:liu:diva-14997Local ID: LiTH-MAT-R-2008-07OAI: diva2:37550
Available from2008-10-07 Created:2008-10-07 Last updated:2013-08-29Bibliographically 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

Search outside of DiVA

GoogleGoogle Scholar
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: 502 hits
ReferencesLink to record
Permanent link

Direct link