Detecting Mutex Pairs in State Spaces by Sampling

In the context of state space planning, a mutex pair is a pair of variable-value assignments that does not occur in any reachable state. Detecting mutex pairs is a problem that has been addressed frequently in the planning literature. In this paper, we present the Missing Mass Method (MMM)–a new efficient and domain-independent method for mutex pair detection, based on sampling reachable states. We exploit a recent result from statistical theory, proven by Berend and Kontorovich ina[1], that bounds the probability mass of missing events in a sample of a given size. We tested MMM empirically on various sizes of four standard benchmark domains from the planning and heuristic search literature. In many cases, MMM works perfectly, i.e., finds all and only the mutex pairs. In the other cases, it is near-perfect: it correctly labels all mutex pairs and more than 99.99% of all non-mutex pairs.

[1]  D. Berend,et al.  The Missing Mass Problem , 2011, 1111.2328.

[2]  Yixin Chen,et al.  Long-Distance Mutual Exclusion for Propositional Planning , 2007, IJCAI.

[3]  Sandra Zilles,et al.  Using Coarse State Space Abstractions to Detect Mutex Pairs , 2013, SARA.

[4]  Malte Helmert,et al.  The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem , 2010, ICAPS.

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

[6]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[7]  Larry S. Davis,et al.  Pattern Databases , 1979, Data Base Design Techniques II.

[8]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[9]  R. Holte Psvn: a V Ector Representation for Production Systems Psvn: a Vector Representation for Production Systems , 1999 .

[10]  Laurent Siklóssy,et al.  The Role of Preprocessing in Problem Solving Systems , 1977, IJCAI.

[11]  Donald F. Towsley,et al.  Estimating and sampling graphs with multidimensional random walks , 2010, IMC '10.

[12]  Patrik Haslum,et al.  New Admissible Heuristics for Domain-Independent Planning , 2005, AAAI.

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

[14]  Sandra Zilles,et al.  The computational complexity of avoiding spurious states in state space abstraction , 2010, Artif. Intell..

[15]  Patrik Haslum,et al.  Admissible Heuristics for Automated Planning , 2006 .