Consider the situation where an intelligent agent accepts as input a complete plan, i.e., a sequence of states (or operators) that should be followed in order to achieve a goal. For some reason, the given plan cannot be implemented by the agent, who then goes about trying to find an alternative plan that is as close as possible to the original. To achieve this, a search algorithm that will find similar alternative plans is required, as well as some sort of comparison function that will determine which alternative plan is closest to the original. In this paper, we define a number of distance metrics between plans, and characterize these functions and their respective attributes and advantages. We then develop a general algorithm based on best-first search that helps an agent efficiently find the most suitable alternative plan. We also propose a number of heuristics for the cost function of this best-first search algorithm. To explore the generality of our idea, we provide three different problem domains where our approach is applicable: physical roadmap path finding, the blocks world, and task scheduling. Experimental results on these various domains support the efficiency of our algorithm for finding close alternative plans. 1

The Publisher apologizes for the reference error in this article. References should be cited in brackets (i.e., [1]) within the text and numbered in the reference section at the end of the article. This article currently has all reference numbers cited in parenthesis but without any numbers listed at the end. Note: the references are listed in sequential order in the reference section.The online version of the original article can be found at http://dx

Suppose that an intelligent agent accepts as input a complete plan, i.e., a sequence of states (or operators) that should be followed in order to achieve a goal. For some reason, the given plan cannot be followed by the agent, and thus an alternative plan needs to be found -but we would like the alternative plan to be as close as possible to the original. To achieve this, we define a number of distance metrics between paths or plans, and characterize these functions and their respective attributes and advantages. We then develop a general algorithm based on best-first search that helps an agent find the most suitable alternative plan efficiently, and propose a number of heuristics for the cost function of this best-first search algorithm. We then experimentally show that our algorithm is efficient in finding an alternative plan.

No abstract