COLIN: planning with continuous linear numeric change
From MaRDI portal
Abstract: 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 PDDL. 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.
Recommendations
Cited in
(12)- Strong temporal planning with uncontrollable durations
- Falsification of hybrid systems with symbolic reachability analysis and trajectory splicing
- Gradient-based mixed planning with symbolic and numeric action parameters
- Minimum mixed time-energy trajectory planning of a nonlinear vehicle subject to 2D disturbances
- Processes and continuous change in a SAT-based planner
- CP methods for scheduling and routing with~time-dependent task costs
- COLIN
- ScottyActivity: mixed discrete-continuous planning with convex optimization
- CASP solutions for planning in hybrid domains
- Combined time and energy optimal trajectory planning with quadratic drag for mixed discrete-continuous task planning
- Optimal mixed discrete-continuous planning for linear hybrid systems
- A domain-independent agent architecture for adaptive operation in evolving open worlds
This page was built for publication: COLIN: planning with continuous linear numeric change
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2905379)
