Olsson, Per-Magnus Kvarnström, Jonas Doherty, Patrick Burdakov, Oleg 2010 (English)In: Proceedings of the 11th International Conference on Control, Automation, Robotics and Vision (ICARCV 2010), IEEE conference proceedings, 2010, 1070-1077Conference paper (Refereed)
An important use of unmanned aerial vehicles is surveillance of distant targets, where sensor information must quickly be transmitted back to a base station. In many cases, high uninterrupted bandwidth requires line-of-sight between sender and transmitter to minimize quality degradation. Communication range is typically limited, especially when smaller UAVs are used. Both problems can be solved by creating relay chains for surveillance of a single target, and relay trees for simultaneous surveillance of multiple targets. In this paper, we show how such chains and trees can be calculated. For relay chains we create a set of chains offering different trade-offs between the number of UAVs in the chain and the chain’s cost. We also show new results on how relay trees can be quickly calculated and then incrementally improved if necessary. Encouraging empirical results for improvement of relay trees are presented.
Unmanned aerial vehicles, UAV surveillance, relay, communication, Steiner tree
National CategoryComputer Science
Identifiersurn:nbn:se:liu:diva-59884 (URN)10.1109/ICARCV.2010.5707968 (DOI)978-1-4244-7814-9 (ISBN)oai:DiVA.org:liu-59884 (OAI)diva2:353975 (DiVA)
International Conference on Control, Automation, Robotics and Vision (ICARCV)