Conditional nonlinear planning
Proceedings of the first international conference on Artificial intelligence planning systems
HTN planning: complexity and expressivity
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Automatic OBDD-based generation of universal plans in non-deterministic domains
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parametric shape analysis via 3-valued logic
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Survey on Case-Based Planning
Artificial Intelligence Review
Explanation-Based Learning: An Alternative View
Machine Learning
Symbolic heuristic search for factored Markov decision processes
Eighteenth national conference on Artificial intelligence
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Programming by Demonstration Using Version Space Algebra
Machine Learning
Sheepdog: learning procedures for technical support
Proceedings of the 9th international conference on Intelligent user interfaces
Termination proofs for systems code
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
PLOW: a collaborative task learning agent
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
HTN-MAKER: learning HTNs with minimal additional knowledge engineering required
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Learning generalized plans using abstract counting
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Journal of Artificial Intelligence Research
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Finite differencing of logical formulas for static analysis
ESOP'03 Proceedings of the 12th European conference on Programming
Merging example plans into generalized plans for non-deterministic environments
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Search reduction in hierarchical problem solving
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
SPUDD: stochastic planning using decision diagrams
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Generalized planning: synthesizing plans that work for multiple environments
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Applicability conditions for plans with loops: Computability results and algorithms
Artificial Intelligence
Artificial Intelligence: From programs to solvers
AI Communications - ECAI 2012 Turing and Anniversary Track
Hi-index | 0.00 |
Constructing plans that can handle multiple problem instances is a longstanding open problem in AI. We present a framework for generalized planning that captures the notion of algorithm-like plans and unifies various approaches developed for addressing this problem. Using this framework, and building on the TVLA system for static analysis of programs, we develop a novel approach for computing generalizations of classical plans by identifying sequences of actions that will make measurable progress when placed in a loop. In a wide class of problems that we characterize formally in the paper, these methods allow us to find generalized plans with loops for solving problem instances of unbounded sizes and also to determine the correctness and applicability of the computed generalized plans. We demonstrate the scope and scalability of the proposed approach on a wide range of planning problems.