Sökning: onr:"swepub:oai:DiVA.org:liu-21974" >
Positioning Unmanne...
Positioning Unmanned Aerial Vehicles As Communication Relays for Surveillance Tasks
-
- Burdakov, Oleg (författare)
- Linköpings universitet,Optimeringslära,Tekniska högskolan
-
- Doherty, Patrick (författare)
- Linköpings universitet,KPLAB - Laboratoriet för kunskapsbearbetning,Tekniska högskolan
-
- Holmberg, Kaj (författare)
- Linköpings universitet,Optimeringslära,Tekniska högskolan
-
visa fler...
-
- Kvarnström, Jonas (författare)
- Linköpings universitet,KPLAB - Laboratoriet för kunskapsbearbetning,Tekniska högskolan
-
- Olsson, Per-Magnus (författare)
- Linköpings universitet,KPLAB - Laboratoriet för kunskapsbearbetning,Tekniska högskolan
-
visa färre...
-
(creator_code:org_t)
- MIT Press, 2010
- 2010
- Engelska.
-
Ingår i: Robotics. - : MIT Press. - 9780262514637 ; , s. 257-264
- Relaterad länk:
-
http://libris.kb.se/...
-
visa fler...
-
http://www.roboticsp...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
Nyckelord
- Computer science
- Datalogi
- Optimization, systems theory
- Optimeringslära, systemteori
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
-
Robotics
(Sök värdpublikationen i LIBRIS)
Till lärosätets databas