Highly symmetric problems result in redundant search effort which can render apparently simple problems intractable. Whilst the potential benefits of symmetry-breaking have been explored in the broader search community there has been relatively little interest in the exploitation of this potential in planning. An initial exploration of the benefits of symmetry-breaking in a Graphplan framework, by Fox and Long in 1999 (Fox and Long 1999) yielded promising results but failed to take into account the importance of identifying and exploiting new symmetries that arise during the search process. In this paper we extend the symmetry exploitation ideas described in (Fox and Long 1999) to handle new symmetries and report results obtained from a range of planning problems.
|Number of pages||8|
|Publication status||Published - 2002|
|Event||Proceedings of Sixth International Conference on AI Planning and Scheduling - Toulouse, France|
Duration: 23 Apr 2002 → 27 Apr 2002
|Conference||Proceedings of Sixth International Conference on AI Planning and Scheduling|
|Period||23/04/02 → 27/04/02|