14 citations · 52 across the 23 of their papers we have counts for
5 papers · 1 filter
Sequential Elimination Voting Games
Ulysse Pavloff, Tristan Cazenave, Jérôme Lang
Voting by sequential elimination is a low-communication voting protocol: voters play in sequence and eliminate one or more of the remaining candidates, until only one remains. Whil…
Nested Search versus Limited Discrepancy Search
Tristan Cazenave
Limited Discrepancy Search (LDS) is a popular algorithm to search a state space with a heuristic to order the possible actions. Nested Search (NS) is another algorithm to search a…
Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search
Milo Roucairol, Tristan Cazenave
We demonstrate how Monte Carlo Search (MCS) algorithms, namely Nested Monte Carlo Search (NMCS) and Nested Rollout Policy Adaptation (NRPA), can be used to build graphs and find co…
Planning and Learning: Path-Planning for Autonomous Vehicles, a Review of the Literature
Kevin Osanlou, Christophe Guettier, Tristan Cazenave +1
This short review aims to make the reader familiar with state-of-the-art works relating to planning, scheduling and learning. First, we study state-of-the-art planning algorithms.…
Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability using Tree Search and Graph Neural Networks
Kevin Osanlou, Jeremy Frank, Andrei Bursuc +4
Planning under uncertainty is an area of interest in artificial intelligence. We present a novel approach based on tree search and graph machine learning for the scheduling problem…