[ Please note: The project has been discontinued as of May 31, 2005 and is superseded by the projects of the ii Labs. There won't be further updates to these pages. ]

(Related publications: [PUBLink] [PUBLink])

Section [Resources] introduced the Orc Quest example, a solution of which is presented in this section. The problem was defined as:

STATEVARS: Duration, Pain, Performers

INIT: Duration = 0, Pain = 0, Performers = 0

ACTION catch_only_one:
  Duration += 2, Pain += 1, Performers += 1

ACTION catch_a_group:
  Duration += 5, Pain += 4, Performers += 3

ACTION deliver_humans:
  Duration += 1, Pain -= 11, Performers -= 10

The planning goal is a multi-objective one. The goal criteria are:

GOAL:
  Satisfaction Criterion: Performers >= 5
  Primary Optimization Criterion: min(Pain)
  Secondary Optimization Criterion: min(Duration)

• The Constraints
• The Constraints' Heuristics
• The Global Search Control
• Evaluation

For questions, comments or suggestions, please contact us.

Last update:
May 20, 2001 by Alexander Nareyek