The Heuristic Search Research Framework

Abstract The Heuristic Search Research Framework is a software framework for conducting studies of heuristic search algorithms. The framework is more than a set of building blocks that facilitate the production of flexible and efficient implementations of heuristic search algorithms. The intended uses that distinguish this framework are: (1) gaining of insights into properties of search algorithms through a variety of means, (2) easy production of examples that can be used both for conference presentations and to teach heuristic search to students and (3) using policy-based design for building a taxonomy of implemented algorithmic variants. The paper presents the motivation behind the framework’s design and provides a short description of the framework’s features with examples. The paper is supplemented by extensive documentation that includes a video demo.

[1]  Sebastian Thrun,et al.  Anytime search in dynamic graphs , 2008, Artif. Intell..

[2]  Roni Stern,et al.  The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding , 2011, IJCAI.

[3]  Richard E. Korf,et al.  Additive Pattern Database Heuristics , 2004, J. Artif. Intell. Res..

[4]  Amnon Meisels,et al.  Conflict Directed Backjumping for Max-CSPs , 2007, IJCAI.

[5]  Nathan R. Sturtevant,et al.  A Comparison of High-Level Approaches for Speeding Up Pathfinding , 2010, AIIDE.

[6]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[7]  Nathan R. Sturtevant,et al.  Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding. , 2012 .

[8]  Hector Geffner Search and Inference in AI Planning , 2005, CP.

[9]  Richard E. Korf,et al.  Disjoint pattern database heuristics , 2002, Artif. Intell..

[10]  Allen Newell,et al.  Computer science as empirical inquiry: symbols and search , 1976, CACM.

[11]  Trevor Scott Standley Finding Optimal Solutions to Cooperative Pathfinding Problems , 2010, AAAI.

[12]  Malte Helmert,et al.  Relative-Order Abstractions for the Pancake Problem , 2010, ECAI.

[13]  Blai Bonet,et al.  Planning as Heuristic Search: New Results , 1999, ECP.

[14]  Andrei Alexandrescu,et al.  Modern C++ design: generic programming and design patterns applied , 2001 .

[15]  Hector Geffner,et al.  Heuristic Search for Generalized Stochastic Shortest Path MDPs , 2011, ICAPS.