• Aucun résultat trouvé

Probabilistic Planning and Control by Probabilistic Programming: Semantics, Inference and Learning

N/A
N/A
Protected

Academic year: 2022

Partager "Probabilistic Planning and Control by Probabilistic Programming: Semantics, Inference and Learning"

Copied!
1
0
0

Texte intégral

(1)

Probabilistic Planning and Control by Probabilistic Programming: Semantics, Inference and Learning

Vaishak Belle

Centre for Intelligent Systems and their Applications University of Edinburgh,

Edinburgh, EH8 9AB, Scotland, UK

Abstract

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 (logic) 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. In the last part of the talk, we discuss some ongoing work on how to learn the parameter and structure of probabilistic (logic) programs.

openEASE can be used by KR&R researchers using a browser-based query and visualization interface, but also remotely by robotic via a WebSocket API.

About the Author

Vaishak Belle is a Chancellor’s Fellow/Lecturer at the School of Informatics, University of Edinburgh, an Alan Turing Institute Faculty Fellow, and a member of the RSE (Royal Society of Edinburgh) Young Academy of Scotland. Vaishak’s research is in artificial intelligence, and is motivated by the need to augment learning and perception with high-level structured, commonsensical knowledge, to enable AI systems to learn faster and more accurate models of the world. He is interested in computational frameworks that are able to explain their decisions, modular, re-usable, and robust to variations in problem description. He has co-authored over 40 scientific articles on AI, and along with his co-authors, he has won the Microsoft best paper award at UAI, and the Machine learning journal award at ECML-PKDD. In 2014, he received a silver medal by the Kurt Goedel Society.

Copyrightc by the paper’s authors. Copying permitted for private and academic purposes.

In: G. Steinbauer, A. Ferrein (eds.): Proceedings of the 11th International Workshop on Cognitive Robotics, Tempe, AZ, USA, 27-Oct-2018, published at http://ceur-ws.org

2

Références

Documents relatifs

Learning Apart from including neural networks in inference, DeepProbLog is also able to train the neural networks represented by the neural predicates.. We use the learning

We also propose and implement an algorithm, called Parameter learning for HIerarchical probabilistic Logic program (PHIL) 3 that learns the parameter of HPLP using EM and

In this paper we consider two typical scenarios of a Bitcoin network and we model them by probabilistic logic programming (PLP): the centralization of the hashing power by large

P-SHIQ(D) uses probabilistic lexico- graphic entailment from probabilistic default reasoning and allows to annotate with a probabilistic interval both assertional and

In what follows we present the abductive representation used by XHAIL for computing inductive solutions and the statistical abduction for com- puting a probability distribution

In this paper we show that is possible to represent NLP models such as Probabilistic Context Free Grammars, Probabilistic Left Corner Grammars and Hidden Markov Models

We thus present TRILL, for “Tableau Reasoner for descrIption Log- ics in proLog”, that implements a tableau algorithm and is able to return explanations for queries and

Probabilistic logic programming has a long tradition dating back at least to the seminal works of David Poole and Taisuke Sato in the early 90s. Still, the enormous recent interest