This project documents the implementation of a path finding robot simulation. The application has been programmed in Java 6, and is not intended to include any user interaction. The application is primarily made up of a Robot, a Map and a Path Finding algorithm. The application has been programmed with a theoretical base in Path Finding Algorithms as well as Behaviourally Based Robotics and Object Oriented Programming allows it to be transferred to a Lego NXT Brick allowing it to be used on a Lego MINDSTORMS™ robot. The application has been programmed with a degree of success and in conclusion the A* search algorithm in conjunction with behavioural robotics has made it possible for a simulated robot to successfully explore and determine the fastest route between points in a static but unexplored environment.
|Uddannelser||Datalogi, (Bachelor/kandidatuddannelse) Bachelor el. kandidat|
|Udgivelsesdato||21 jan. 2011|
- Path finding