Searching for an alternative plan

Authors:
Ariel Felner;Alex Pomeransky;Jeffrey S. Rosenschein
Affiliations:
Bar-Ilan University, Ramat-Gan, Israel;Bar-Ilan University, Ramat-Gan, Israel;Hebrew University, Jerusalem, Israel
Venue:
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Year:
2003

Citing 4
Cited 1

Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
Route Planning by Analogy

ICCBR '95 Proceedings of the First International Conference on Case-Based Reasoning Research and Development
OBDD-based universal planning: specifying and solving planning problems for synchronized agents in non-deterministic domains

Artificial intelligence today

Searching for close alternative plans

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.