• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Knowledge-Based Policies for Qualitative Decentralized POMDPs

Thumbnail
Date
2018
Link to item file
https://hal.archives-ouvertes.fr/hal-01646207
Dewey
Intelligence artificielle
Conference name
32nd AAAI Conference on Artificial Intelligence
Conference date
02-2018
Conference city
New Orleans
Conference country
UNITED STATES
URI
https://basepub.dauphine.fr/handle/123456789/20997
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Saffidine, Abdallah
Schwarzentruber, François
Zanuttini, Bruno
Type
Communication / Conférence
Abstract (EN)
Qualitative Decentralized Partially Observable Markov Decision Problems (QDec-POMDPs) constitute a very general class of decision problems. They involve multiple agents, decentralized execution, sequential decision, partial observabil-ity, and uncertainty. Typically, joint policies, which prescribe to each agent an action to take depending on its full history of (local) actions and observations, are huge, which makes it difficult to store them onboard, at execution time, and also hampers the computation of joint plans. We propose and investigate a new representation for joint policies in QDec-POMDPs, which we call Multi-Agent Knowledge-Based Programs (MAKBPs), and which uses epistemic logic for compactly representing conditions on histories. Contrary to standard representations, executing an MAKBP requires reasoning at execution time, but we show that MAKBPs can be exponentially more succinct than any reactive representation.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.