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

Direct link
Cite
Citation style
  • apa
  • 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
Positioning Unmanned Aerial Vehicles As Communication Relays for Surveillance Tasks
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, KPLAB - Knowledge Processing Lab. Linköping University, The Institute of Technology.
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.ORCID iD: 0000-0002-5500-8494
Show others and affiliations
2010 (English)In: Robotics: Science and Systems V / [ed] Jeff Trinkle, Yoky Matsuoka, Jose Castellanos, MIT Press, 2010, p. 257-264Conference paper, Published paper (Refereed)
Abstract [en]

When unmanned aerial vehicles (UAVs) are used to survey distant targets, it is important to transmit sensor information back to a base station. As this communication often requires high uninterrupted bandwidth, the surveying UAV often needs afree line-of-sight to the base station, which can be problematic in urban or mountainous areas. Communication ranges may also belimited, especially for smaller UAVs. Though both problems can be solved through the use of relay chains consisting of one or more intermediate relay UAVs, this leads to a new problem: Where should relays be placed for optimum performance? We present two new algorithms capable of generating such relay chains, one being a dual ascent algorithm and the other a modification of the Bellman-Ford algorithm. As the priorities between the numberof hops in the relay chain and the cost of the chain may vary, wecalculate chains of different lengths and costs and let the ground operator choose between them. Several different formulations for edge costs are presented. In our test cases, both algorithms are substantially faster than an optimized version of the original Bellman-Ford algorithm, which is used for comparison.

Place, publisher, year, edition, pages
MIT Press, 2010. p. 257-264
National Category
Computer Sciences Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-21974ISBN: 978-0-262-51463-7 (print)OAI: oai:DiVA.org:liu-21974DiVA, id: diva2:242169
Conference
Robotics: Science and Systems V, University of Washington, Seattle, USA, June 28 - July 1, 2009
Available from: 2009-11-03 Created: 2009-10-07 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

find book at a swedish library/hitta boken i ett svenskt bibliotekLink to publication

Authority records

Burdakov, OlegDoherty, PatrickHolmberg, KajKvarnström, JonasOlsson, Per-Magnus

Search in DiVA

By author/editor
Burdakov, OlegDoherty, PatrickHolmberg, KajKvarnström, JonasOlsson, Per-Magnus
By organisation
Optimization The Institute of TechnologyKPLAB - Knowledge Processing Lab
Computer SciencesComputational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 1106 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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