Speeding Up the Convergence of Online Heuristic Search and Scaling Up Offline Heuristic Search
The most popular methods for solving the shortest-path problem in Artificial Intelligence are heuristic search algorithms. The main contributions of this research are new heuristic search algorithms that are either faster or scale up to larger problems than existing algorithms. Our contributions app...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en_US |
| Published: |
Georgia Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/4855 |