FABRICATION OF A DIJKSTRA ALGORITHM BASED ROBOT

Mechanical Engineering

Fabrication of a robot on DIJKSTRA'S algorithm based architecture designed for the purpose of finding the shortest path between the nodes in vehicle navigation. Dijkstra's algorithm is a graph search algorithm that solves the singlesource shortest path problem for a graph with non-negative edge path costs, producing a shortest path tree. For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. In this the data transmission time is increased with the protocol standard. One of the section runs with driver unit and LPC2148 with display unit and another PC as server section runs on a Matlab platform. Communications between two nodes (hardware and application) are accomplished through IEEE 802.15.4. The user can give the source and destination node address to the server section. Using IEEE standard communication protocol the shortest path will be feeded into the robotic module. Using the path as a reference, the robot moves in the ordered direction. After reaching the destination node, the display unit displays the name of the particular node.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.