Pages that link to "Item:Q2457630"
From MaRDI portal
The following pages link to Strong planning under partial observability (Q2457630):
Displayed 13 items.
- Plan aggregation for strong cyclic planning in nondeterministic domains (Q460629) (← links)
- Fast strong planning for fully observable nondeterministic planning problems (Q504220) (← links)
- Task decomposition on abstract states, for planning under nondeterminism (Q835827) (← links)
- Conformant plans and beyond: principles and complexity (Q969534) (← links)
- The symbolic OBDD scheme for generating mechanical assembly sequences (Q1028726) (← links)
- Sequential plan recognition: an iterative approach to disambiguating between hypotheses (Q1647950) (← links)
- Knowledge-based programs as succinct policies for partially observable domains (Q2046009) (← links)
- Analyzing generalized planning under nondeterminism (Q2124464) (← links)
- A correctness result for synthesizing plans with loops in stochastic domains (Q2300450) (← links)
- Reactive Policies with Planning for Action Languages (Q2835891) (← links)
- Planning with Incomplete Information (Q3003424) (← links)
- (Q3384176) (← links)
- Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents (Q6135966) (← links)