Differences between revisions 2 and 3
Revision 2 as of 2010-08-02 15:10:10
Size: 2307
Editor: GabiRoeger
Comment:
Revision 3 as of 2010-08-03 15:56:55
Size: 2149
Editor: GabiRoeger
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
#pragma section-numbers 2
Line 7: Line 8:
 * [[#alt|alternation open list]]
 * [[#pareto|pareto open list]]
 * [[#single|standard open list]]
 * [[#single_buckets|bucket-based open list]]
 * [[#tiebreaking|tie-breaking open list]]
<<TableOfContents>>
Line 15: Line 11:
=== Alternation open list === == Alternation open list ==
Line 26: Line 22:
=== Pareto open list === == Pareto open list ==
Line 39: Line 35:
=== Standard open list === == Standard open list ==
Line 51: Line 47:
=== Bucket-based open list === == Bucket-based open list ==
Line 62: Line 58:
=== Tie-breaking open list === == Tie-breaking open list ==

Back to the HomePage.

Open lists

1. Alternation open list

alt(open_list1, open_list2, ..., boost=1000)

Alternates between several open lists.

  • open_list1, open_list2, ... (comma-separated list of OpenLists): open lists

  • boost (int): boost value for sub-open-lists that are restricted to preferred operator nodes

2. Pareto open list

pareto(evaluator1, evaluator2, ..., pref_only=false, 
       state_uniform_selection=false)

Selects one of the Pareto-optimal (regarding the sub-evaluators) entry for removal.

  • evaluator1, evaluator2, ... (comma-separated list of ScalarEvaluators): scalar evaluators

  • pref_only (bool): insert only nodes generated by preferred operators

  • state_uniform_selection (bool): When removing an entry, we select a non-dominated bucket and return its oldest entry. If this option is false, we select uniformly from the non-dominated buckets; if the option is true, we weight the buckets with the number of entries.

3. Standard open list

single(evaluator, pref_only=false)

Standard open list that uses a single evaluator.

  • evaluator (ScalarEvaluator): scalar evaluator

  • pref_only (bool): insert only nodes generated by preferred operators

4. Bucket-based open list

single_buckets(evaluator, pref_only=false)

Bucket-based open list implementation that uses a single evaluator.

  • evaluator (ScalarEvaluator): scalar evaluator

  • pref_only (bool): insert only nodes generated by preferred operators

5. Tie-breaking open list

tiebreaking(evaluator1, evaluator2, ..., pref_only=false, 
            unsafe_pruning=true)
  • evaluator1, evaluator2, ... (comma-separated list of ScalarEvaluators): scalar evaluators

  • pref_only (bool): insert only nodes generated by preferred operators

  • unsafe_pruning (bool): allow unsafe pruning when the main evaluator regards a state a dead end