Abstract
In this paper, a new genetic algorithm (GA) for solving the path planning in dynamic environments is proposed. The new genetic algorithm uses local maps, therefore, does not require the knowledge of exact or estimated position of the destination point as other approaches in the literature. Consequently, the new GA could be used to solve the problem of dynamic path planning under an assumption that makes the problem more restrictive but more close to reality (in searching tasks).
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.
