SPG Code Releases

This page includes links to current downloadable source and excutable code produced within the SPG. Executables are compiled with Gnu C++ compilers (egcs 2.95) and use glibc 2.1.2. If you need Solaris or other executables that are not currently supplied, please let us know and we will try to supply them. Source code tends to lag behind executables, but we are releasing it as it is tidied up and, as much as possible, debugged.

If you find bugs or want to ask about the source or executables, please contact us.

• This is the Linux STAN executable used in the AIPS'2000 competition (with a couple of minor bugs removed). It should be noted that this version has not been extentensively tested and that there are likely to be robustness problems in some domains. This version of STAN is a radical modification of the original architecture. It has two search engines: the graphplan engine and a forward heuristic search engine. The choice between these is made automatically based on several factors identified by the TIM analysis of the domain. In particular, if the domain allows exploitation of several specialised techniques based on our generic types analysis then the forward planner is selected, while the graphplan engine is selected in most other cases. The major novel extension is the use of sepcialised problem sub-solvers for planning problems involving path-planning and certain kinds of resource handling. The resource management ideas are still relatively raw in this version and the path-planning is limited to simpler kinds of maps and movement, but the intention (which was very successfully realised) was to demonstrate the power of automatic problem analysis and problem decomposition.
• The TIM API pages.
• STAN (version 3) This version precedes the AIPS'00 competition.
• TIM (version 1.7)
• TIM 4.4 This is the latest version of the TIM executable (for Linux - if you need other formats, let us know). Check the README in the release for more information.
• STAN source (version 2-3)
• TIM source (version 1.7)

The following code is material from older projects which might be of interest:

• PAM - a linear planner compiler. Written in Haskell (a functional language), using a non-PDDL input language. A paper describing PAM can be found here.
• TEMPMAN - an efficient partial order manager. This work was originally to support a partial order planner. A paper on the manager can be found here.