Strong planning under partial observability (Q2457630): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62041362, #quickstatements; #temporary_batch_1712446058616
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Symbolic model checking: \(10^{20}\) states and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conformant planning via symbolic model checking and heuristic search / 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: Conformant planning via heuristic forward search: A new approach / 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: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications / 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 and acting in partially observable stochastic domains / 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: Q4527271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LAO*: A heuristic search algorithm that finds solutions with loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for searching implicit AND/OR graphs with cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning control rules for reactive agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: AND/OR graph heuristic search methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolants and Symbolic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing decision trees through heuristically guided search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: In defense of PDDL axioms / rank
 
Normal rank

Latest revision as of 11:40, 27 June 2024

scientific article
Language Label Description Also known as
English
Strong planning under partial observability
scientific article

    Statements

    Strong planning under partial observability (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 October 2007
    0 references
    0 references
    planning under partial observability
    0 references
    planning in nondeterministic domains
    0 references
    heuristic search in belief space
    0 references
    symbolic model checking
    0 references
    binary decision diagrams
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references