Graphplan
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Reasoning about actions with imprecise and incomplete state descriptions
- On linear logic planning and concurrency
- State-variable planning under structural restrictions: algorithms and complexity
- On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning
- Remote Agent: to boldly go where no AI system has gone before
- Let's plan it deductively!
- The logical foundations of goal-regression planning in autonomous agents
- Using regression-match graphs to control search in planning
- PReLearn
- QOCA
- SymChaff
- A tabu search heuristic for resource management in naval warfare
- Saturn
- Inductive synthesis of functional programs. Universal planning, folding of finite programs, and schema abstraction by analogical reasoning.
- JavaLog
- CP-nets
- pGOLOG
- RealPlan
- ConGolog
- GOLOG
- STAN
- IPC-4
- Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan
- Extracting mutual exclusion invariants from lifted temporal planning domains
- Walksat
- AspectWerkz
- Siege
- CUDD
- QingTing1
- Smodels
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
- CPlan
- Star-topology decoupled state space search
- Discovering hidden structure in factored MDPs
- Planning as propositional CSP: From Walksat to local search techniques for action graphs
- A SAT approach to query optimization in mediator systems
- Using genetic programming to learn and improve control knowledge.
- Plan coordination by revision in collective agent based systems.
- Changes of problem representation. Theory and experiments
- PDDL
- plasp
- Orc
- A cost-effective planning graph approach for large-scale Web Service Composition
- FODD-Planner
- FluCaP
- Logic programs with stable model semantics as a constraint programming paradigm
- Using temporal logics to express search control knowledge for planning
- Towards efficient universal planning: A randomized approach
- A case study in programming a quantum annealer for hard operational planning problems
- Multi-agent path finding with mutex propagation
- Coala
- JTLV
- Gradient-based mixed planning with symbolic and numeric action parameters
- TRAMP
- On the hierarchical community structure of practical Boolean formulas
- Cunf
- Characterization, verification and generation of strategies in games with resource constraints
- OFMC
- SATMC
- Galliwasp
- Azucar
- NMRDPP
- JOpera
- SWORD
- A constraint programming formulation for planning: From plan scheduling to plan generation
- Set-structured and cost-sharing heuristics for classical planning
- Representing and planning with interacting actions and privacy
- Landmark-based approaches for goal recognition as planning
- Automated planning as an early verification tool for distributed control
- Automatic workflow verification and generation
- 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
- Conformant planning as a case study of incremental QBF solving
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
- On the complexity of planning for agent teams and its implications for single agent planning
- Planning as satisfiability: parallel plans and algorithms for plan search
- Conformant planning via heuristic forward search: A new approach
- Strong planning under partial observability
- Constraint partitioning in penalty formulations for solving temporal planning problems
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- Processes and continuous change in a SAT-based planner
- Understanding planning tasks. Domain complexity and heuristic decomposition
- Model checking abilities of agents: a closer look
- Reasoning robots. The art and science of programming robotic agents
- Modelling and solving English peg solitaire
- TorchLight
- A formal characterisation of Hamblin's action-state semantics
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems
- Goal distance estimation for automated planning using neural networks and support vector machines
- Partial-order planning with concurrent interacting actions
- The FF planning system: Fast plan generation through heuristic search
- AI planning in a constraint programming framework
- Goal recognition through goal graph analysis
- Functional strips: A more flexible language for planning and problem solving
- scientific article; zbMATH DE number 1696710 (Why is no real title available?)
- scientific article; zbMATH DE number 1696833 (Why is no real title available?)
- Combining linear programming and satisfiability solving for resource planning
- scientific article; zbMATH DE number 1728568 (Why is no real title available?)
- Managing temporal cycles in planning problems requiring concurrency
This page was built for software: Graphplan
