Abstract
Robot path planning in known and dynamic environments is feasible for mobile robots and its main purpose is to find a collision free path for a robot from an initial position to a goal position in an environment with obstacles. In this paper the goal position is assumed to be moving over the time. Also our environment includes moving obstacles as well as static ones. We present a new approach for path planning mobile robots using Particle Swarm Optimization in order to minimize total path planning time while avoiding the local optimums. Simulation is used to validate and illustrate the approach.
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.
