activity
20122024
most citedPenetration Testing == POMDP Solving?

30 citations · 90 across the 10 of their papers we have counts for

collaborators

11 papers

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.RO2023

Robust Robot Planning for Human-Robot Collaboration

Yang You, Vincent Thomas, Francis Colas +2

In human-robot collaboration, the objectives of the human are often unknown to the robot. Moreover, even assuming a known objective, the human behavior is also uncertain. In order…

cs.AI2022

HSVI can solve zero-sum Partially Observable Stochastic Games

Aurélien Delage, Olivier Buffet, Jilles S. Dibangoye +1

State-of-the-art methods for solving 2-player zero-sum imperfect information games rely on linear programming or regret minimization, though not on dynamic programming (DP) or heur…

cs.GT2021

HSVI for zs-POSGs using Concavity, Convexity and Lipschitz Properties

Aurélien Delage, Olivier Buffet, Jilles Dibangoye

Dynamic programming and heuristic search are at the core of state-of-the-art solvers for sequential decision-making problems. In partially observable or collaborative settings (\eg…

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…