34 citations · 50 across the 7 of their papers we have counts for
9 papers
Conflict-Based Search for Connected Multi-Agent Path Finding
Arthur Queffelec, Ocan Sankur, François Schwarzentruber
We study a variant of the multi-agent path finding problem (MAPF) in which agents are required to remain connected to each other and to a designated base. This problem has applicat…
Dynamic Epistemic Logic Games with Epistemic Temporal Goals
Bastien Maubert, Aniello Murano, Sophie Pinchinat +2
Dynamic Epistemic Logic (DEL) is a logical framework in which one can describe in great detail how actions are perceived by the agents, and how they affect the world. DEL games wer…
Reachability Games in Dynamic Epistemic Logic
Bastien Maubert, Sophie Pinchinat, François Schwarzentruber
We define reachability games based on Dynamic Epistemic Logic (DEL), where the players' actions are finely described as DEL action models. We first consider the setting where an ex…
Reachability and Coverage Planning for Connected Agents: Extended Version
Tristan Charrier, Arthur Queffelec, Ocan Sankur +1
Motivated by the increasing appeal of robots in information-gathering missions, we study multi-agent path planning problems in which the agents must remain interconnected. We model…
Dynamic Connected Cooperative Coverage Problem
Tristan Charrier, François Schwarzentruber, Eva Soulier
We study the so-called dynamic coverage problem by agents located in some topological graph. The agents must visit all regions of interest but they also should stay connected to th…
Dynamic Gossip
Hans van Ditmarsch, Jan van Eijck, Pere Pardo +2
A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. The goal is for all agents to get to know all secrets, in which case we ca…
DL-PA and DCL-PC: model checking and satisfiability problem are indeed in PSPACE
Philippe Balbiani, Andreas Herzig, François Schwarzentruber +1
We prove that the model checking and the satisfiability problem of both Dynamic Logic of Propositional Assignments DL-PA and Coalition Logic of Propositional Control and Delegation…
Ceteris Paribus Structure in Logics of Game Forms
Davide Grossi, Emiliano Lorini, Francois Schwarzentruber
The article introduces a ceteris paribus modal logic interpreted on the equivalence classes induced by sets of propositional atoms. This logic is used to embed two logics of agency…
On the Complexity of Dynamic Epistemic Logic
Guillaume Aucher, Francois Schwarzentruber
Although Dynamic Epistemic Logic (DEL) is an influential logical framework for representing and reasoning about information change, little is known about the computational complexi…