Určení optimální trajektorie pomocí metod umělé inteligence

Abstract

This bachelor's thesis deals with methods of artificial intelligence used to find the shortest trajectory. Breadth-first search, Depth-first search and A* algorithm are used to solve this issue, but other methods of artificial intelligence and analysis of function of other effective algorithms are not forgotten. Output of this thesis is functional application designed in programming environment LabVIEW program. Aplication visually simulates task of a robot in a labyrinth, whose goal is to reach the treasure. Robot can be controlled automatically through chosen algorithm, but also manually with arrow buttons. Comparison of algorithms effectivity based on discovered results for certain maps of the labyrinthm is part of this thesis. Projected system is solely software based and it could be applied on academical ground as a demonstration of progress of the shortest path algorithms. The final application is expandable, scalable, supplementable and it fulfils standards of NI.