Grafická vizualizace optimalizace trasy a procesu třídění

Abstract

Bachelor thesis deals with robot route optimization. In the introduction describes the basics of graph theory and four algorithms. Then the algorithms are evaluated and for that task was chosen a suitable optimization algorithm. The optimization task is defining, including their limitations and initial conditions. Visualization of the route optimization is processed as a graphical user application with a choice of parameters for better clarity. The solution for optimization tasks are processed by several partial program functions. Firstly, program functions solve the creation of manipulation space and the random generate of the objects. Then identifies all possible access paths. And the last part of the program is to find the shortest paths for objects which have the same color and they sort into the containers.