Vysoké učení technické v Brně. Fakulta informačních technologií
Abstract
This thesis deals with methods of path-finding for robot, rather path-finding with Bug algorithms and Potential fields. The thesis descibes individual Bug Algorithms just as theoretical principles of Potential fields and planning paths in this fields. To better demonstration of these algorithms were created java applets. Design, implementation and control over these applets is also described in this thesis
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.