1 citations · 2 across the 3 of their papers we have counts for
5 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…