Abstract
We present an Evolutionary Planning and Replanning Algorithm, capable of producing Bounded Suboptimal solutions in an Anytime fashion. Combining Genetic Algorithm with anytime approach is uncommon. Anytime Genetic algorithm combines the benefits of an Anytime and an Evolutionary Algorithm to efficiently provide solutions to complex, Dynamic Search Problems. The results appear promising for shorter horizon problems, while for large horizon the search tends to behave like a standard GA
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.
