Planning of Diverse Trajectories

Jan Tožička, David Šišlákand, Michal Pěchouček


Unmanned aerial vehicles (UAVs) are more and more often used to solve different tasks in both the private and the public sector. Some of these tasks can often be performed completely autonomously while others are still dependent on remote pilots. They control an UAV using a command display where they can control it manually using joysticks or give it a simple task. The command display allow for the planning of the UAV trajectory through waypoints while avoiding no-fly zones. Nevertheless, the operator can be aware of other preferences or soft restrictions for which it’s not feasible to be inserted into the system especially during time critical tasks. We propose to provide the operator with several different alternative trajectories, so he can choose the best one for the current situation. In this contribution we propose several metrics to measure the diversity of the trajectories. Then we explore several algorithms for the alternative trajectories creation. Experimental results in two grid domains show how the proposed algorithms perform.


  1. Aurenhammer, F. (1991). Voronoi diagrams - A survey of a fundamental geometric data structure. ACM Computer Survey, 23(3):345-405.
  2. Coman, A. and Mun˜oz-Avila, H. (2011). Generating diverse plans using quantitative and qualitative plan distance metrics. In AAAI. AAAI Press.
  3. Fikes, R. E. and Nilsson, N. J. (1971). Strips: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2(3-4):189-208.
  4. Fortune, S. (1997). Handbook of Discrete and Computational Geometry, chapter Voronoi diagrams and Delaunay triangulations, pages 377-388. CRC Press LLC.
  5. Garrido, S., Moreno, L., and Blanco, D. (2006). Voronoi diagram and fast marching applied to path planning. In Proceedings of the 2006 IEEE International Conference on Robotics and Automation, ICRA 2006, pages 3049-3054. IEEE.
  6. Hart, P., Nilsson, N., and Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, (2):100-107.
  7. Hui-ying, D., Shuo, D., and Yu, Z. (2010). Delaunay graph based path planning method for mobile robot. In Communications and Mobile Computing (CMC), 2010 International Conference on, volume 3, pages 528-531.
  8. Nash, A., Daniel, K., Koenig, S., and Felner, A. (2007). Theta*: Any-angle path planning on grids. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pages 1177-1183.
  9. Yap, P. (2002). Grid-based path-finding. In Proceedings of the Canadian Conference on Aritificial Intelligence, pages 44-55.

Paper Citation

in Harvard Style

Tožička J., Šišlákand D. and Pěchouček M. (2013). Planning of Diverse Trajectories . In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-8565-39-6, pages 120-129. DOI: 10.5220/0004254601200129

in Bibtex Style

author={Jan Tožička and David Šišlákand and Michal Pěchouček},
title={Planning of Diverse Trajectories},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},

in EndNote Style

JO - Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Planning of Diverse Trajectories
SN - 978-989-8565-39-6
AU - Tožička J.
AU - Šišlákand D.
AU - Pěchouček M.
PY - 2013
SP - 120
EP - 129
DO - 10.5220/0004254601200129