• No results found

Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles

N/A
N/A
Protected

Academic year: 2021

Share "Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles"

Copied!
1
0
0

Loading.... (view fulltext now)

Full text

(1)

Optimal scheduling for replacing perimeter

guarding unmanned aerial vehicles

Oleg Burdakov, Jonas Kvarnström and Patrick Doherty

Linköping University Post Print

N.B.: When citing this work, cite the original article.

The original publication is available at www.springerlink.com:

Oleg Burdakov, Jonas Kvarnström and Patrick Doherty, Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles, 2016, Annals of Operations Research.

http://dx.doi.org/10.1007/s10479-016-2169-5

Copyright: Springer Verlag (Germany)

http://www.springerlink.com/?MUD=MP

Postprint available at: Linköping University Electronic Press

References

Related documents

Besides altering the number of consecutive weak classifiers, we also tried two different observation models; one using both the color and edge features, and another using only the

It ended up having one amplifying stage, a high pass filter and a peak detector with a built in amplification, a system that made it possible to detect a signal from 0.7m away and

Chapter 6 has presented experimental results of a vision-based landing approach which uses inertial sensor data and position data from a vision system relying on an artificial

Every tethering mode has a reference position where the UAV is assumed to follow and stay at and the main idea with the fictitious position and the automatic control system is

The multidisciplinary nature is expressed through the simultaneous use of both disciplinary models and analysis capabilities under a common framework, and for this

This allows us to reason at different levels of abstraction on the user: while the decisions taken on component Human are always a di- rect consequence of sensor

Submitted to Linköping Institute of Technology at Linköping University in partial fulfilment of the requirements for the degree of Licentiate of Engineering. Department of Computer

In this thesis we propose location aware routing for delay-tolerant networks (LAROD). LAROD is a beacon-less geographical routing protocol for intermittently connected mobile ad