Planning with open variable lists in Gecode
Summary
Explains Gecode's open variable lists that allow dynamic creation of variables and constraints during search, enabling growing planning problems. Uses robot planning and the fifteen-puzzle to illustrate open-list modeling, including a table of steps and a regular-constraint automaton approach, plus experimental search engines A* and CABS. Also discusses pros and cons of open vs fixed horizons and introduces several open constraints for growing plans.