BIFROST Version 0.7
The Bdd-based InFoRmed planning and cOntroller Synthesis Tool (BIFROST) is a BDD-based search engine for deterministic and non-deterministic planning/search/control domains. It takes problems written in either NADL (Jensen & Veloso, AIPS2000 and JAIR 1999) or PDDL. It has 11 algorithms for deterministic domains including blind forward, backward, bidirectional, SetA*, and BDDA* (with a range of different heuristics). It has 10 algorithms for non-deterministic domains including the classical weak, strong cyclic, and strong in blind and guided versions (ICAPS-03), and adversarial weak and strong cyclic. In addition, BIFROST includes various algorithms for fault tolerant planning.
This code is precompiled for Linux RedHat 7.1. It should be fairly easy to port to other OSs. First download BIFROST 0.7 and the modifed BuDDy BDD package used by BIFROST 0.7. You can also download the unmodified package and uncomment the special functions.
Unpack in the usual way: "
For a complete recompilation, start with the buddy package in its main directory run make clean, make all. After successful compilation, your library is sitting in "src". After that open the "Makefile" in "0.7" and edit the library link to fit your system. Then do a "make clean" and "make all". If the "LEX" and "YACC" are giving problems, follow the instructions at the end of the make file.
BIFROST Experimental Domains
This file contains a large collection of domains used for experiments with UMOP and BIFROST. Again, I suggest you to contact me regarding particular experiments and domains. Also, don't be surpriced to find groceries shopping lists and other personal stuff here.
BIFROST related Publications