UMOP (Jensen & Veloso, AIPS2000 and JAIR, vol. 13 2000 and Jensen, Veloso & Bowling ECP-01) is a universal planning system for multi-Agent and non-Deterministic domains. As input UMOP takes a planning problem described in the Non-deterministic Agent Domain Language (NADL). The NADL problem is translated to a Kripke structure search problem. The Kripke structure is represented by a conjunctive partitioned transition relation encoded symbolically as a set of Ordered Binary Decision Diagrams (OBDDs, Bryant 1986).
Version 1.2 of UMOP includes five universal planning algorithms: strong planning, strong cyclic planning (Cimatti, Roveri & Traverso 1998), optimistic planning (Jensen & Veloso 2000), strong cyclic adversarial planning and optimistic adversarial planning (Jensen, Veloso & Bowling 2001). All of these algorithms perform a BFS backward search using efficient OBDD operations for generating sets of previous states. In addition version 1.2 includes several X-based execution demos and an interactive plan executor.
Due to the BFS algorithms the universal plans produced are optimal in the number of expected steps. Please consult the literature for precise definitions of the properties of the different algorithms.
The UMOP planner includes the BuDDy OBDD Package (Lind-Nielsen 1999). We have permission to distribute BuDDY ver. 2.0 in this release. Both UMOP and BuDDy may be used for research purposes only .
To download and install UMOP ver. 1.2 do the following:
umop12.tar.gz (3.1 MB).
gunzip umop12.tar.gz"
tar xvf umop12.tar" The UMOP files are stored in the directory "UMOP-1.2". The precompiled executable is stored in subdirectory "bin" while the source code is in "src". Domain examples can be found in the subdirectory "domains". The demos and executor can be found in subdirs "demos" and "executor" respectively.
Please follow the instructions in the README file for compiling the source code and using UMOP. There are separate readme files in the demos and executor directories.