Graphplan
From MaRDI portal
Software:19763
No author found.
Related Items (only showing first 100 items - show all)
Parallel planning via the distribution of operators ⋮ Incorporating decision-theoretic planning in a robot architecture ⋮ Conceptual representations of actions for autonomous robots ⋮ A Global Filtration for Satisfying Goals in Mutual Exclusion Networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning ⋮ Logics in Artificial Intelligence ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ EXPERIENCES WITH PLANNING FOR NATURAL LANGUAGE GENERATION ⋮ Unnamed Item ⋮ Domain-Independent Cost-Optimal Planning in ASP ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An LP-Based Heuristic for Optimal Planning ⋮ Solving Simple Planning Problems with More Inference and No Search ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Resource separation in dynamic logic of propositional assignments ⋮ Artificial Intelligence and Soft Computing - ICAISC 2004 ⋮ Evaluating new options in the context of existing plans ⋮ Planning as heuristic search ⋮ Solution techniques for constraint satisfaction problems: Foundations ⋮ Constraint-based agents. An architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds ⋮ Planning and control in artificial intelligence: A unifying perspective ⋮ Least commitment in Graphplan ⋮ Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search ⋮ Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP ⋮ Probabilistic Reasoning by SAT Solvers ⋮ Principles and Practice of Constraint Programming – CP 2003 ⋮ Journal on Data Semantics I ⋮ Planning without state space explosion: Petri net to Markov decision process ⋮ Planning under uncertainty as G<scp>OLOG</scp>programs ⋮ Efficient Informative Sensing using Multiple Robots ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Changes of problem representation. Theory and experiments ⋮ Goal distance estimation for automated planning using neural networks and support vector machines ⋮ Characterization, verification and generation of strategies in games with resource constraints ⋮ Automatic workflow verification and generation ⋮ Long-distance mutual exclusion for planning ⋮ Learning from planner performance ⋮ A heuristic search approach to planning with temporally extended preferences ⋮ Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners ⋮ Task decomposition on abstract states, for planning under nondeterminism ⋮ The factored policy-gradient planner ⋮ Practical solution techniques for first-order MDPs ⋮ Gearing Up for Effective ASP Planning ⋮ Extracting mutual exclusion invariants from lifted temporal planning domains ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Using Satisfiability for Non-optimal Temporal Planning ⋮ A formal characterisation of Hamblin's action-state semantics ⋮ Conflict-directed \(A^{*}\) and its role in model-based embedded systems ⋮ Sequential Monte Carlo in reachability heuristics for probabilistic planning ⋮ An approach to efficient planning with numerical fluents and multi-criteria plan quality ⋮ Heuristics for planning with penalties and rewards formulated in logic and computed through circuits ⋮ Unnamed Item ⋮ A competitive and cooperative approach to propositional satisfiability ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Conformant planning as a case study of incremental QBF solving
This page was built for software: Graphplan
