Proceedings of the first international conference on Principles of knowledge representation and reasoning
ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Temporal planning with continuous change
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
A Temporal Planning System for Time-Optimal Planning
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
Temporal Planning with Mutual Exclusion Reasoning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Planning via Model Checking: A Decision Procedure for AR
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Gaining efficiency and flexibility in the simple temporal problem
TIME '96 Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)
Constraint-Based Attribute and Interval Planning
Constraints
IBM Journal of Research and Development
Managing concurrency in temporal planning using planner-scheduler interaction
Artificial Intelligence
Cost-optimal external planning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Coordinating agile systems through the model-based execution of temporal plans
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Validating plans in the context of processes and exogenous events
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Planning with problems requiring temporal coordination
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Robust periodic planning and execution for autonomous spacecraft
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
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
Sapa: a multi-objective metric temporal planner
Journal of Artificial Intelligence Research
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables
Journal of Artificial Intelligence Research
VHPOP: versatile heuristic partial order planner
Journal of Artificial Intelligence Research
The deterministic part of IPC-4: an overview
Journal of Artificial Intelligence Research
An approach to temporal planning and scheduling in domains with predictable exogenous events
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
Modelling mixed discrete-continuous domains for planning
Journal of Artificial Intelligence Research
A heuristic search approach to planning with continuous resources in stochastic domains
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
Compiling uncertainty away in conformant planning problems with bounded width
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
Processes and continuous change in a SAT-based planner
Artificial Intelligence
Branching and pruning: An optimal temporal POCL planner based on constraint programming
Artificial Intelligence
Temporal planning in domains with linear processes
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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)
A method for global optimization of large systems of quadratic constraints
COCOS'03 Proceedings of the Second international conference on Global Optimization and Constraint Satisfaction
A hybrid LP-RPG heuristic for modelling numeric resource flows in planning
Journal of Artificial Intelligence Research
Probabilistic planning for continuous dynamic systems under bounded risk
Journal of Artificial Intelligence Research
The actor's view of automated planning and acting: A position paper
Artificial Intelligence
Robotics and artificial intelligence: A perspective on deliberation functions
AI Communications - ECAI 2012 Turing and Anniversary Track
Hi-index | 0.00 |
In this paper we describe COLIN, a forward-chaining heuristic search planner, capable of reasoning with COntinuous LINear numeric change, in addition to the full temporal semantics of PDDL2.1. Through this work we make two advances to the state-of-the-art in terms of expressive reasoning capabilities of planners: the handling of continuous linear change, and the handling of duration-dependent effects in combination with duration inequalities, both of which require tightly coupled temporal and numeric reasoning during planning. COLIN combines FF-style forward chaining search, with the use of a Linear Program (LP) to check the consistency of the interacting temporal and numeric constraints at each state. The LP is used to compute bounds on the values of variables in each state, reducing the range of actions that need to be considered for application. In addition, we develop an extension of the Temporal Relaxed Planning Graph heuristic of CRIKEY3, to support reasoning directly with continuous change. We extend the range of task variables considered to be suitable candidates for specifying the gradient of the continuous numeric change effected by an action. Finally, we explore the potential for employing mixed integer programming as a tool for optimising the timestamps of the actions in the plan, once a solution has been found. To support this, we further contribute a selection of extended benchmark domains that include continuous numeric effects. We present results for COLIN that demonstrate its scalability on a range of benchmarks, and compare to existing state-of-the-art planners.