Differences between revisions 1 and 4 (spanning 3 versions)
Revision 1 as of 2010-08-03 09:58:17
Size: 584
Editor: GabiRoeger
Comment:
Revision 4 as of 2010-08-04 17:11:59
Size: 1517
Editor: GabiRoeger
Comment:
Deletions are marked like this. Additions are marked like this.
Line 19: Line 19:
 search [OPTIONS] {-s|--search} SEARCH < OUTPUT  downward [OPTIONS] --search SEARCH < OUTPUT
Line 25: Line 25:
 * `-h, --heuristic` [[ReusingHeuristics#predefinition|HEURISTIC_PREDEFINITION]]  * `--heuristic` [[ReusingHeuristics#predefinition|HEURISTIC_PREDEFINITION]]
Line 28: Line 28:
 * `-r, --random-seed` SEED  * `--random-seed` SEED
Line 30: Line 30:


=== Examples ===

Eager A* search with landmark-cut heuristic (previously configuration `ou`):

{{{
 ./downward --search "astar(lmcut())" < ./output
}}}


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):

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

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.

Back to HomePage.

Usage

Translator

XXX TODO

Preprocessor

XXX TODO

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

Eager A* search with landmark-cut heuristic (previously configuration ou):

 ./downward --search "astar(lmcut())" < ./output

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):

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

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)