Revision 6 as of 2015-09-11 10:00:20

Clear message

Alternation open list

alternates between several open lists.

alt(sublists, boost=0)

Epsilon-greedy open list

Chooses an entry uniformly randomly with probability 'epsilon', otherwise it returns the minimum entry. The algorithm is based on

In Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2014), pp. 375-379. AAAI Press 2014.

epsilon_greedy(eval, pref_only=false, epsilon=0.2)

Pareto open list

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

pareto(evals, pref_only=false, state_uniform_selection=false)

Standard open list

Standard open list that uses a single evaluator

single(eval, pref_only=false)

Bucket-based open list

Bucket-based open list implementation that uses a single evaluator. Ties are broken in FIFO order.

single_buckets(eval, pref_only=false)

Tie-breaking open list

tiebreaking(evals, pref_only=false, unsafe_pruning=true)