Differences between revisions 8 and 9
Revision 8 as of 2016-04-12 17:43:08
Size: 3187
Editor: XmlRpcBot
Comment:
Revision 9 as of 2019-03-08 12:08:33
Size: 3242
Editor: XmlRpcBot
Comment:
Deletions are marked like this. Additions are marked like this.
Line 9: Line 9:
 In ''Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2014)'', pp. 226-234. AAAI Press 2014.  In ''Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2014)'', pp. 226-234. AAAI Press, 2014.
Line 13: Line 13:
 In ''Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI 2013)'', pp. 2268-2274. 2013.  In ''Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI 2013)'', pp. 2268-2274. AAAI Press, 2013.
Line 25: Line 25:
 In ''Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI 2013)'', pp. 2357-2364. 2013.  In ''Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI 2013)'', pp. 2357-2364. AAAI Press, 2013.
Line 37: Line 37:
 In ''Proceedings of the Thirteenth International Conference on Principles and Practice of Constraint Programming (CP 2007)'', pp. 651-665. 2007.  In ''Proceedings of the Thirteenth International Conference on Principles and Practice of Constraint Programming (CP 2007)'', pp. 651-665. Springer-Verlag, 2007.
Line 41: Line 41:
 In ''Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI 2013)'', pp. 2268-2274. 2013.  In ''Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI 2013)'', pp. 2268-2274. AAAI Press, 2013.
Line 45: Line 45:
 In ''Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2014)'', pp. 226-234. AAAI Press 2014.  In ''Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2014)'', pp. 226-234. AAAI Press, 2014.

LM-cut landmark constraints

Computes a set of landmarks in each state using the LM-cut method. For each landmark L the constraint sum_{o in L} Count_o >= 1 is added to the operator counting LP temporarily. After the heuristic value for the state is computed, all temporary constraints are removed again. For details, see

lmcut_constraints()

Posthoc optimization constraints

The generator will compute a PDB for each pattern and add the constraint h(s) <= sum_{o in relevant(h)} Count_o. For details, see

pho_constraints(patterns=systematic(2))

State equation constraints

For each fact, a permanent constraint is added that considers the net change of the fact, i.e., the total number of times the fact is added minus the total number of times is removed. The bounds of each constraint depend on the current state and the goal state and are updated in each state. For details, see

state_equation_constraints()

FastDownward: Doc/ConstraintGenerator (last edited 2019-03-08 12:08:33 by XmlRpcBot)