Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Admissibility of AO* when heuristics overestimate
Artificial Intelligence
The multiple sequence alignment problem in biology
SIAM Journal on Applied Mathematics
Artificial Intelligence
Do the right thing: studies in limited rationality
Do the right thing: studies in limited rationality
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
Artificial Intelligence
A new approach to dynamic weighting
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Linear-space best-first search
Artificial Intelligence
Theoretical Computer Science - Special issue: Genome informatics
Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
Journal of the ACM (JACM)
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
LAO: a heuristic search algorithm that finds solutions with loops
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
A* with Partial Expansion for Large Branching Factor Problems
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Multiple sequence alignment using anytime A*
Eighteenth national conference on Artificial intelligence
Controlling the learning process of real-time heuristic search
Artificial Intelligence
Anytime Heuristic Searc: First Results TITLE2:
Anytime Heuristic Searc: First Results TITLE2:
Performance measurement and analysis of certain search algorithms.
Performance measurement and analysis of certain search algorithms.
K-Group A* for Multiple Sequence Alignment with Quasi-Natural Gap Costs
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
The 3rd international planning competition: results and analysis
Journal of Artificial Intelligence Research
Bidirectional heuristic search reconsidered
Journal of Artificial Intelligence Research
K-best: a new method for real-time decision making
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Anytime search in dynamic graphs
Artificial Intelligence
Anytime heuristic search for partial satisfaction planning
Artificial Intelligence
Where do we go now?: anytime algorithms for path planning
Proceedings of the 4th International Conference on Foundations of Digital Games
Weighted A∗ search -- unifying view and application
Artificial Intelligence
Graph abstraction in real-time heuristic search
Journal of Artificial Intelligence Research
Best-first heuristic search for multi-core machines
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A coarse-to-fine approach for fast path finding for mobile robots
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
A survey and classification of A* based best-first heuristic search algorithms
SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
A weighted CSP approach to cost-optimal planning
AI Communications
The LAMA planner: guiding cost-based anytime planning with landmarks
Journal of Artificial Intelligence Research
Best-first heuristic search for multicore machines
Journal of Artificial Intelligence Research
Mobile robots navigation based on graph search techniques
ECCE'10/ECCIE'10/ECME'10/ECC'10 Proceedings of the European conference of chemical engineering, and European conference of civil engineering, and European conference of mechanical engineering, and European conference on Control
Heuristic search under quality and time bounds
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Algorithms for generating ordered solutions for explicit and/or structures
Journal of Artificial Intelligence Research
Analysis of solutions to the time-optimal planning and execution problem
Intelligent Service Robotics
Light-assisted A* path planning
Engineering Applications of Artificial Intelligence
Anytime algorithms for biobjective heuristic search
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
ARA*+: Improved Path Planning Algorithm Based on ARA*
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Landmark-based heuristics and search control for automated planning (extended abstract)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A hierarchical approach for primitive-based motion planning and control of autonomous vehicles
Robotics and Autonomous Systems
Heuristic search when time matters
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
We describe how to convert the heuristic search algorithm A* into an anytime algorithm that finds a sequence of improved solutions and eventually converges to an optimal solution. The approach we adopt uses weighted heuristic search to find an approximate solution quickly, and then continues the weighted search to find improved solutions as well as to improve a bound on the suboptimality of the current solution. When the time available to solve a search problem is limited or uncertain, this creates an anytime heuristic search algorithm that allows a flexible tradeoff between search time and solution quality. We analyze the properties of the resulting Anytime A* algorithm, and consider its performance in three domains; sliding-tile puzzles, STRIPS planning, and multiple sequence alignment. To illustrate the generality of this approach, we also describe how to transform the memory-efficient search algorithm Recursive Best-First Search (RBFS) into an anytime algorithm.