Journal of the ACM (JACM)
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Fast planning through planning graph analysis
Artificial Intelligence
Readings in Planning
Understanding and Extending Graphplan
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Constraint Processing
Planning graph as a (dynamic) CSP: exploiting EBL, DDB and other CSP search techniques in Graphplan
Journal of Artificial Intelligence Research
Using memory to transform search on the planning graph
Journal of Artificial Intelligence Research
Efficient implementation of the plan graph in STAN
Journal of Artificial Intelligence Research
Solving difficult SAT instances using greedy clique decomposition
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
| Hi-index | 0.00 |
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient solving of goal satisfaction problem we design a novel global filtration technique. The filtration technique is based on exploiting graphical structures of the problem - clique decomposition of the problem is used. We evaluated the proposed filtration technique on a set of random goal satisfaction problems as well as a part of GraphPlan based planning algorithm. In both cases we obtained significant improvements in comparison with existing techniques.