Collision-Free Multi-Robot Navigation Through Independent Path Computation and Local Coordination

References

[1] S. M. LaValle, Planning Algorithms, Cambridge University Press, Cambridge, UK, 2006.

[2] J. van den Berg, M. Lin, and D. Manocha, “Reciprocal velocity obstacles for real-time multiagent navigation,” IEEE International Conference on Robotics and Automation, pp. 1928–1935, 2008.

[3] M. Bennewitz, W. Burgard, and S. Thrun,

[4] D. Fox, W. Burgard, and S. Thrun, “The dynamic window approach to collision avoidance,” IEEE Robotics & Automation Magazine, vol. 4, no. 1, pp. 23–33, 1997.

[5] Y. Guo and L. E. Parker, “A distributed and optimal motion planning approach for multiple mobile robots,” IEEE International Conference on Robotics and Automation, pp. 2612–2619, 2002.

[6] J. Reif and H. Wang, “Social potential fields: A distributed behavioral control for autonomous robots,” Robotics and Autonomous Systems, vol. 27, no. 3, pp. 171–194, 1999.

[7] P. Ogren and N. E. Leonard, “A convergent dynamic window approach to obstacle avoidance,” IEEE Transactions on Robotics, vol. 21, no. 2, pp. 188–195, 2005.

[8] L. E. Kavraki, P. Svestka, J. C. Latombe, and M. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE Transactions on Robotics and Automation, vol. 12, no. 4, pp. 566–580, 1996.

[9] J. Čáp, P. Novák, M. Vokřínek, and R. Švestka, “Multi-agent pathfinding with continuous time,” Autonomous Agents and Multi-Agent Systems, vol. 30, no. 3, pp. 549–579, 2016.

[10] K. Kant and S. W. Zucker, “Toward efficient trajectory planning: The path-velocity decomposition,” The International Journal of Robotics Research, vol. 5, no. 3, pp. 72–89, 1986.

[11] T. Fraichard and H. Asama, “Inevitable collision states—A step towards safer robots?” Advanced Robotics, vol. 18, no. 10, pp. 1001–1024, 2004.

[12] R. Olfati-Saber, “Flocking for multi-agent dynamic systems: Algorithms and theory,” IEEE Transactions on Automatic Control, vol. 51, no. 3, pp. 401–420, 2006.

[13] H. Choset et al., Principles of Robot Motion: Theory, Algorithms, and Implementations, MIT Press, Cambridge, MA, 2005.

[14] J. Yu and S. M. LaValle, “Optimal multirobot path planning on graphs: Complete algorithms and effective heuristics,” IEEE Transactions on Robotics, vol. 32, no. 5, pp. 1163–1177, 2016.

[15] A. Kolling, N. Walker, N. Chakraborty, K. Sycara, and M. Lewis, “Human interaction with robot swarms: A survey,” IEEE Transactions on HumanMachine Systems, vol. 46, no. 1, pp. 9–26, 2016.

[16] Koenig S, Likhachev M. Fast replanning for navigation in unknown terrain. IEEE Transactions on Robotics. 2005; 21(3):354-363.

[17] Ferguson D, Stentz A. Using interpolation to improve path planning: The Field D* algorithm. Journal of Field Robotics.2006; 23(2): 79-101.

[18] Daniel K, Nash A, Koenig S, Felner A. Theta*: Any-Angle Path Planning on Grids. Journal of Artificial Intelligence Re-search. 2010 Oct; 39: 533579.

[19] Wagner G, Choset H. M*: A complete multirobot path planning algorithm with performance bounds. In: 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems; 2011. pp. 3260-3267.

[20] Wagner G, Choset H. Subdimensional expansion for multirobot path planning. Artificial Intelligence. 2015; 219:1-24.

[21] Standley TS. Finding Optimal Solutions to Cooperative Pathfinding Problems. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligences; 2010. pp. 173-178.

[22] Standley TS, Korf RE. Complete Algorithms for Cooperative Pathfinding Problems. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence; 2011.pp. 668-673.

@article{1715558,
      author = {Onkarini Hatwar, Astha Sakarkar, Hiteshri Potarkar, Sahil Bartine, Samay Bharadkar},
      title = {Collision-Free Multi-Robot Navigation Through Independent Path Computation and Local Coordination},
      journal = {Iconic Research And Engineering Journals},
      year = {2026},
      volume = {9},
      number = {9},
      pages = {2710-2715},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1715558.pdf},
      abstract = {This paper presents a decentralized approach for collision-free navigation in multi-robot systems, where each robot independently computes its own path while coordinating locally with neighboring robots to avoid collisions. Unlike centralized path planning methods, the proposed approach eliminates reliance on a global controller and instead emphasizes robot-level autonomy and local interaction. Each robot initially plans a path using a classical single-agent planner and dynamically adjusts its motion when potential collisions are detected. Local coordination strategies such as temporary waiting, speed adjustment, and resolve conflicts in real time. To validate this proposed framework, we developed a comprehensive multirobot simulation environment using Python. The system was tested on various grid maps with static obstacles to evaluate performance metrics such as path efficiency and collision counts. The approach improves scalability, robustness, and adaptability in dynamic environments. Simulation-based experiments demonstrate that the proposed method achieves zero collision rates while maintaining acceptable path efficiency and computational performance. The results indicate that independent path computation combined with local coordination is a practical and effective solution for decentralized multi-robot navigation.},
      keywords = {Multi-Robot Navigation, Collision-Free Path Planning, Decentralized Systems, Autonomous Robots, Local Coordination},
      month = {March},
      doi = {https://doi.org/10.64388/IREV9I9-1715558}
  }