The use of macro-actions in planning introduces a trade-off.. Macro-actions can offer search guidance by suggesting sequences of actions; but can potentially make search more expensive by increasing the branching factor. In this paper we present a technique for simulating the use of macro actions by altering the order in which actions are considered for application during enforced hill-climbing search. Actions are ordered based on the number of times they have occurred, in past solution plans, following the last action added to the plan. We demonstrate that the action-reordering technique used can offer improved search performance without the negative performance impacts often observed when using macro-actions.
|Number of pages||8|
|Publication status||Published - 2006|
|Event||25th Workshop of the UK Planning and Scheduling Special Interest Group - Nottingham, United Kingdom|
Duration: 14 Dec 2006 → 15 Dec 2006
|Conference||25th Workshop of the UK Planning and Scheduling Special Interest Group|
|Abbreviated title||PlanSIG 2006|
|Period||14/12/06 → 15/12/06|
- action reordering
- search algorithms
- artificial intelligence
Coles, A. I., & Smith, A. J. (2006). Simulating the use of macro-actions through action reordering. Paper presented at 25th Workshop of the UK Planning and Scheduling Special Interest Group, Nottingham, United Kingdom.