Fast planning through planning graph analysis

From MaRDI portal
Revision as of 16:00, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1402751

DOI10.1016/S0004-3702(96)00047-1zbMath1017.68533OpenAlexW2025460523MaRDI QIDQ1402751

Merrick L. Furst, Avrim L. Blum

Publication date: 28 August 2003

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(96)00047-1




Related Items (79)

Parallel planning via the distribution of operatorsCharacterization, verification and generation of strategies in games with resource constraintsAutomatic workflow verification and generationLong-distance mutual exclusion for planningA heuristic search approach to planning with temporally extended preferencesDeterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the plannersTask decomposition on abstract states, for planning under nondeterminismThe factored policy-gradient plannerGearing Up for Effective ASP PlanningExtracting mutual exclusion invariants from lifted temporal planning domainsA Global Filtration for Satisfying Goals in Mutual Exclusion NetworksThe Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security ProtocolsUsing Satisfiability for Non-optimal Temporal PlanningA formal characterisation of Hamblin's action-state semanticsConflict-directed \(A^{*}\) and its role in model-based embedded systemsAn approach to efficient planning with numerical fluents and multi-criteria plan qualityHeuristics for planning with penalties and rewards formulated in logic and computed through circuitsA competitive and cooperative approach to propositional satisfiabilityConformant planning as a case study of incremental QBF solvingPlanning as satisfiability: heuristicsEfficiently deciding equivalence for standard primitives and phasesState-variable planning under structural restrictions: algorithms and complexityEXPERIENCES WITH PLANNING FOR NATURAL LANGUAGE GENERATIONDomain-Independent Cost-Optimal Planning in ASPAgent planning programsWidth-based search for multi agent privacy-preserving planningPlanning in domains with derived predicates through rule-action graphs and local searchExperimental evaluation of pheromone models in ACOPlanUnnamed ItemA cost-effective planning graph approach for large-scale Web Service CompositionUnnamed ItemOn the complexity of planning for agent teams and its implications for single agent planningOn the completeness of pruning techniques for planning with conditional effectsPlanning as satisfiability: parallel plans and algorithms for plan searchConformant planning via heuristic forward search: A new approachStrong planning under partial observabilityConstraint partitioning in penalty formulations for solving temporal planning problemsProcesses and continuous change in a SAT-based plannerUsing temporal logics to express search control knowledge for planningTowards efficient universal planning: A randomized approachState space search nogood learning: online refinement of critical-path dead-end detectors in planningStar-topology decoupled state space searchNew methods for proving the impossibility to solve problems through reduction of problem spacesModel checking abilities of agents: a closer lookResource separation in dynamic logic of propositional assignmentsDiscovering hidden structure in factored MDPsPlanning and acting in partially observable stochastic domainsModelling and solving English peg solitaireEvaluating new options in the context of existing plansPlanning as heuristic searchA constraint programming formulation for planning: From plan scheduling to plan generationSet-structured and cost-sharing heuristics for classical planningA case study in programming a quantum annealer for hard operational planning problemsPlanning and control in artificial intelligence: A unifying perspectiveA SAT approach to query optimization in mediator systemsLeast commitment in GraphplanPlanning graph as the basis for deriving heuristics for plan synthesis by state space and CSP searchPlanning as constraint satisfaction: Solving the planning graph by compiling it into CSPRepresenting and planning with interacting actions and privacyLandmark-based approaches for goal recognition as planningCOMPLETENESS AND REALIZABILITY: CONDITIONS FOR AUTOMATIC GENERATION OF WORKFLOWSGraphplanProbabilistic Reasoning by SAT SolversRemote Agent: to boldly go where no AI system has gone beforeThe logical foundations of goal-regression planning in autonomous agentsPlanning under uncertainty as G<scp>OLOG</scp>programsReasoning about actions with imprecise and incomplete state descriptionsOn linear logic planning and concurrencyMulti-agent path finding with mutex propagationCPCES: a planning framework to solve conformant planning problems through a counterexample guided refinementGradient-based mixed planning with symbolic and numeric action parametersMANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCYPlan coordination by revision in collective agent based systems.Automated planning as an early verification tool for distributed controlComplexity results for standard benchmark domains in planningA logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) systemMultiobjective heuristic state-space planningContingent planning under uncertainty via stochastic satisfiabilityOn the hierarchical community structure of practical Boolean formulas


Uses Software



Cites Work




This page was built for publication: Fast planning through planning graph analysis