Abstract

In this paper, a new approach is presented for getting a solution of the mobile robot path planning problem based on Adaptive Particle Swarm Optimization (APSO). The proposed APSO algorithm is smarter than conventional PSO and widely used for solving the real time problems. In this work an objective function is framed considering the distance between robot to goal and obstacle respectively. The objective function is optimized with of APSO for solving the path planning process of robot. The different simulated experiments are performed to test the ability of the proposed algorithm. The performance of the robot path planning using APSO is compared to the performance of the conventional PSO in terms path length and time in static environments. It is focused that using new approach the robot can successfully avoid obstacle and reach the target with shorter time than conventional PSO.

Full Text
Paper version not known

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 call

Disclaimer: 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.