Burdakov, Oleg Doherty, Patrick Holmberg, Kaj Kvarnström, Jonas 2010 (English)In: Robotics: Science and Systems V / [ed] Jeff Trinkle, Yoky Matsuoka, Jose Castellanos, MIT Press, 2010, 257-264Conference paper (Refereed)
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.
National CategoryComputer Science Computational Mathematics
Identifiersurn:nbn:se:liu:diva-21974 (URN)978-0-262-51463-7 (ISBN)oai:DiVA.org:liu-21974 (OAI)diva2:242169 (DiVA)
Robotics: Science and Systems V, University of Washington, Seattle, USA, June 28 - July 1, 2009