| Choice |
Planner |
Theoretic
properties |
Notes |
| 1 |
IxTeT (Laas, France) |
-
Based on chronicles |
-
download are not available (I emailed Malik Ghallab) - Handle time and resources reasoning - not really efficient ? (we have to try with our domain) - written in C - this is an old project, but still active |
| TLPlan (U. Sherbrooke/ Toronto) |
-
State-space |
-
Error in the book ? TLPlan use
temporal logic for search control, but not for time reasoning. May be,
some extensions exists : using procedure with a time variable ? |
|
| TALplanner (U. Linköping, Sweden) |
-
State-space |
-
download not yet available - based on idea behind TLPlan for search control - written in Java |
|
| Temporal Graphplan
(TGP) (U. Washington) |
-
Planning-graph |
-
download available - written in Lisp |
|
| 5 |
Sensory Graphplan (SGP) (U. Washington) |
- Planning-graph | -
download available - written in Lisp |
| SHOP2 (U. Maryland) |
-
HTN |
-
download available - handle time reasoning ? - very efficient - written in Lisp |
|
| ParcPlan (Imperial College, UK) |
-
chronicles |
-
download not available - written in ECLiPSe constraint logic programming environment (not public domain, need to sign license) |
|
| EUROPA (NASA ?) |
-
chronicles - ~CSP et CBIP |
-
CBIP = Constraint Based Interval Problem - download are not available ? - I found only few papers about EUROPA, no software |
|
| ASPEN (NASA) |
-
Many techniques |
-
ASPEN is available for external licensing through the Commercial
Technology Office at JPL |
|
| IPP (Institute of Computer Science, Allemagne) |
-
Planning-graph |
-
download available - date from 2000 - written in C++ (compile well under Linux) - numerics ? |
|
| MBP |
- full
and partial observability - ... |
||
| GTP (Universidad Simon Bolivar,Venezuela) |
- uncertainty
and partial Information - Distinguished at 2004 Probabilistic Planning Competition - output can be analyzed qualitatively and quantitatively - C++ / download for Solaris & Linux |
||
| CTP (Institute of Technology of Lens, France) |
- optimal temporal planner in
constraint programming - written in Claire which is compiled in C++ - download will be available in September 2004 |
||
| 2 |
Metric-FF |
- FF(Fast
Forward) - GraphPlan |
-
Top performer at ICP-3 (ICAPS02) in Numeric Category - Implements PDDL 2.1 level 2 - handle metrics - download available (written in C/C++) |
| 3 |
HSP* |
- Base on HSP |
- Support Durative action (PDDL
2.1 level 3) - download available / C++ - Works, but have some limitation in the way we increments variables. The planner complain about "non-static" value |
| SAPA |
- Planning-Graph |
- Seems to be good (time, resources, deadline) - Download available / Java - Supplied parser is limited to PDDL 2.1 level 3 (they do not give full version of SAPA) |
|
| 4 |
LPG (Italy) |
- Planning-Graph |
-
Top performer at ICP-3 (ICAPS02) in Numeric Category - PDDL 2.1 level 2 and 3 (may be 5) - Do not support = condition - download available (C/C++) |
| Color |
Meaning |
| |
Good
for our domain |
| |
not
sure |
| |
Bad
/ not applicable / cannot get it |
| |
To
be evaluated |