Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Planning with continuous change
Planning with continuous change
Expressive equivalence of planning formalisms
Artificial Intelligence - Special volume on planning and scheduling
Fast planning through planning graph analysis
Artificial Intelligence
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Applications of modern heuristic search methods to pattern sequencing problems
Computers and Operations Research
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
Model checking
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Planning for temporally extended goals
Annals of Mathematics and Artificial Intelligence
TALplanner: A temporal logic based forward chaining planner
Annals of Mathematics and Artificial Intelligence
Connections between cutting-pattern sequencing, VLSI Design, and flexible machines
Computers and Operations Research
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Some Results on the Complexity of Planning with Incomplete Information
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Artificial Intelligence
Branching and pruning: an optimal temporal POCL planner based on constraint programming
Artificial Intelligence
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Artificial Intelligence
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Effective approaches for partial satisfaction (over-subscription) planning
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Planning with first-order temporally extended goals using heuristic search
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Planning as satisfiability with preferences
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
On the compilability and expressive power of propositional planning formalisms
Journal of Artificial Intelligence Research
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
The 3rd international planning competition: results and analysis
Journal of Artificial Intelligence Research
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
Temporal planning using subgoal partitioning and resolution in SGPlan
Journal of Artificial Intelligence Research
Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
Journal of Artificial Intelligence Research
Planning with goal utility dependencies
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Optimal symbolic planning with action costs and preferences
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Improving Plan Quality in SAT-Based Planning
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Solving satisfiability problems with preferences
Constraints
LTL Goal Specifications Revisited
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Planning for human-robot teaming in open worlds
ACM Transactions on Intelligent Systems and Technology (TIST)
Efficient Plan Adaptation through Replanning Windows and Heuristic Goals
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Preference-based web service composition: a middle ground between execution and search
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
The LAMA planner: guiding cost-based anytime planning with landmarks
Journal of Artificial Intelligence Research
Planning solar array operations on the international space station
ACM Transactions on Intelligent Systems and Technology (TIST)
Editorial: The Competition Section: a new paper category
Artificial Intelligence
Over-subscription planning with boolean optimization: an assessment of state-of-the-art solutions
AI*IA'11 Proceedings of the 12th international conference on Artificial intelligence around man and beyond
Agentification of objects in heterogeneous dynamic environments
MATES'11 Proceedings of the 9th German conference on Multiagent system technologies
µ-SATPLAN: Multi-agent planning as satisfiability
Knowledge-Based Systems
Planning in domains with derived predicates through rule-action graphs and local search
Annals of Mathematics and Artificial Intelligence
Generating diverse plans to handle unknown and partially known user preferences
Artificial Intelligence
An Empirical Analysis of Some Heuristic Features for Planning through Local Search and Action Graphs
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Preference-Based planning via MaxSAT
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Analysing the PDDL language for argumentation-based negotiation planning
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Narrative planning: compilations to classical planning
Journal of Artificial Intelligence Research
SAP speaks PDDL: exploiting a software-engineering model for planning in business process management
Journal of Artificial Intelligence Research
Measurement of the cognitive assembly planning impact
ICIRA'12 Proceedings of the 5th international conference on Intelligent Robotics and Applications - Volume Part I
Towards a theoretical foundation for the harmonization of linked data
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part II
Generating project plans for data center transformations
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Proof Systems for Planning Under Cautious Semantics
Minds and Machines
Flexible execution of partial order plans with temporal constraints
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Automating the evaluation of planning systems
AI Communications
Planning as satisfiability with IPC simple preferences and action costs
AI Communications
Hi-index | 0.00 |
The international planning competition (IPC) is an important driver for planning research. The general goals of the IPC include pushing the state of the art in planning technology by posing new scientific challenges, encouraging direct comparison of planning systems and techniques, developing and improving a common planning domain definition language, and designing new planning domains and problems for the research community. This paper focuses on the deterministic part of the fifth international planning competition (IPC5), presenting the language and benchmark domains that we developed for the competition, as well as a detailed experimental evaluation of the deterministic planners that entered IPC5, which helps to understand the state of the art in the field. We present an extension of pddl, called pddl3, allowing the user to express strong and soft constraints about the structure of the desired plans, as well as strong and soft problem goals. We discuss the expressive power of the new language focusing on the restricted version that was used in IPC5, for which we give some basic results about its compilability into pddl2. Moreover, we study the relative performance of the IPC5 planners in terms of solved problems, CPU time, and plan quality; we analyse their behaviour with respect to the winners of the previous competition; and we evaluate them in terms of their capability of dealing with soft goals and constraints, and of finding good quality plans in general. Overall, the results indicate significant progress in the field, but they also reveal that some important issues remain open and require further research, such as dealing with strong constraints and computing high quality plans in metric-time domains and domains involving soft goals or constraints.