AIAI O-Plan

Applications

O-Plan is aimed at being relevant to the following types of problems: These applications fit midway between the large scale manufacturing scheduling problems found in some industries (where there are often few inter-operation constraints) and the complex puzzles dealt with by very flexible logic based tools. However, the problems of this type represent an important class of industrial relevance.

The areas in which O-Plan has already been applied are as follows:

O-Plan has also been used by other teams as part of their work in a range of applications. A paper describing O-Plans applications and the web interface to O-Plan is available:

Tate, A. and Dalton, J. (2003) O-Plan: a Common Lisp Planning Web Service, invited paper, in Proceedings of the International Lisp Conference 2003, October 12-25, 2003, New York, NY, USA, October 12-15, 2003. [PDF Format]
For more information on O-Plan domains, access to the domain descriptions, and live demonstrations of many of these, see the Web Demonstrations.

O-Plan Index
AIAI Page maintained by oplan@ed.ac.uk, Last updated: Fri Oct 29 13:40:26 2021