About Me
I'm a Ph.D. student at University of Rennes supervised by François Schwarzentruber from ENS Lyon, Zoltan Miklos and Ocan Sankur from the University of Rennes. I work with the company NewLogUp. My thesis is about the Multi-agent Pathfinding. The title is “Multi-agent Pathfinding under Communication and Resource Constraints" .
Publications
Linear Planar 3-SAT
Victorien Desbois, Ocan Sankur, François Schwarzentruber Theoretical Computer Science - may 2026
Several fragments of the satisfiability problem have been studied in the literature. Among these, Linear 3-SAT is a satisfaction problem in which each clause (viewed as a set of literals) intersects with at most one other clause; moreover, any pair of clauses have at most one literal in common. Planar 3-SAT is a fragment which requires that the so-called variable-clause graph is planar. Both fragments are NP-complete and have applications in encoding NP-hard planning problems.
View ArticleAn Efficient Modular Algorithm for Connected Multi-Agent Path Finding (ECAI 2024)
Victorien Desbois, Ocan Sankur, François Schwarzentruber Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024
We present a new algorithm for solving the connected multi-agent path finding problem (connected MAPF) which consists in finding paths for a set of agents that avoid collisions but also ensure connectivity between agents during the mission.
View ArticleResearch Interests
- Search Algorithms
- Complexity Theory
- Planning
Teaching
I teach two modules at University of Rennes.- ACE (Algorithm and Complexity): A course aimed at first years of university about computational complexity.
- CAL (Computability): A course aimed at second years of university about computability.
Contact Me
Feel free to reach out to me via the following platforms:
- Email: victorien.desbois [at] proton.me
- Email Inria: victorien.desbois [at] inria.fr
- GitHub: My GitHub