Task decomposition on abstract states, for planning under nondeterminism (Q835827): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Marco Pistore / rank
Normal rank
 
Property / author
 
Property / author: Paolo Traverso / rank
Normal rank
 
Property / author
 
Property / author: Marco Pistore / rank
 
Normal rank
Property / author
 
Property / author: Paolo Traverso / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Graphplan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SHOP2 / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2008.11.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072963858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak, strong, and strong cyclic planning via symbolic model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning control rules for reactive agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using temporal logics to express search control knowledge for planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong planning under partial observability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast planning through planning graph analysis / 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: Conformant planning via heuristic forward search: A new approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TALplanner: A temporal logic based forward chaining planner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for HTN planning / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:58, 1 July 2024

scientific article
Language Label Description Also known as
English
Task decomposition on abstract states, for planning under nondeterminism
scientific article

    Statements

    Task decomposition on abstract states, for planning under nondeterminism (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 August 2009
    0 references
    0 references
    planning in nondeterministic domains
    0 references
    hierarchical task-network planning
    0 references
    binary decision diagrams
    0 references
    0 references
    0 references
    0 references
    0 references