Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
On Solving a Stochastic Shortest-Path Markov Decision Process as Probabilistic Inference
HTML
PDF
Details
Locations
Year:
2021
Type:
conference-paper
Source:
Communications in computer and information science
Parent work:
Machine Learning and Principles and Practice of Knowledge Discovery in Databases: International Workshops of ECML PKDD 2021, Virtual Event, September 13-17, 2021, Proceedings, Part I
DOI:
10.1007/978-3-030-93736-2_58
Authors:
Mohamed Baioumy,
Bruno Lacerda,
Paul Duckworth,
Nick Hawes
Institution:
University of Oxford
Language:
English
Topic:
Reinforcement Learning in Robotics
Subfield:
Artificial Intelligence
Field:
Computer Science
Domain:
Physical Sciences
Keywords:
active inference,
probabilistic inference,
planning under uncertainty,
online planning,
offline planning,
dynamic programming,
finite-horizon MDPs
show all 7
Open Access status:
green
OpenAlex ID:
W3199477924
FWCI:
0.288
Cites:
36
Cited by:
4
Related to:
10