Burdakov, Oleg Doherty, Patrick Holmberg, Kaj Kvarnström, Jonas 2010 (English)In: The international journal of robotics research, ISSN 0278-3649, E-ISSN 1741-3176, Vol. 29, no 8, 1069-1087Article in journal (Refereed) Published
When unmanned aerial vehicles (UAVs) are used for surveillance, information must often be transmitted to a base station in real time. However, limited communication ranges and the common requirement of free line of sight may make direct transmissions from distant targets impossible. This problem can be solved using relay chains consisting of one or more intermediate relay UAVs. This leads to the problem of positioning such relays given known obstacles, while taking into account a possibly mission-specific quality measure. The maximum quality of a chain may depend strongly on the number of UAVs allocated. Therefore, it is desirable to either generate a chain of maximum quality given the available UAVs or allow a choice from a spectrum of Pareto-optimal chains corresponding to different trade-offs between the number of UAVs used and the resulting quality. In this article, we define several problem variations in a continuous three-dimensional setting. We show how sets of Pareto-optimal chains can be generated using graph search and present a new label-correcting algorithm generating such chains significantly more efficiently than the best-known algorithms in the literature. Finally, we present a new dual ascent algorithm with better performance for certain tasks and situations.
UAV surveillance; unmanned aerial vehicle; communication relay; optimization
National CategoryEngineering and Technology
Identifiersurn:nbn:se:liu:diva-58293 (URN)10.1177/0278364910369463 (DOI)000279115700009 (ISI)oai:DiVA.org:liu-58293 (OAI)diva2:337902 (DiVA)