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.
| Original language | English |
|---|---|
| Title of host publication | Materials Science and Information Technology, MSIT2011 |
| Pages | 3302-3307 |
| Number of pages | 6 |
| DOIs | |
| Publication status | Published - 2012 |
| Event | International Conference on Materials Science and Information Technology (MSIT) 2011 - Singapore, Singapore Duration: 16 Sept 2011 → 18 Sept 2011 Conference number: 2nd https://www.scientific.net/AMR.433-440/book |
Publication series
| Name | Advanced Materials Research |
|---|---|
| Volume | 433-440 |
| ISSN (Print) | 1022-6680 |
Conference
| Conference | International Conference on Materials Science and Information Technology (MSIT) 2011 |
|---|---|
| Abbreviated title | MSIT 2011 |
| Country/Territory | Singapore |
| Period | 16/09/11 → 18/09/11 |
| Internet address |
Keywords
- A*
- Anytime algorithm
- Contract anytime GA(CAGA)
- Dynamic search
- Genetic algorithms
- Interruptible anytime GA (IAGA)
- Multi-objective shortest path problem
- Path planning problem
- Robot navigation