The Distribution of the Patrol Drone

DOI

10.2991/cecs-18.2018.39How to use a DOI?

Keywords

jaywalker; security; graph theory; goal planning; Dijkstra algorithm; drone monitoring.

Abstract

In recent time, a plenty of “jaywalkers” cause threat to some law-abiding drivers in the city, and the government decides to take some measures to deal with the phenomenon. At present,they want to carry out different surveillance plans for the entire district using a certain number of drones. In order to insure that all the geographic parts are observed in the continuously 15 minutes, I apply a goal planning model, which is base on the graph theory. According to the the model, the result is calculated that 13 drones are needed and the flight route for each drone is decided. Under this condition, each drone could fly safely and accomplish the patrol task. After solving all the problems, we do a sensitivity analysis with the change of the the speed. The stable drone numbers and slightly changed paths showed the robustness of our models. With more precise data and further experiment, the model can be used to provide more suitable scheme.

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Junbo Lu
PY  - 2018/07
DA  - 2018/07
TI  - The Distribution of the Patrol Drone
BT  - Proceedings of the 2018 International Symposium on Communication Engineering & Computer Science (CECS 2018)
PB  - Atlantis Press
SP  - 227
EP  - 229
SN  - 2352-538X
UR  - https://doi.org/10.2991/cecs-18.2018.39
DO  - 10.2991/cecs-18.2018.39
ID  - Lu2018/07
ER  -