LiU Electronic Press
Download:
File size:
2275 kb
Format:
application/pdf
Author:
Olsson, Per-Magnus (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Title:
Positioning Algorithms for Surveillance Using Unmanned Aerial Vehicles
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Licentiate thesis, monograph (Other academic)
Language:
English
Place of publ.: Linköping Publisher: Linköping University Electronic Press
Pages:
140
Series:
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971; 1476
Year of publ.:
2011
URI:
urn:nbn:se:liu:diva-66060
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-66060
ISBN:
978-91-7393-200-4
Subject category:
Computer Science
SVEP category:
Computer science
Keywords(en) :
Unmanned aerial vehicles, surveillance, communication relay, label- correcting, dual ascent, Steiner trees
Abstract(en) :

Surveillance is an important application for unmanned aerial vehicles (UAVs). The sensed information often has high priority and it must be made available to human operators as quickly as possible. Due to obstacles and limited communication range, it is not always possible to transmit the information directly to the base station. In this case, other UAVs can form a relay chain between the surveillance UAV and the base station. Determining suitable positions for such UAVs is a complex optimization problem in and of itself, and is made even more difficult by communication and surveillance constraints.

To solve different variations of finding positions for UAVs for surveillance of one target, two new algorithms have been developed. One of the algorithms is developed especially for finding a set of relay chains offering different trade-offs between the number of UAVsand the quality of the chain. The other algorithm is tailored towards finding the highest quality chain possible, given a limited number of available UAVs.

Finding the optimal positions for surveillance of several targets is more difficult. A study has been performed, in order to determine how the problems of interest can besolved. It turns out that very few of the existing algorithms can be used due to the characteristics of our specific problem. For this reason, an algorithm for quickly calculating positions for surveillance of multiple targets has been developed. This enables calculation of an initial chain that is immediately made available to the user, and the chain is then incrementally optimized according to the user’s desire.

Presentation:
2011-04-20, Alan Turing, House E, Campus Valla, Linköpings universitet, Linköping, 09:19 (English)
Degree:
Licentiate of Engineering
Supervisor:
Doherty, Patrick, Professor (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Opponent:
Karlsson, Lars, Docent (Applied Autonomous Sensor Systems Center, Örebro Universitet,)
Available from:
2011-03-29
Created:
2011-03-02
Last updated:
2011-04-13
Statistics:
187 hits
FILE INFORMATION
File size:
2275 kb
Mimetype:
application/pdf
Type:
fulltext
Statistics:
568 hits
File size:
2841 kb
Mimetype:
application/pdf
Type:
cover
Statistics:
23 hits