Exhibiting knowledge in planning problems to minimize state encoding length

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1809, Issue , 2000, Pages 135-147

  Edelkamp, Stefan ^a   Helmert, Malte ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

PLANNING PROBLEM; SECOND PHASE; SINGLE STATE; STATE ENCODING; THIRD PHASE;

ENCODING (SYMBOLS);

EID: 84943258919     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10720246_11     Document Type: Conference Paper

References (23)

1. A.Blum and M.Furst.Fast planning through planning graph analysis.In IJCAI' 95, pages 1636-1642, 1995.
2. R.E.Bryant.Symbolic manipulation of boolean functions using a graphical representation.In ACM/IEEE Design Automation, pages 688-694, 1985.
3. J.C.Culberson and J.Schaeer.Searching with pattern databases.In Proceedings of the Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in AI, volume 1081 of LNAI, pages 402-416, 1996.
4. J.Eckerle and S.Schuierer.ecient memory-limited graph search.Lecture Notes in Computer Science, 981:101-112, 1995.
5. S.Edelkamp and R.E.Korf.The branching factor of regular search spaces.In AAAI-98, pages 299-304, 1998.
6. S.Edelkamp and F.Reel.OBDDs in heuristic search.In KI-98, volume 1504 of LNAI, pages 81-92, Berlin, 1998.Springer.
7. S.Edelkamp and F.Reel.Deterministic state space planning with BDDs.Technical Report 120, Computer Science Departement, University of Freiburg, 1999.
8. R.Fikes and N.Nilsson.Strips: A new approach to the application of theorem proving to problem solving.
9. M.Fox and D.Long.The automatic inference of state invariants in TIM.JAIR, 9:367-421, 1998.
10. M.Fox and D.Long.The detection and exploration of symmetry in planning problems.Technical Report 1/99, Department of Computer Science, University of Durham, 1999.
11. A.Gerevini and L.Schubert.Inferring state constraints for domain-independent planning.In AAAI-98, pages 905-912.AAAI Press, 1998.
12. P.E.Hart, N.J.Nilsson, and B.Raphael.A formal basis for heuristic determination of minimum path cost.IEEE Trans.on SSC, 4:100, 1968.
13. A.Junghanns and J.Schaeer.Single agent search in the presence of deadlocks.In AAAI-98, pages 228-233, 1998.
14. H.Kautz and B.Selman.Pushing the envelope: Planning propositional logic, and stochastic search.In AAAI-96, pages 1194-1201, 1996.
15. R.E.Korf.Depth-rst iterative-deepening: An optimal admissible tree search.Artificial Intelligence, 27(1):97-109, 1985.
16. R.E.Korf.Finding optimal solutions to Rubik's Cube using pattern databases.In AAAI-97, pages 700-705, 1997.
17. R.E.Korf.Complexity analysis of admissible heuristic search.In AAAI-98, pages 305-310, 1998.
18. D.Long and M.Fox.ecient implementation of the plan graph in STAN.JAIR, 10:87-115, 1998.
19. K.McMillan.Symbolic Model Checking.Kluwer Academic Press, 1993.
20. E.Pednould.ADL: Exploring the middleground between Strips and situation calculus.KR-89, pages 324-332, 1989.
21. A.Reinefeld and T.Marsland.Enhanced iterative-deepening search.IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(7):701-710, 1994.
22. S.Russell.ecient memory-bounded search methods.In ECAI-92, pages 1-5.Wiley, 1992.
23. L.A.Taylor and R.E.Korf.Pruning duplicate nodes in depth-rst search.In AAAI-93, pages 756-761, 1993.