scientific article

zbMath1182.68238arXiv1110.2200MaRDI QIDQ3624034

Derek Long, Maria Fox

Publication date: 28 April 2009

Full work available at URL: https://arxiv.org/abs/1110.2200

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

pddl+planning domain description language

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (14)

Decidability and complexity of action-based temporal planning over dense time ⋮ Representing hybrid automata by action language modulo theories ⋮ CASP solutions for planning in hybrid domains ⋮ A Kleene-Schützenberger theorem for weighted timed automata ⋮ Optimal mixed discrete-continuous planning for linear hybrid systems ⋮ Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems ⋮ Deliberative acting, planning and learning with hierarchical operational models ⋮ A constraint programming formulation for planning: From plan scheduling to plan generation ⋮ A Kleene-Schützenberger Theorem for Weighted Timed Automata ⋮ Book review of: P. Haslum et. al., An introduction to the planning domain definition language ⋮ Refinement of Intentions ⋮ First-order stable model semantics with intensional functions ⋮ Gradient-based mixed planning with symbolic and numeric action parameters ⋮ A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning

This page was built for publication: