Can AI planners solve practical problems?
Computational Intelligence
A validation-structure-based theory of plan modification and reuse
Artificial Intelligence
Theory and algorithms for plan merging
Artificial Intelligence
Temporal planning with continuous change
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Plan reuse versus plan generation: a theoretical and empirical analysis
Artificial Intelligence - Special volume on planning and scheduling
Fast planning through planning graph analysis
Artificial Intelligence
Intelligent planning: a decomposition and abstraction based approach
Intelligent planning: a decomposition and abstraction based approach
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Unifying SAT-based and Graph-based Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Ignoring Irrelevant Facts and Operators in Plan Generation
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
TALplanner: An Empirical Investigation of a Temporal Logic-based Forward Chaining Planner
TIME '99 Proceedings of the Sixth International Workshop on Temporal Representation and Reasoning
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Combining linear programming and satisfiability solving for resource planning
The Knowledge Engineering Review
Integer optimization models of AI planning problems
The Knowledge Engineering Review
Constraint partitioning in penalty formulations for solving temporal planning problems
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
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables
Journal of Artificial Intelligence Research
A domain-independent algorithm for plan adaptation
Journal of Artificial Intelligence Research
Efficient implementation of the plan graph in STAN
Journal of Artificial Intelligence Research
Total-order planning with partially ordered subtasks
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Decomposition of planning problems
AI Communications
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Artificial Intelligence
Managing concurrency in temporal planning using planner-scheduler interaction
Artificial Intelligence
Learning from planner performance
Artificial Intelligence
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Combining Domain-Independent Planning and HTN Planning: The Duet Planner
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Heuristics for Planning with Action Costs Revisited
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
An intelligent search technique for network security administration
International Journal of Artificial Intelligence and Soft Computing
Planning with problems requiring temporal coordination
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
On-line planning and scheduling: an application to controlling modular printers
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Planning with durative actions in stochastic domains
Journal of Artificial Intelligence Research
Long-distance mutual exclusion for propositional planning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
When is temporal planning really temporal?
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Reducing accidental complexity in planning problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
SAT encodings of state-space reachability problems in numeric domains
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Journal of Artificial Intelligence Research
Translating HTNs to PDDL: a small amount of domain knowledge can go a long way
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Monte-Carlo exploration for deterministic planning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Efficient and distributable methods for solving the multiagent plan coordination problem
Multiagent and Grid Systems - Planning in multiagent systems
A look-ahead B&B search for cost-based planning
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
The LAMA planner: guiding cost-based anytime planning with landmarks
Journal of Artificial Intelligence Research
A temporally expressive planner based on answer set programming with constraints: preliminary design
Logic programming, knowledge representation, and nonmonotonic reasoning
On-line planning and scheduling: an application to controlling modular printers
Journal of Artificial Intelligence Research
Controlling narrative time in interactive storytelling
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
An algorithm to find optimal attack paths in nondeterministic scenarios
Proceedings of the 4th ACM workshop on Security and artificial intelligence
Using the relaxed plan heuristic to select goals in oversubscription planning problems
CAEPIA'11 Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence
Planning in domains with derived predicates through rule-action graphs and local search
Annals of Mathematics and Artificial Intelligence
A planner-based approach to generate and analyze minimal attack graph
Applied Intelligence
Automated adaptation of strategic guidance in multiagent coordination
PRIMA'11 Proceedings of the 14th international conference on Agents in Principle, Agents in Practice
Planning self-adaption with graph transformations
AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance
Multi-objective AI planning: comparing aggregation and pareto approaches
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Optimal interdiction of attack plans
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Group planning with time constraints
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal planning problems and its implementation in the SGPlan4 planner. Based on the strong locality of mutex constraints observed in many benchmarks of the Fourth International Planning Competition (IPC4), we propose to partition the constraints of a planning problem into groups based on their subgoals. Constraint partitioning leads to significantly easier subproblems that are similar to the original problem and that can be efficiently solved by the same planner with some modifications to its objective function. We present a partition-and-resolve strategy that looks for locally optimal subplans in constraint-partitioned temporal planning subproblems and that resolves those inconsistent global constraints across the subproblems. We also discuss some implementation details of SGPlan4, which include the resolution of violated global constraints, techniques for handling producible resources, landmark analysis, path finding and optimization, search-space reduction, and modifications of Metric-FF when used as a basic planner in SGPlan4. Last, we show results on the sensitivity of each of these techniques in quality-time trade-offs and experimentally demonstrate that SGPlan4 is effective for solving the IPC3 and IPC4 benchmarks.