ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Temporal planning with continuous change
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
DAC '96 Proceedings of the 33rd annual Design Automation Conference
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Fast planning through planning graph analysis
Artificial Intelligence
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Temporal Planning with Mutual Exclusion Reasoning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The Quest for Efficient Boolean Satisfiability Solvers
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Encoding Planning Problems in Nonmonotonic Logic Programs
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Optimization algorithms for the minimum-cost satisfiability problem
Optimization algorithms for the minimum-cost satisfiability problem
Learning action models from plan examples using weighted MAX-SAT
Artificial Intelligence
Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Self-optimizing Peer-to-Peer Networks with Selfish Processes
SASO '07 Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Artificial Intelligence
SAT-Based Planning with Minimal-#actions Plans and "soft" Goals
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
Managing concurrency in temporal planning using planner-scheduler interaction
Artificial Intelligence
Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Exploiting Cycle Structures in Max-SAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Algorithms for Weighted Boolean Optimization
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Continuous time in a SAT-based planner
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Planning with problems requiring temporal coordination
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Explicit-state abstraction: a new method for generating heuristic functions
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
The case for durative actions: a commentary on PDDL2.1
Journal of Artificial Intelligence Research
Sapa: a multi-objective metric temporal planner
Journal of Artificial Intelligence Research
TALplanner in the third international planning competition: extensions and control rules
Journal of Artificial Intelligence Research
VHPOP: versatile heuristic partial order planner
Journal of Artificial Intelligence Research
New inference rules for Max-SAT
Journal of Artificial Intelligence Research
The LPSAT engine & its application to resource planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
When is temporal planning really temporal?
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Planning with resources and concurrency a forward chaining approach
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Constraint partitioning in penalty formulations for solving temporal planning problems
Artificial Intelligence
Branching and pruning: An optimal temporal POCL planner based on constraint programming
Artificial Intelligence
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
Completeness and optimality preserving reduction for planning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On inconsistent clause-subsets for Max-SAT solving
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Clone: solving weighted Max-SAT in a reduced search space
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Localising temporal constraints in scientific workflows
Journal of Computer and System Sciences
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Learning complex action models with quantifiers and logical implications
Artificial Intelligence
Partial weighted MaxSAT for optimal planning
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
The LAMA planner: guiding cost-based anytime planning with landmarks
Journal of Artificial Intelligence Research
OPTSAT: a tool for solving SAT related optimization problems
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
A survey of automated web service composition methods
SWSWPC'04 Proceedings of the First international conference on Semantic Web Services and Web Process Composition
Search pruning techniques in SAT-based branch-and-bound algorithms for the binate covering problem
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
Complex features, such as temporal dependencies and numerical cost constraints, are hallmarks of real-world planning problems. In this article, we consider the challenging problem of cost-sensitive temporally expressive (CSTE) planning, which requires concurrency of durative actions and optimization of action costs. We first propose a scheme to translate a CSTE planning problem to a minimum cost (MinCost) satisfiability (SAT) problem and to integrate with a relaxed parallel planning semantics for handling true temporal expressiveness. Our scheme finds solution plans that optimize temporal makespan, and also minimize total action costs at the optimal makespan. We propose two approaches for solving MinCost SAT. The first is based on a transformation of a MinCost SAT problem to a weighted partial Max-SAT (WPMax-SAT), and the second, called BB-CDCL, is an integration of the branch-and-bound technique and the conflict driven clause learning (CDCL) method. We also develop a CSTE customized variable branching scheme for BB-CDCL which can significantly improve the search efficiency. Our experiments on the existing CSTE benchmark domains show that our planner compares favorably to the state-of-the-art temporally expressive planners in both efficiency and quality.