Fast planning through planning graph analysis (Q1402751): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1127356
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Avrim L. Blum / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Prodigy / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UCPOP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial-order planning: Evaluating possible efficiency gains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis on the <i>p</i>-adic superspace. I. Generalized functions: Gaussian distribution / 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: Planning for conjunctive goals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0004-3702(96)00047-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025460523 / rank
 
Normal rank

Latest revision as of 08:32, 30 July 2024

scientific article
Language Label Description Also known as
English
Fast planning through planning graph analysis
scientific article

    Statements

    Fast planning through planning graph analysis (English)
    0 references
    0 references
    0 references
    28 August 2003
    0 references
    General purpose planning
    0 references
    STRIPS planning
    0 references
    Graph algorithms
    0 references
    Planning graph analysis
    0 references
    0 references
    0 references

    Identifiers