| Autor: |
Satya Gautam, Vadlamudi, Sandip, Aine, Partha Pratim, Chakrabarti |
| Rok vydání: |
2010 |
| Předmět: |
|
| Zdroj: |
IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society. 41(3) |
| ISSN: |
1941-0492 |
| Popis: |
This paper presents a heuristic-search algorithm called Memory-bounded Anytime Window A∗ (MAWA∗), which is complete, anytime, and memory bounded. MAWA∗ uses the window-bounded anytime-search methodology of AWA∗ as the basic framework and combines it with the memory-bounded A∗ -like approach to handle restricted memory situations. Simple and efficient versions of MAWA∗ targeted for tree search have also been presented. Experimental results of the sliding-tile puzzle problem and the traveling-salesman problem show the significant advantages of the proposed algorithm over existing methods. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
