activity
20122025
most citedNear-Optimal BRL using Optimistic Local Transitions

27 citations · 33 across the 7 of their papers we have counts for

collaborators

8 papers

cs.AI2025

Partially Observable Monte-Carlo Graph Search

Yang You, Vincent Thomas, Alex Schutz +3

Currently, large partially observable Markov decision processes (POMDPs) are often solved by sampling-based online methods which interleave planning and execution phases. However,…

cs.AI2025

Observer-Aware Probabilistic Planning Under Partial Observability

Salomé Lepers, Vincent Thomas, Olivier Buffet

In this article, we are interested in planning problems where the agent is aware of the presence of an observer, and where this observer is in a partial observability situation. Th…

cs.AI2024

How to Exhibit More Predictable Behaviors

Salomé Lepers, Sophie Lemonnier, Vincent Thomas +1

This paper looks at predictability problems, i.e., wherein an agent must choose its strategy in order to optimize the predictions that an external observer could make. We address t…

cs.AI2023

Monte-Carlo Search for an Equilibrium in Dec-POMDPs

Yang You, Vincent Thomas, Francis Colas +1

Decentralized partially observable Markov decision processes (Dec-POMDPs) formalize the problem of designing individual controllers for a group of collaborative agents under stocha…

cs.AI2021

Solving infinite-horizon Dec-POMDPs using Finite State Controllers within JESP

Yang You, Vincent Thomas, Francis Colas +1

This paper looks at solving collaborative planning problems formalized as Decentralized POMDPs (Dec-POMDPs) by searching for Nash equilibria, i.e., situations where each agent's po…

cs.AI2021★ 5 cited

Monte Carlo Information-Oriented Planning

Vincent Thomas, Gérémy Hutin, Olivier Buffet

In this article, we discuss how to solve information-gathering problems expressed as rho-POMDPs, an extension of Partially Observable Markov Decision Processes (POMDPs) whose rewar…