Artificial Intelligence - Special volume on qualitative reasoning about physical systems
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)
Fast planning through planning graph analysis
Artificial Intelligence
SAT-Based Decision Procedures for Classical Modal Logics
Journal of Automated Reasoning
Unifying SAT-based and Graph-based Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The LPSAT Engine & Its Application to Resource Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Combining linear programming and satisfiability solving for resource planning
The Knowledge Engineering Review
Tm-lpsat: encoding temporal metric planning in continuous time
Tm-lpsat: encoding temporal metric planning in continuous time
Automatic SAT-compilation of planning problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Processes and continuous change in a SAT-based planner
Artificial Intelligence
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
Journal of Automated Reasoning
Validating plans in the context of processes and exogenous events
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Processes and continuous change in a SAT-based planner
Artificial Intelligence
A SAT-based approach to cost-sensitive temporally expressive planning
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
| Hi-index | 0.00 |
The TM-LPSAT planner can construct plans in domains containing atomic actions and durative actions; events and processes; discrete, real-valued, and interval-valued fluents; and continuous linear change to quantities. It works in three stages. In the first stage, a representation of the domain and problem in an extended version of PDDL+ is compiled into a system of propositional combinations of propositional variables and linear constraints over numeric variables. In the second stage, the LPSAT constraint engine (Wolfman & Weld 2000) is used to find a solution to the system of constraints. In the third stage, a correct parallel plan is extracted from this solution. We discuss the structure of the planner and show how a real-time temporal model is compiled into LPSAT constraints.