Simulating the use of macro-actions through action reordering

A.I. Coles, A.J. Smith

Research output: Contribution to conferencePaper

27 Downloads (Pure)

Abstract

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.
Original languageEnglish
Number of pages8
Publication statusPublished - 2006
Event25th Workshop of the UK Planning and Scheduling Special Interest Group - Nottingham, United Kingdom
Duration: 14 Dec 200615 Dec 2006

Conference

Conference25th Workshop of the UK Planning and Scheduling Special Interest Group
Abbreviated titlePlanSIG 2006
CountryUnited Kingdom
CityNottingham
Period14/12/0615/12/06

Keywords

  • planning
  • action reordering
  • programming
  • search algorithms
  • artificial intelligence

Fingerprint Dive into the research topics of 'Simulating the use of macro-actions through action reordering'. Together they form a unique fingerprint.

  • Cite this

    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.