Differences between revisions 4 and 7 (spanning 3 versions)
Revision 4 as of 2010-08-04 17:11:59
Size: 1517
Editor: GabiRoeger
Comment:
Revision 7 as of 2010-08-10 14:46:07
Size: 2471
Editor: ErezKarpas
Comment: Added syntax for translator and preprocessor
Deletions are marked like this. Additions are marked like this.
Line 9: Line 9:
XXX TODO {{{
translate.py DOMAIN PROBLEM
}}}
Line 11: Line 13:
 * `DOMAIN` (filename): PDDL domain file
 * `PROBLEM` (filename): PDDL problem file

Note: Creates a file called output.sas (as well as test.groups, all.groups, ...)
Line 13: Line 19:
XXX TODO {{{
 preprocess < OUTPUT.SAS
}}}

 * `OUTPUT.SAS` (filename): translator output

Note: Creates a file called output
Line 34: Line 46:
Eager A* search with landmark-cut heuristic (previously configuration `ou`): A* search:
Line 36: Line 48:
{{{ {{{#!highlight bash
# landmark-cut heuristic (previously configuration "ou")
Line 38: Line 51:

# merge-and-shrink heuristic with default settings (previously configuration "oa50000")
 ./downward --search "astar(mas())" < ./output

# blind heuristic (previously configuarion "ob")
 ./downward --search "astar(blind())" < ./output
Line 40: Line 59:
Lazy greedy best first search with preferred operators and the queue alternation method:
Line 41: Line 61:
Lazy greedy best first search with FF and context-enhanced additive heuristic,
using preferred operators of both heuristics
(same configuration as previous option `fFyY` but using the new general search implementation):

{{{
{{{#!highlight bash
## using FF heuristic and context-enhanced additive heuristic (previously: "fFyY")
Line 49: Line 66:

## using FF heuristic (previously: "fF")
 ./downward --heuristic "hff=ff()" \
            --search "lazy_greedy(hff, preferred=(hff))" \
            < ./output

## using context-enhanced additive heuristic (previously: "yY")
 ./downward --heuristic "hcea=cea()" \
            --search "lazy_greedy(hcea, preferred=(hcea))" \
            < ./output
Line 51: Line 78:
For comparison, the old best first search implementation is still available: The above examples use the new best-first search implementation.
For comparison, the old best-first search implementation is still available:
Line 57: Line 85:

Back to HomePage.

Usage

Translator

translate.py DOMAIN PROBLEM
  • DOMAIN (filename): PDDL domain file

  • PROBLEM (filename): PDDL problem file

Note: Creates a file called output.sas (as well as test.groups, all.groups, ...)

Preprocessor

 preprocess < OUTPUT.SAS
  • OUTPUT.SAS (filename): translator output

Note: Creates a file called output

Search component

 downward [OPTIONS] --search SEARCH < OUTPUT
  • SEARCH (SearchEngine): configuration of the search algorithm

  • OUTPUT (filename): preprocessor output

Options:

  • --heuristic HEURISTIC_PREDEFINITION

    • Predefines a heuristic that can afterwards be referenced by the name that is specified in the definition.
  • --random-seed SEED

    • Use random seed SEED

Examples

A* search:

   1 # landmark-cut heuristic (previously configuration "ou")
   2  ./downward --search "astar(lmcut())" < ./output
   3 
   4 # merge-and-shrink heuristic with default settings (previously configuration "oa50000")
   5  ./downward --search "astar(mas())" < ./output
   6 
   7 # blind heuristic (previously configuarion "ob")
   8  ./downward --search "astar(blind())" < ./output

Lazy greedy best first search with preferred operators and the queue alternation method:

   1 ## using FF heuristic and context-enhanced additive heuristic (previously: "fFyY")
   2  ./downward --heuristic "hff=ff()" --heuristic "hcea=cea()" \
   3             --search "lazy_greedy(hff, hcea, preferred=(hff, hcea))" \
   4             < ./output
   5 
   6 ## using FF heuristic (previously: "fF")
   7  ./downward --heuristic "hff=ff()" \
   8             --search "lazy_greedy(hff, preferred=(hff))" \
   9             < ./output
  10 
  11 ## using context-enhanced additive heuristic (previously: "yY")
  12  ./downward --heuristic "hcea=cea()" \
  13             --search "lazy_greedy(hcea, preferred=(hcea))" \
  14             < ./output

The above examples use the new best-first search implementation. For comparison, the old best-first search implementation is still available:

 ./downward --heuristic "hff=ff()" --heuristic "hcea=cea()" \
            --search "old_greedy(hff, hcea, preferred=(hff, hcea))" \
            < ./output

If you would like to have another translation from an old-style configuration to the new call-syntax, please add it here as a TODO.

FastDownward: PlannerUsage (last edited 2023-10-12 12:14:59 by GabiRoeger)