Limits and Possibilities of BDDs in State Space Search

Proceedings of the 23rd AAAI Conference on Artificial Intelligence, AAAI 2008

Volumn , Issue , 2008, Pages 1452-1453

  Edelkamp, Stefan ^a   Kissmann, Peter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

CAUSAL GRAPH; INITIAL STATE; INPUT SET; MEMORY REQUIREMENTS; OPTIMAL SEQUENTIAL; PROBLEM SIZE; STATE SPACE SEARCH; STATE-SETS; STATE-VARIABLES; TRANSITION RELATIONS;

BOOLEAN FUNCTIONS;

EID: 58849098548     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Haslum, P.; Botea, A.; Helmert, M.; Bonet, B.; and Koenig, S. 2007. Domain-independent construction of pattern database heuristics for cost-optimal planning. In AAAI, 1007–1012.
2. Helmert, M., and Röger, G. 2007. How good is almost perfect? In ICAPS-Workshop on Heuristics for Domain-Independent Planning.
3. Hung, N. N. W. 1997. Exploiting symmetry for formal verification. Master’s thesis, Faculty of the Graduate School, University of Texas at Austin.
4. Junghanns, A. 1999. Pushing the Limits: New Developments in Single-Agent Search. Ph.D. Dissertation, University of Alberta.