paper-with-me

홈 › Papers

Probabilistic Planning by Probabilistic Programming

2018-01-25 · Vaishak Belle

Automated planning is a major topic of research in artificial intelligence, and enjoys a long and distinguished history. The classical paradigm assumes a distinguished initial state, comprised of a set of facts, and is defined over a set of actions which change that state in one way or another. Planning in many real-world settings, however, is much more involved: an agent's knowledge is almost never simply a set of facts that are true, and actions that the agent intends to execute never operate the way they are supposed to. Thus, probabilistic planning attempts to incorporate stochastic models directly into the planning process. In this article, we briefly report on probabilistic planning through the lens of probabilistic programming: a programming paradigm that aims to ease the specification of structured probability distributions. In particular, we provide an overview of the features of two systems, HYPE and ALLEGRO, which emphasise different strengths of probabilistic programming that are particularly useful for complex modelling issues raised in probabilistic planning. Among other things, with these systems, one can instantiate planning problems with growing and shrinking state spaces, discrete and continuous probability distributions, and non-unique prior distributions in a first-order setting.

📄 PDF Abstract BibTeX arXiv:1801.08365

Code (0)

등록된 구현이 없습니다.

Tasks

Probabilistic Programming

Similar Papers 제목 키워드 기반

Stochastic Planning and Lifted Inference

2017-01-04 · Roni Khardon, Scott Sanner

Lifted probabilistic inference (Poole, 2003) and symbolic dynamic programming for lifted stochastic planning (Boutilier et al, 2001) were introduced around the same time as algorithmic efforts to use abstraction in stoch…

Decision MakingSequential Decision Making

A Unified View of Algorithms for Path Planning Using Probabilistic Inference on Factor Graphs

2021-06-19 · Francesco A. N. Palmieri, Krishna R. Pattipati, Giovanni Di Gennaro, Giovanni Fioretti 외

Even if path planning can be solved using standard techniques from dynamic programming and control, the problem can also be approached using probabilistic inference. The algorithms that emerge using the latter framework …

Tractable Probabilistic Models for Investment Planning

2025-11-17 · Nicolas M. Cuadrado A., Mohannad Takrouri, Jiří Němeček, Martin Takáč 외 arxiv

Investment planning in power utilities, such as generation and transmission expansion, requires decisions under substantial uncertainty over decade--long horizons for policies, demand, renewable availability, and outages…

Deployable probabilistic programming

2019-06-20 · David Tolpin

We propose design guidelines for a probabilistic programming facility suitable for deployment as a part of a production software system. As a reference implementation, we introduce Infergo, a probabilistic programming fa…

Decision MakingProbabilistic Programming

On Solving a Stochastic Shortest-Path Markov Decision Process as Probabilistic Inference

2021-09-13 · Mohamed Baioumy, Bruno Lacerda, Paul Duckworth, Nick Hawes

Previous work on planning as active inference addresses finite horizon problems and solutions valid for online planning. We propose solving the general Stochastic Shortest-Path Markov Decision Process (SSP MDP) as probab…

valid