Improved Path-Planning Algorithm for Mobile Robots
Author Information
Author(s): Shi Yongliang, Huang Shucheng, Li Mingxing, Li Wenling
Primary Institution: Jiangsu University of Science and Technology
Hypothesis
Can a novel global and local fusion path-planning algorithm enhance the adaptability and efficiency of mobile robots in complex environments?
Conclusion
The improved fusion path-planning algorithm significantly reduces path redundancy and enhances the adaptability of mobile robots in various environments.
Supporting Evidence
- The proposed algorithm reduces path length and the number of turns compared to existing algorithms.
- Simulation experiments demonstrate higher efficiency and adaptability in complex scenarios.
- The algorithm effectively addresses issues of path redundancy and local optima.
Takeaway
This study created a smarter way for robots to find their paths, making them better at avoiding obstacles and using less energy.
Methodology
The study involved developing a new path-planning algorithm that combines global and local strategies, tested through simulation experiments.
Limitations
The algorithm's performance may vary in highly dynamic environments and with different obstacle distributions.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website