What is it about?
• The Mobile Robot Path Planning Problem is solved via the novel Dhouib-Matrix-SPP (DM-SPP) method. • The environment of the Mobile Robot is modelized as a grid map with static obstacles. • For this problem, DM-SPP requires a maximal time complexity of O(9*n) where n is the number of nodes. • The rapidity and the accuracy of DM-SPP is proved on eleven grid maps with comparison to twelve metaheuristics.
Featured Image
Photo by Johannes Plenio on Unsplash
Why is it important?
Clearly, DM-SPP exceeds all the other artificial intelligence methods and it can be concluded that DM-SPP is the fastest artificial intelligence method for the Mobile Robot Path Planning Problem.
Perspectives
Following this work, the ability of DM-SPP in unraveling the robot path planning problem in a 3D situation will be tested.
Prof. Souhail Dhouib
Universite de Sfax
Read the Original
This page is a summary of: Shortest path planning via the rapid Dhouib-Matrix-SPP (DM-SPP) method for the autonomous mobile robot, Results in Control and Optimization, December 2023, Elsevier,
DOI: 10.1016/j.rico.2023.100299.
You can read the full text:
Contributors
The following have contributed to this page
