Set-structured and cost-sharing heuristics for classical planning (Q2268919): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Walksat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Graphplan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10472-009-9170-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003224478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast planning through planning graph analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decision-theoretic foundations for defaults / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of propositional STRIPS planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-based planning in complex domains: Concurrency, constraints and nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning for conjunctive goals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STRIPS: A new approach to the application of theorem proving to problem solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conformant planning via heuristic forward search: A new approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first iterative-deepening: An optimal admissible tree search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using regression-match graphs to control search in planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning to think and communicate with diagrams: 14 questions to consider / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocks World revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining linear programming and satisfiability solving for resource planning / rank
 
Normal rank

Latest revision as of 13:58, 2 July 2024

scientific article
Language Label Description Also known as
English
Set-structured and cost-sharing heuristics for classical planning
scientific article

    Statements

    Set-structured and cost-sharing heuristics for classical planning (English)
    0 references
    0 references
    0 references
    15 March 2010
    0 references
    0 references
    probabilistic reasoning
    0 references
    0 references
    0 references
    0 references