Abstract: Efficient navigation in obstructed environments poses a significant challenge for autonomous robots, particularly in industrial settings where safe and effective movement through complex ...

Abstract: Under broad application, the shortest path problem in graph-based network environments is generally treated with the use of Dijkstra's Algorithm. Due to the accelerating development of ...

This project focuses on graph theory, graph connectivity, and algorithms for finding the shortest path and shortest circuit. It is an assignment for the Discrete Mathematics for Computer Science ...