Tokenplan: A Planner for Both Satisfaction and Optimization Problem

  • Yannick Meiller
  • Patrick Fabiani

Abstract

Tokenplan is a planner based on the use of Petri nets. Its main feature is the flexibility it offers in the way it builds the planning graph. The Fifth International Conference on Artificial Intelligence Planning and Scheduling planning competition validated its behavior with a graphplan-like behavior. The next step is to demonstrate the benefits we expect from our planner in planning problems involving optimization and uncertainty handling.
Published
2001-09-15
Section
Articles