Abstract
Path planning is an important technique to realize robot navigation. In this paper, through using Bezier curves, it is transfermed into an optimization problem. An improved dynamic multi-swarm particle swarm optimizer with cross operator is proposed to do this task. Through a set of experiments on four predefined path planning problems, the proposed algorithm proves its effectiveness on this kind of problems.
Sign-in/Register to access full text options 
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.
