Potential-based bounded-cost search and Anytime Non-Parametric A*

This paper presents two new search algorithms: Potential Search (PTS) and Anytime Potential Search/Anytime Non-Parametric A? (APTS/ANA?). Both algorithms are based on a new evaluation function that is easy to implement and does not require user-tuned parameters. PTS is designed to solve bounded-cost search problems, which are problems where the task is to find as fast as possible a solution under a given cost bound. APTS/ANA? is a non-parametric anytime search algorithm discovered independently by two research groups via two very different derivations. In this paper, co-authored by researchers from both groups, we present these derivations: as a sequence of calls to PTS and as a non-parametric greedy variant of Anytime Repairing A?. We describe experiments that evaluate the new algorithms in the 15-puzzle, KPP-COM, robot motion planning, gridworld navigation, and multiple sequence alignment search domains. Our results suggest that when compared with previous anytime algorithms, APTS/ANA?: (1) does not require user-set parameters, (2) finds an initial solution faster, (3) spends less time between solution improvements, (4) decreases the suboptimality bound of the current-best solution more gradually, and (5) converges faster to an optimal solution when reachable.

[1]  J. Morgan.  Landmarks? , 2013 .

[2]  Jonathan Schaeffer,et al.  Duality in permutation state spaces and the dual search algorithm , 2008, Artif. Intell..

[3]  Rami Puzis,et al.  Finding the most prominent group in complex networks , 2007, AI Commun..

[4]  Kobayashi,et al.  Improvement of the A(*) Algorithm for Multiple Sequence Alignment. , 1998, Genome informatics. Workshop on Genome Informatics.

[5]  Eric A. Hansen,et al.  Anytime Heuristic Search , 2011, J. Artif. Intell. Res..

[6]  S. Altschul,et al.  A tool for multiple sequence alignment. , 1989, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Shlomo Zilberstein,et al.  Using Anytime Algorithms in Intelligent Systems , 1996, AI Mag..

[8]  Osmar R. Zaïane,et al.  A parameterless method for efficiently discovering clusters of arbitrary shape in large datasets , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[9]  Wheeler Ruml,et al.  Anytime Heuristic Search: Frameworks and Algorithms , 2010, SOCS.

[10]  Marc Boullé,et al.  A Parameter-Free Classification Method for Large Scale Learning , 2009, J. Mach. Learn. Res..

[11]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[12]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[13]  Roni Stern,et al.  Using Lookaheads with Optimal Best-First Search , 2010, AAAI.

[14]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[15]  Ken Goldberg,et al.  ANA*: anytime nonparametric A* , 2011, AAAI 2011.

[16]  Alessandro Zanarini,et al.  Solution counting algorithms for constraint-centered search heuristics , 2008, Constraints.

[17]  Carmel Domshlak,et al.  Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.

[18]  Wheeler Ruml,et al.  When Does Weighted A* Fail? , 2012, SOCS.

[19]  Peter J. Stuckey,et al.  Optimal Sum-of-Pairs Multiple Sequence Alignment Using Incremental Carrillo and Lipman Bounds , 2006, J. Comput. Biol..

[20]  Ido Dagan,et al.  Efficient Search for Transformation-based Inference , 2012, ACL.

[21]  Wheeler Ruml,et al.  Faster than Weighted A*: An Optimistic Approach to Bounded Suboptimal Search , 2008, ICAPS.

[22]  Kenneth Y. Goldberg,et al.  Anytime Nonparametric A , 2011, AAAI.

[23]  Malte Helmert,et al.  How Good is Almost Perfect? , 2008, AAAI.

[24]  Wheeler Ruml,et al.  Bounded Suboptimal Search: A Direct Approach Using Inadmissible Estimates , 2011, IJCAI.

[25]  Rami Puzis,et al.  Potential Search: A Bounded-Cost Search Algorithm , 2011, ICAPS.

[26]  Sandra Zilles,et al.  Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract) , 2012, SOCS.

[27]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[28]  Ido Dagan,et al.  A Confidence Model for Syntactically-Motivated Entailment Proofs , 2011, RANLP.

[29]  David Furcy,et al.  Maximizing over multiple pattern databases speeds up heuristic search , 2006, Artif. Intell..

[30]  P. P. Chakrabarti,et al.  Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds , 1991, Artif. Intell..

