ACM Computing Surveys (CSUR)
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
The EXODUS optimizer generator
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Theory and algorithms for plan merging
Artificial Intelligence
Acquiring search-control knowledge via static analysis
Artificial Intelligence
Automatically generating abstractions for planning
Artificial Intelligence
Complexity, decidability and undecidability results for domain-independent planning
Artificial Intelligence - Special volume on planning and scheduling
Query reformulation for dynamic information integration
Journal of Intelligent Information Systems - Special issue on intelligent integration of information
Planning and Learning by Analogical Reasoning
Planning and Learning by Analogical Reasoning
Learning Search Control Knowledge: An Explanation-Based Approach
Learning Search Control Knowledge: An Explanation-Based Approach
A domain-independent algorithm for plan adaptation
Journal of Artificial Intelligence Research
AI planning versus manufacturing-operation planning: a case study
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Planning executing sensing and replanning for information gathering
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Ariadne: a system for constructing mediators for Internet sources
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Modeling Web sources for information integration
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Fast planning through greedy action graphs
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
An efficient plan execution system for information management agents
Proceedings of the 2nd international workshop on Web information and data management
A Value-Driven System for Autonomous Information Gathering
Journal of Intelligent Information Systems
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace
Autonomous Agents and Multi-Agent Systems
IEEE Intelligent Systems
A New Query Processing Scheme in a Web Data Engine
DNIS '02 Proceedings of the Second International Workshop on Databases in Networked Information Systems
Replanning in a Resource-Based Framework
Proceedings of the 9th ECCAI-ACAI/EASSS 2001, AEMAS 2001, HoloMAS 2001 on Multi-Agent-Systems and Applications II-Selected Revised Papers
Beyond the Plan-Length Criterion
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Complex relationships and knowledge discovery support in the InfoQuilt system
The VLDB Journal — The International Journal on Very Large Data Bases
Grid resource management
Decomposition of planning problems
AI Communications
Anytime search in dynamic graphs
Artificial Intelligence
Journal of Artificial Intelligence Research
Applying local search to disjunctive temporal problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Hi-index | 0.00 |
Domain-independent planning is a hard combinatorial problem. Taking into account plan quality makes the task even more difficult. We introduce a new paradigm for efficient high-quality planning that exploits plan rewriting rules and efficient local search techniques to transform an easy-to-generate, but possibly sub-optimal, initial plan into a low-cost plan. In addition to addressing the issues of efficiency and quality, this framework yields a new anytime planning algorithm. We have implemented this planner and applied it to several existing domains. The results show that this approach provides significant savings in planning effort while generating high-quality plans.