Cited By
View all- Felner AStern RRosenschein JPomeransky A(2007)Searching for close alternative plansAutonomous Agents and Multi-Agent Systems10.1007/s10458-006-9006-114:3(211-237)Online publication date: 1-Jun-2007
Searching for an alternative plan
Pages 33 - 40
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.
References
[1]
J. Ambros-Ingerson and S. Steel. Integrating planning, execution and monitoring. In Proceedings AAAI-88, pages 735--740, St. Paul, Minnesota, 1988.
[2]
C. B. Barber, D. P. Dobkin, and H. Huhdanpaa. The Quickhull algorithm for convex hull. Geometry Center Technical Report GCG53, 1993.
[3]
Eithan Ephrati and Jeffrey S. Rosenschein. Planning to please: Following another agent's intended plan. Group Decision and Negotiation, 2(3):219--235, 1993.
[4]
P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, SCC-4(2):100--107, 1968.
[5]
R. M. Jensen and M. M. Veloso. OBDD-based universal planning: Specifying and solving planning problems for synchronized agents in non-deterministic domains. Artificial Intelligence Today, Recent Trends and Developments, pages 212--248, 1999.
[6]
W. Li and M. Zhang. Distributed task plan: A model for designing autonomous mobile agents. In Proceedings of International Conference on Artificial Intelligence, pages 336--342, Las-Vegas, 1999.
[7]
B. Liu. Intelligent route finding: Combining knowledge, cases and an efficient search algorithm. In Proceedings of ECAI-96, pages 380--384, Budapest, Hungary, 1996.
[8]
A. Okabe, B. Boots, and K. Sugihara. Spatial tessellations, concepts, and applications of Voronoi diagrams. Wiley, Chichester, 1992.
[9]
S. Russell and P. Norvig. Artificial Intelligence, A Modern Approach. Prentice Hall, 1995.
[10]
A. Stentz. Optimal and efficient path planning for partially-known environments. In Proc of ICRA, pages 3310--3317, 1994.
[11]
K. Zita and M. Veloso. Route planning by analogy. In the Proceedings of the International Conference on Case-Based Reasoning, 1995.
Index Terms
- Searching for an alternative plan
Recommendations
Searching for close alternative plans
AbstractConsider 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, ...
Searching Optimal Parallel Plans: A Filtering and Decomposition Approach
ICTAI '09: Proceedings of the 2009 21st IEEE International Conference on Tools with Artificial IntelligenceIn the domain of planning, searching for optimal plans gives rise to many works. Most of the existing planners search for optimal parallel plans, that is plans which are optimal in the number of steps. FDP is an exception: it searches for optimal ...
Lifelong planning A*
Heuristic search methods promise to find shortest paths for path-planning problems faster than uninformed search methods. Incremental search methods, on the other hand, promise to find shortest paths for series of similar path-planning problems faster ...
Comments
Information & Contributors
Information
Published In
July 2003
1200 pages
ISBN:1581136838
DOI:10.1145/860575
- General Chairs:
- Jeffrey S. Rosenschein,
- Michael Wooldridge,
- Program Chairs:
- Tuomas Sandholm,
- Makoto Yokoo
Copyright © 2003 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 July 2003
Check for updates
Author Tags
Qualifiers
- Article
Conference
AAMAS03: Second International Conference on Autonomous Agents and Multiagent Systems
July 14 - 18, 2003
Melbourne, Australia
Acceptance Rates
Overall Acceptance Rate 1,155 of 5,036 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 544Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)1
Reflects downloads up to 16 Oct 2024
Other Metrics
Citations
Cited By
View all- Felner AStern RRosenschein JPomeransky A(2007)Searching for close alternative plansAutonomous Agents and Multi-Agent Systems10.1007/s10458-006-9006-114:3(211-237)Online publication date: 1-Jun-2007
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in