Application of Backtracking Algorithm for Offline Robot Transport

The backtracking algorithm is a notable technique for addressing pathfinding challenges, especially in robotic navigation. This research employs the algorithm for offline robotic transportation, concentrating on the determination of optimal routes in intricate situations. The methodology entails examining robotic locomotion on a grid-based landscape featuring obstacles and contrasting sliding and traditional moving tactics. Empirical testing utilizing a physical map was performed to corroborate the simulation results. The findings revealed three possible routes, with the second trajectory consistently demonstrating greater performance. The sliding movement for the second path averaged 20.33 seconds, whereas the conventional method needed 22.67 seconds, underscoring the sliding mechanism's superior efficiency in minimizing navigation time. The sliding motion exhibited exceptional effectiveness across all trajectories. The findings affirm that the backtracking algorithm is successful for offline robot transport and possesses potential for dynamic and real-time robotic systems.