A comparative study between on-line and off-line navigations on intelligent transportation system

In this paper, we compare off-line and online path-planning algorithms and seek for a possibility to design an efficient path-planning algorithm for multiple mobile robots. In general, an off-line path-planning algorithm always selects the shortest path for a robot, but it is time consuming because of combination search. On the other hand, an online path-planning algorithm quickly picks up a reasonable path but does not always find any path for a complex swarm of encountered robots. In this research, we compare two different path-planning algorithms with each other, and describe a possibility to develop their fusion path-planning algorithm for multiple mobile robots