Learning Heuristic Functions through Approximate Linear Programming

Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuristic is not always available. We propose a new approach to learning heuristic functions from previously solved problem instances in a given domain. Our approach is based on approximate linear programming, commonly used in reinforcement learning. We show that our approach can be used effectively to learn admissible heuristic estimates and provide an analysis of the accuracy of the heuristic. When applied to common heuristic search problems, this approach reliably produces good heuristic functions.

• Type: Conference
• Year: 2008
• Where: AIPS
• Authors: Marek Petrik, Shlomo Zilberstein
• Keywords: AIPS 2008, Artificial Intelligence, Heuristic, Heuristic Functions, Heuristic Search