Probabilistic Planning by Probabilistic Programming

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.

[1]  Sebastian Thrun,et al.  Probabilistic robotics , 2002, CACM.

[2]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[3]  Guy Van den Broeck,et al.  Hashing-Based Approximate Probabilistic Inference in Hybrid Domains , 2015, UAI.

[4]  Luc De Raedt,et al.  Planning in hybrid relational MDPs , 2017, Machine Learning.

[5]  Gerhard Lakemeyer,et al.  Cognitive Robotics , 2008, Handbook of Knowledge Representation.

[6]  Rupak Majumdar,et al.  Approximate counting in SMT and value estimation for probabilistic programs , 2014, Acta Informatica.

[7]  Leslie Pack Kaelbling,et al.  Integrated task and motion planning in belief space , 2013, Int. J. Robotics Res..

[8]  Guy Van den Broeck,et al.  Probabilistic Inference in Hybrid Domains by Weighted Model Integration , 2015, IJCAI.

[9]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[10]  Luc De Raedt,et al.  ProbLog: A Probabilistic Prolog and its Application in Link Discovery , 2007, IJCAI.

[11]  Luc De Raedt,et al.  Planning in Discrete and Continuous Markov Decision Processes by Probabilistic Programming , 2015, ECML/PKDD.

[12]  Hector J. Levesque,et al.  ALLEGRO: Belief-Based Programming in Stochastic Dynamical Domains , 2015, IJCAI.

[13]  Stuart J. Russell,et al.  BLOG: Probabilistic Models with Unknown Objects , 2005, IJCAI.

[14]  Gerhard Lakemeyer,et al.  A Logic for Non-Terminating Golog Programs , 2008, KR.

[15]  Carmel Domshlak,et al.  Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting , 2007, J. Artif. Intell. Res..

[16]  Leslie Pack Kaelbling,et al.  Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..

[17]  Davide Nitti Hybrid Probabilistic Logic Programming , 2016 .

[18]  Luc De Raedt,et al.  Under Consideration for Publication in Theory and Practice of Logic Programming the Magic of Logical Inference in Probabilistic Programming , 2022 .

[19]  Hooman Samani,et al.  Cognitive Robotics , 2015, MIWAI.

[20]  Raymond Reiter,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2001 .

[21]  Jorge A. Baier,et al.  Exploiting Procedural Domain Control Knowledge in State-ofthe-Art Planners ( extended version ) , 2008 .

[22]  A. James 2010 , 2011, Philo of Alexandria: an Annotated Bibliography 2007-2016.

[23]  David Hsu,et al.  Planning under Uncertainty for Robotic Tasks with Mixed Observability , 2010, Int. J. Robotics Res..

[24]  Craig Boutilier,et al.  Decision-Theoretic Planning: Structural Assumptions and Computational Leverage , 1999, J. Artif. Intell. Res..

[26]  Stuart J. Russell,et al.  First-Order Open-Universe POMDPs , 2014, UAI.