Real-Time Heuristic Search

  title={Real-Time Heuristic Search},
  author={Richard E. Korf},
  journal={Artif. Intell.},
  • R. Korf
  • Published 3 March 1990
  • Computer Science
  • Artif. Intell.

Figures from this paper

Dynamic Control in Path-Planning with Real-Time Heuristic Search

Evaluation in path-planning on videogame maps shows that the new algorithm significantly outperforms fixed-depth, fixed-goal LRTA*, and extensions make real-time heuristic search a practical choice for path- Planning in computer video-games.

Weighted Lateral Learning in Real-Time Heuristic Search

A simple parametric algorithm that combines weighting with learning from multiple neighbors is proposed that outperforms its contemporaries and proves completeness of the algorithm and empirically compare it to several competitors more than twenty years apart.

Evolving Real-time Heuristic Search Algorithms

This paper breaks down several published algorithms into building blocks and then lets a simulated evolution re-combine the blocks in a performance-based way to result in algorithms with state-of-the-art performance.

On Case Base Formation in Real-Time Heuristic Search

A theoretically driven approach to solving the case base formation problem is investigated and an algorithm that addresses properties of a case base to the suboptimality of the solutions it produces is developed and developed.

Lookahead Pathologies and Meta-level Control in Real-Time Heuristic Search

It is demonstrated that looking ahead deeper can actually decrease the chances of taking the optimal action as well as the overall solution quality, known as lookahead pathology, and that selecting lookahead depth dynamically can greatly improve the solution quality.

Lookahead Pathologies for Single Agent Search

This paper demonstrates that it is not necessarily the case that deeper lookahead increases the chances of taking the optimal action, even when admissible and consistent heuristic functions are used.

State Abstraction in Real-Time Heuristic Search

This talk presents recent extensions to LRTA* based on automated state abstraction, an idea that has proved powerful in other areas of search and learning and is found to improve efficiency by trading off planning time, learning speed and other antagonistic performance measures.

Real-Time Heuristic Search with a Priority Queue

P-LRTA* focuses learning on important areas of the search space, where the importance of a state is determined by the magnitude of the updates made to neighboring states, and shows a substantial learning speed-up over state-of-the-art real-time search algorithms.

Metareasoning in Real-Time Heuristic Search

This work explores the use of metareasoning at two decision points within a real-time heuristic search, and shows that considering these decisions carefully can reduce the agent's total time taken to arrive at a goal in several benchmark domains, relative to the current state-of-the-art.

Deadline-Aware Search Using On-Line Measures of Behavior

This work proposes a new approach, Deadline Aware Search, that explicitly takes the deadline into account and attempts to use all available time to find a single high-quality solution.



Real-Tme Heuristic Search: New Results

It is shown that the search depth achievable with alpha pruning for a given amount of computation actually increases with increasing branching factor, and it is proved that real-time-A* (RTA*) makes locally optimal decisions given the heuristic information available to it on a tree.

Real-Time Heuristic Search: First Results

A special case of minimax lookahead search and an analog of alpha-beta pruning that significantly improves the efficiency of the algorithm are presented, and a new algorithm is presented for searching when actions must actually be executed, as opposed to merely simulated.

Look-Ahead and One-Person Games

An attempt is presented to relate look-ahead to the notion of “informedness” introduced by Hart, Nilsson, and Raphael.

Programming a computer for playing chess

This paper is concerned with the problem of constructing a computing routine or “program” for a modern general purpose computer which will enable it to play chess. Although perhaps of no practical

A Formal Basis for the Heuristic Determination of Minimum Cost Paths

How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.

The Sciences of the Artificial

Continuing his exploration of the organization of complexity and the science of design, this new edition of Herbert Simon's classic work on artificial intelligence adds a chapter that sorts out the

XXII. Programming a Computer for Playing Chess 1

(1950). XXII. Programming a computer for playing chess. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science: Vol. 41, No. 314, pp. 256-275.

The Sciences of the Arf$cial

  • The Sciences of the Arf$cial
  • 1981