Planning and acting in partially observable stochastic domains
From MaRDI portal
(Redirected from Publication:72343)
Recommendations
- Planning in partially-observable switching-mode continuous domains
- scientific article; zbMATH DE number 5547912
- Strong planning under partial observability
- Learning and planning in partially observable environments without prior domain knowledge
- Replanning in domains with partial information and sensing actions
- Randomized belief-space replanning in partially-observable continuous spaces
Cites work
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1095138 (Why is no real title available?)
- scientific article; zbMATH DE number 795587 (Why is no real title available?)
- A survey of algorithmic methods for partially observed Markov decision processes
- A survey of solution techniques for the partially observed Markov decision process
- Application of Jensen's inequality to adaptive suboptimal design
- Fast planning through planning graph analysis
- OPTIMAL CONTROL FOR PARTIALLY OBSERVABLE MARKOV DECISION PROCESSES OVER AN INFINITE HORIZON
- Optimal control of Markov processes with incomplete state information
- Solution Procedures for Partially Observed Markov Decision Processes
- Solving H-horizon, stationary Markov decision problems in time proportional to log (H)
- State of the Art—A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms
- The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
- The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
- The Optimal Search for a Moving Target When the Search Path Is Constrained
- The complexity of mean payoff games on graphs
- The complexity of stochastic games
Cited in
(only showing first 100 items - show all)- Cost-sensitive feature acquisition and classification
- A conflict-directed approach to chance-constrained mixed logical linear programming
- Systems of Bounded Rational Agents with Information-Theoretic Constraints
- A Markovian model for the spread of the SARS-CoV-2 virus
- Optimal cost almost-sure reachability in POMDPs
- Probabilistic reasoning about epistemic action narratives
- Performance prediction of an unmanned airborne vehicle multi-agent system
- Counterexample-guided inductive synthesis for probabilistic systems
- Incremental Learning of Planning Operators in Stochastic Domains
- Randomized belief-space replanning in partially-observable continuous spaces
- scientific article; zbMATH DE number 1509479 (Why is no real title available?)
- scientific article; zbMATH DE number 2243394 (Why is no real title available?)
- Using machine learning for decreasing state uncertainty in planning
- A dynamic epistemic framework for reasoning about conformant probabilistic plans
- Enforcing almost-sure reachability in POMDPs
- Partially observable game-theoretic agent programming in Golog
- Model-Based Reinforcement Learning for Partially Observable Games with Sampling-Based State Estimation
- Learning and planning in partially observable environments without prior domain knowledge
- Recursively modeling other agents for decision making: a research perspective
- Permissive planning: Extending classical planning to uncertain task domains.
- Computation of weighted sums of rewards for concurrent MDPs
- Reasoning about uncertain parameters and agent behaviors through encoded experiences and belief planning
- Representations for robot knowledge in the \textsc{KnowRob} framework
- Approximability and efficient algorithms for constrained fixed-horizon POMDPs with durative actions
- scientific article; zbMATH DE number 4174347 (Why is no real title available?)
- Bounded-parameter partially observable Markov decision processes: framework and algorithm
- ``Guess what I'm doing: extending legibility to sequential decision tasks
- Finding the optimal exploration-exploitation trade-off online through Bayesian risk estimation and minimization
- Cyber vulnerability maintenance policies that address the incomplete nature of inspection
- An evidential approach to SLAM, path planning, and active exploration
- Probabilistic Planning with Reduced Models
- Classical Planning in Deep Latent Space
- A reinforcement learning scheme for a partially-observable multi-agent game
- An Uncertainty-Based Belief Selection Method for POMDP Value Iteration
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- scientific article; zbMATH DE number 2090957 (Why is no real title available?)
- Robust almost-sure reachability in multi-environment MDPs
- Multi-goal motion planning using traveling salesman problem in belief space
- Goal-directed learning of features and forward models
- Strong planning under partial observability
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Analyzing generalized planning under nondeterminism
- Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)
- Transfer in variable-reward hierarchical reinforcement learning
- scientific article; zbMATH DE number 1844461 (Why is no real title available?)
- Finite-horizon LQR controller for partially-observed Boolean dynamical systems
- Epistemic uncertainty aware semantic localization and mapping for inference and belief space planning
- An integrated approach to solving influence diagrams and finite-horizon partially observable decision processes
- Quantitative controller synthesis for consumption Markov decision processes
- Recognizing and learning models of social exchange strategies for the regulation of social interactions in open agent societies
- Patient-type Bayes-adaptive treatment plans
- Tutorial series on brain-inspired computing. IV: Reinforcement learning: machine learning and natural learning
- Optimal decision rules in repeated games where players infer an opponent's mind via simplified belief calculation
- Open problems in universal induction \& intelligence
- A reinforcement learning scheme for a partially-observable multi-agent game
- Unsupervised basis function adaptation for reinforcement learning
- Strategy Graphs for Influence Diagrams
- Computer Vision - ECCV 2004
- Markov decision processes with sequential sensor measurements
- Myopic bounds for optimal policy of POMDPs: an extension of lovejoy's structural results
- POMDP solving: what rewards do you really expect at execution?
- Heuristic anytime approaches to stochastic decision processes
- POMDP planning for robust robot control
- Optimal experimental design: formulations and computations
- Reinforcement learning with limited reinforcement: using Bayes risk for active learning in POMDPs
- The value of information for populations in varying environments
- scientific article; zbMATH DE number 4166888 (Why is no real title available?)
- Optimal speech motor control and token-to-token variability: a Bayesian modeling approach
- Active inference and agency: optimal control without cost functions
- A sufficient statistic for influence in structured multiagent environments
- Planning in artificial intelligence
- A Bayesian theory of mind approach to modeling cooperation and communication
- Locally-connected interrelated network: a forward propagation primitive
- Learning-based state estimation and control using MHE and MPC schemes with imperfect models
- Stochastic dynamic programming with factored representations
- Representation and Timing in Theories of the Dopamine System
- A survey of inverse reinforcement learning: challenges, methods and progress
- Behavioral model summarisation for other agents under uncertainty
- Exact decomposition approaches for Markov decision processes: a survey
- Integrated common sense learning and planning in POMDPs
- Integration of reinforcement learning and optimal decision-making theories of the basal ganglia
- Task-structured probabilistic I/O automata
- General value function networks
- Constrained multiagent Markov decision processes: a taxonomy of problems and algorithms
- Exploiting symmetries for single- and multi-agent partially observable stochastic domains
- Reward tampering problems and solutions in reinforcement learning: a causal influence diagram perspective
- Off-policy evaluation in partially observed Markov decision processes under sequential ignorability
- Bottom-up learning of hierarchical models in a class of deterministic pomdp environments
- pomdpSolve
- A two-state partially observable Markov decision process with three actions
- Gradient-descent for randomized controllers under partial observability
- Probabilistic Reasoning by SAT Solvers
- Policy iteration for bounded-parameter POMDPs
- Posterior weighted reinforcement learning with state uncertainty
- Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
- Induction and exploitation of subgoal automata for reinforcement learning
- Knowledge-based programs as succinct policies for partially observable domains
- Conformant plans and beyond: principles and complexity
- State observation accuracy and finite-memory policy performance
- scientific article; zbMATH DE number 7453114 (Why is no real title available?)
This page was built for publication: Planning and acting in partially observable stochastic domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q72343)
