[14] Yoav Gabriely and Elon Rimon. Spanning-tree based coverage of continuous areas by a mobile
robot.
Annals of Mathematics and Artificial Intelligence, 31(1):77–98, Oct 2001.
[15] Enric Galceran and Marc Carreras. A survey on coverage path planning for robotics.
Robotics
and Autonomous Systems, 61(12):1258 – 1276, 2013.
[16] Quentin Galvane.
Automated cinematography with unmanned aerial vehicles.
Eurographics
Workshop on Intelligent Cinematography and Editing, pages 23–30, 01 2016.
[17] Masoud Gheisari and Behzad Esmaeili. Unmanned aerial systems (uas) for construction safety
applications. pages 2642–2650, 05 2016.
[18] R.L. Graham and Pavol Hell. On the history of the minimum spanning tree problem.
Annals of
the History of Computing, 7:43–57, 02 1985.
[19] Malcolm J. Zapata, William J. Haynes, Nicholas Kannen, Megan Sullivan, and James Conrad. An
autonomous vehicle for space exploration. pages 15–20, 05 2008.
[20] Aubrey John Russell. Android drone: Remote quadcopter control with a phone. 12 2016.
[21] Dušan Jovanović, Miro Govedarica, and Dejan Rašić. Remote sensing as a trend in agriculture.
Research Journal of Agricultural Science, 46:32–37, 09 2014.
[22] Athanasios Ch Kapoutsis, Savvas A Chatzichristofis, and Elias B Kosmatopoulos. Darp: Divide
areas algorithm for optimal multi-robot coverage path planning.
Journal of Intelligent & Robotic
Systems, 86(3):663–680, 2017.
[23] Kostas Karantininis.
Overview of Greek Agriculture, pages 5–11. 08 2017.
[24] Piotr Kardasz and Jacek Doskocz. Drones and possibilities of their using.
Journal of Civil and
Environmental Engineering, 6, 01 2016.
[25] Muhammad Khan, Bilal A. Alvi, Engr Safi, and Inam Khan. Drones for good in smart cities:a
review. 01 2018.
[26] Joseph B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman
problem.
Proceedings of the American Mathematical Society, 7(1):48–50, 1956.
[27] Jean-Claude Latombe.
Approximate Cell Decomposition, pages 248–294. Springer US, Boston, MA,
1991.
[28] Martin Mares. The saga of minimum spanning trees.
Computer Science Review, 2:165–221, 12
2008.
[29] Rolf Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, and Thomas Willhalm. Partitioning
graphs to speed up dijkstra’s algorithm. volume 3503, pages 189–202, 05 2005.
[30] Thomas Misa.
History of Technology, volume 30, pages 5 – 17. 04 2009.
63