$\hbox{MAWA}^{\ast}$
| Autor: | Satya Gautam Vadlamudi, Partha Chakrabarti, Sandip Aine |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
Theoretical computer science
Computer science Heuristic Window (computing) General Medicine Data structure Travelling salesman problem Computer Science Applications Human-Computer Interaction Tree (data structure) Memory management Control and Systems Engineering Bounded function Algorithm design Electrical and Electronic Engineering Software Information Systems |
| Zdroj: | IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics). 41:725-735 |
| ISSN: | 1941-0492 1083-4419 |
| DOI: | 10.1109/tsmcb.2010.2089619 |
| 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: |
|