[31]  Ariel Felner.  Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm , 2011, SOCS.

[32]  Wheeler Ruml,et al.  Iterative-Deepening Search with On-Line Tree Size Prediction , 2012, LION.

[33]  Jörg Hoffmann,et al.  Improving Local Search for Resource-Constrained Planning , 2010, SOCS.

[34]  Eric A. Hansen,et al.  Beam-Stack Search: Integrating Backtracking with Beam Search , 2005, ICAPS.

[35]  Patrik Haslum.  Heuristics for Bounded-Cost Search , 2013, ICAPS.

[36]  Malte Helmert,et al.  The Fast Downward Planning System , 2006, J. Artif. Intell. Res..

[37]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[38]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[39]  S. Borgatti,et al.  The centrality of groups and classes , 1999 .

[40]  Wheeler Ruml,et al.  The Joy of Forgetting: Faster Anytime Search via Restarting , 2010, ICAPS.

[41]  Wheeler Ruml,et al.  Best-First Utility-Guided Search , 2007, IJCAI.

[42]  Rami Puzis,et al.  Incremental deployment of network monitors based on Group Betweenness Centrality , 2009, Inf. Process. Lett..

[43]  Hiroshi Imai,et al.  Enhanced A* Algorithms for Multiple Alignments: Optimal Alignments for Several Sequences and k-Opt Approximate Alignments for Large Cases , 1999, Theoretical Computer Science.

[44]  Wheeler Ruml,et al.  Using Distance Estimates in Heuristic Search , 2009, ICAPS.

[45]  Stephen P. Boyd,et al.  Branch and Bound Methods , 1987 .

[46]  Richard E. Korf,et al.  Performance of Linear-Space Search Algorithms , 1995, Artif. Intell..

[47]  Richard E. Korf,et al.  Linear-Space Best-First Search , 1993, Artif. Intell..

[48]  Ira Pohl,et al.  Heuristic Search Viewed as Path Finding in a Graph , 1970, Artif. Intell..

[49]  Rami Puzis,et al.  Potential Search: A New Greedy Anytime Heuristic Search , 2010, SOCS.

[50]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[51]  Ronen I. Brafman,et al.  Compiling Conformant Probabilistic Planning Problems into Classical Planning , 2013, ICAPS.

[52]  W. W. Johnson,et al.  Notes on the "15" Puzzle , 1879 .

[53]  Judea Pearl,et al.  Studies in Semi-Admissible Heuristics , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[54]  David Furcy,et al.  Limited Discrepancy Beam Search , 2005, IJCAI.

[55]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[56]  Malte Helmert,et al.  Better Parameter-Free Anytime Search by Minimizing Time Between Solutions , 2012, SOCS.

[57]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[58]  Fernando G. Lobo,et al.  A parameter-less genetic algorithm , 1999, GECCO.

[59]  Sebastian Thrun,et al.  ARA*: Anytime A* with Provable Bounds on Sub-Optimality , 2003, NIPS.

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

[61]  Ira Pohl,et al.  The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving , 1973, IJCAI.

[62]  Wheeler Ruml,et al.  Deadline-Aware Search Using On-Line Measures of Behavior , 2011, SOCS.

[63]  Richard E. Korf,et al.  Time complexity of iterative-deepening-A* , 2001, Artif. Intell..

[64]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[65]  P. P. Chakrabarti,et al.  AWA* - A Window Constrained Anytime Heuristic Search Algorithm , 2007, IJCAI.

[66]  Nathan R. Sturtevant,et al.  Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms , 2010, SOCS.

[67]  Hector Geffner,et al.  Heuristic Planning with Time and Resources , 2014 .

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

[69]  Sandra Zilles,et al.  Predicting the size of IDA*'s search tree , 2013, Artif. Intell..

[70]  Teruhisa Miura,et al.  A* with Partial Expansion for Large Branching Factor Problems , 2000, AAAI/IAAI.

[71]  Weixiong Zhang,et al.  Depth-First Branch-and-Bound versus Local Search: A Case Study , 2000, AAAI/IAAI.

[72]  Hiroshi Imai,et al.  Fast A Algorithms for Multiple Sequence Alignment , 1994 .

[73]  Wheeler Ruml,et al.  Faster Bounded-Cost Search Using Inadmissible Estimates , 2012, ICAPS.