Graph Neural Network-Based Motion Planning for Mobile Robots

  • Authors

    • Ken Iverson Professor, Harvard University, Canada Author
    • David Parnas Professor, McMaster University, Canada Author

    DOI:

    https://doi.org/10.67228/30715725/IJIARE-2025PII7M2K

    Published 10-05-2025

  • Graph Neural Networks (Gnn), Mobile Robots, Motion Planning, Autonomous Navigation, Deep Learning, Graph Convolution Networks, Path Planning, Artificial Intelligence, Robotics

    Issue

    Vol. 8 No. 2 (2025)

    Section

    Articles

  • Abstract

    Motion planning is a fundamental challenge in autonomous mobile robotics, requiring robots to navigate efficiently in dynamic and uncertain environments. Traditional algorithms such as Dijkstra, A*, RRT, and PRM perform well in structured settings but often struggle with moving obstacles, high computational costs, and limited adaptability. Recent advances in Artificial Intelligence, particularly Graph Neural Networks (GNNs), provide a more effective solution by representing robotic environments as graphs, where nodes denote robot states or waypoints and edges represent feasible movements. Through message passing and graph-based learning, GNNs capture both local and global spatial relationships, enabling efficient path planning, obstacle avoidance, and trajectory optimization in complex environments. This paper reviews major GNN architectures, including Graph Convolutional Networks (GCNs), Graph Attention Networks (GATs), GraphSAGE, and Message Passing Neural Networks (MPNNs), and discusses their applications in warehouse automation, autonomous vehicles, service robots, drones, and search-and-rescue missions. It also highlights current challenges such as limited interpretability, high training costs, insufficient benchmark datasets, and real-time deployment constraints. Overall, GNNs represent a promising direction for scalable, adaptive, and intelligent robotic motion planning.

  • References

    [1] E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, no. 1, pp. 269–271, 1959.

    [2] P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,” IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100–107, 1968.

    [3] S. M. LaValle, Planning Algorithms. Cambridge, U.K.: Cambridge University Press, 2006.

    [4] L. E. Kavraki, P. Švestka, J.-C. Latombe, and M. H. 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.

    [5] S. M. LaValle and J. J. Kuffner Jr., “Rapidly-exploring random trees: Progress and prospects,” Algorithmic and Computational Robotics: New Directions, pp. 293–308, 2001.

    [6] O. Khatib, “Real-time obstacle avoidance for manipulators and mobile robots,” The International Journal of Robotics Research, vol. 5, no. 1, pp. 90–98, 1986.

    [7] Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” Nature, vol. 521, no. 7553, pp. 436–444, 2015.

    [8] V. Mnih et al., “Human-level control through deep reinforcement learning,” Nature, vol. 518, no. 7540, pp. 529–533, 2015.

    [9] J. Schulman, F. Wolski, P. Dhariwal, A. Radford, and O. Klimov, “Proximal policy optimization algorithms,” arXiv preprint arXiv:1707.06347, 2017.

    [10] T. P. Lillicrap et al., “Continuous control with deep reinforcement learning,” International Conference on Learning Representations (ICLR), 2016.

    [11] T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” International Conference on Learning Representations (ICLR), 2017.

    [12] P. Veličković et al., “Graph attention networks,” International Conference on Learning Representations (ICLR), 2018.

    [13] W. L. Hamilton, R. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” Advances in Neural Information Processing Systems (NeurIPS), vol. 30, 2017.

    [14] J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” Proceedings of the 34th International Conference on Machine Learning (ICML), pp. 1263–1272, 2017.

    [15] Y. Li, D. Tarlow, M. Brockschmidt, and R. Zemel, “Gated graph sequence neural networks,” International Conference on Learning Representations (ICLR), 2016.

    [16] Gajula, S. (2024). Cybersecurity risk prediction using graph neural networks. Journal of Information Systems Engineering and Management.

    [17] Gajula, S. (2024). Adaptive zero trust architecture for securing financial microservices. Computer Fraud & Security, 2024(12), 643–655. https://doi.org/10.52710/cfs.845

  • Downloads

Similar Articles

71-80 of 97

You may also start an advanced similarity search for this article.