Abstract
Aiming to address the problem of robot path planning in environments containing narrow passages, this paper proposes a novel global path planning method: the DSR (Dual-source Light Continuous Reflection Exploration) algorithm. This algorithm, inspired by the natural reflection of light, employs the concept of continuous reflection for path planning. It can efficiently generate an asymptotically optimal path on the map containing narrow passages. The DSR algorithm has been evaluated on different maps with narrow passages and compared with other algorithms. In comparison with the bidirectional Rapidly-exploring Random Tree algorithm, the DSR algorithm achieves a significant reduction in both path length (by 27.08% and 34.35%) and time consumption (by 98.47% and 91.03%). Numerical simulations and experimental analysis have demonstrated the excellent performance of the DSR algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
