Automatically synthesising domain constraints from operator descriptions
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Engineering and compiling planning domain models to promote validity and efficiency
Artificial Intelligence
Inferring state constraints for domain-independent planning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Accelerating partial-order planners: some techniques for effective search control and pruning
Journal of Artificial Intelligence Research
Efficient implementation of the plan graph in STAN
Journal of Artificial Intelligence Research
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Encoding domain knowledge for prositional planning
Logic-based artificial intelligence
STeLLa: An Optimal Sequential and Parallel Planner
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
STeLLa v2.0: Planning with Intermediate Goals
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Knowledge Representation in Planning: A PDDL to OCLh Translation
ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
A Tool Supported Structured Method for Planning Domain Acquisition
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Temporal Planning through Mixed Integer Programming: A Preliminary Report
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Exploring artificial intelligence in the new millennium
Conformant planning via symbolic model checking and heuristic search
Artificial Intelligence
Processes and continuous change in a SAT-based planner
Artificial Intelligence
HAPRC: an automatically configurable planning system
AI Communications
Plan execution in dynamic environments
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Decomposition of planning problems
AI Communications
Planning domain definition using GIPO
The Knowledge Engineering Review
Learning Control Knowledge for Forward Search Planning
The Journal of Machine Learning Research
Using Cases Utility for Heuristic Planning Improvement
ICCBR '07 Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Long-distance mutual exclusion for planning
Artificial Intelligence
Concise finite-domain representations for PDDL planning tasks
Artificial Intelligence
Learning from planner performance
Artificial Intelligence
On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm
Journal of Artificial Intelligence Research
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Compiling causal theories to successor state axioms and STRIPS-like systems
Journal of Artificial Intelligence Research
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
Planning through stochastic local search and temporal action graphs in LPG
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Using memory to transform search on the planning graph
Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks
Journal of Artificial Intelligence Research
The GRT planning system: backward heuristic construction in forward state-space planning
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Efficient implementation of the plan graph in STAN
Journal of Artificial Intelligence Research
The detection and exploitation of symmetry in planning problems
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Long-distance mutual exclusion for propositional planning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Hybrid STAN: Identifying and managing combinatorial optimisation sub-problems in planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Reviving partial order planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Abstraction-based action ordering in planning
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Processes and continuous change in a SAT-based planner
Artificial Intelligence
Quantifying privacy in multiagent planning
Multiagent and Grid Systems - Planning in multiagent systems
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Learning general Graphplan memos through static domain analysis
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Understanding planning tasks: domain complexity and heuristic decomposition
Understanding planning tasks: domain complexity and heuristic decomposition
Property persistence in the situation calculus
Artificial Intelligence
Kernel functions for case-based planning
Artificial Intelligence
Landmarks in Hierarchical Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Automatic induction of bellman-error features for probabilistic planning
Journal of Artificial Intelligence Research
A weighted CSP approach to cost-optimal planning
AI Communications
Domain Independent Goal Recognition
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
On-line planning and scheduling: an application to controlling modular printers
Journal of Artificial Intelligence Research
A hybrid deliberative layer for robotic agents: fusing DL reasoning with HTN planning in autonomous robots
Analyzing search topology without running any search: on the connection between causal graphs and h+
Journal of Artificial Intelligence Research
Controlled reachability analysis in AI planning: theory and practice
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
Improving control-knowledge acquisition for planning by active learning
ECML'06 Proceedings of the 17th European conference on Machine Learning
Divide-and-Evolve: a new memetic scheme for domain-independent temporal planning
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Planning under partial observability by classical replanning: theory and experiments
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
A case-based approach to heuristic planning
Applied Intelligence
Post-design analysis for building and refining AI planning systems
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
As planning is applied to larger and richer domains the effort involved in constructing domain descriptions increases and becomes a significant burden on the human application designer. If general planners are to be applied successfully to large and complex domains it is necessary to provide the domain designer with some assistance in building correctly encoded domains. One way of doing this is to provide domain-independent techniques for extracting, from a domain description, knowledge that is implicit in that description and that can assist domain designers in debugging domain descriptions. This knowledge can also be exploited to improve the performance of planners: several researchers have explored the potential of state invariants in speeding up the performance of domain-independent planners. In this paper we describe a process by which state invariants can be extracted from the automatically inferred type structure of a domain. These techniques are being developed for exploitation by STAN, a Graphplan based planner that employs state analysis techniques to enhance its performance.