Modelling mixed discrete-continuous domains for planning
From MaRDI portal
Recommendations
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- scientific article; zbMATH DE number 2038893
- Planning for hybrid systems via satisfiability modulo theories
- CASP solutions for planning in hybrid domains
- scientific article; zbMATH DE number 2038897
Cited in
(25)- Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems
- Gradient-based mixed planning with symbolic and numeric action parameters
- Decidability and complexity of action-based temporal planning over dense time
- Deliberative acting, planning and learning with hierarchical operational models
- A constraint programming formulation for planning: From plan scheduling to plan generation
- Book review of: P. Haslum et. al., An introduction to the planning domain definition language
- First-order stable model semantics with intensional functions
- Refinement of intentions
- COLIN: planning with continuous linear numeric change
- scientific article; zbMATH DE number 2038893 (Why is no real title available?)
- ScottyActivity: mixed discrete-continuous planning with convex optimization
- Representing hybrid automata by action language modulo theories
- CASP solutions for planning in hybrid domains
- Planning for hybrid systems via satisfiability modulo theories
- A Kleene-Schützenberger Theorem for Weighted Timed Automata
- A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Optimal mixed discrete-continuous planning for linear hybrid systems
- A Kleene-Schützenberger theorem for weighted timed automata
- Comparing planning domain models using answer set programming
- A domain-independent agent architecture for adaptive operation in evolving open worlds
- Planning in artificial intelligence
- A correct-by-construction approach for development of reliable planning problems
- Domain-independent dynamic programming
- Generalised merge and shrink abstractions for temporal planning
This page was built for publication: Modelling mixed discrete-continuous domains for planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624034)
