← Search

Tristan Cazenave

7 accepted papers

2025

Exploring Large Action Sets with Hyperspherical Embeddings using von Mises-Fisher Sampling

ICML 2025poster

This paper introduces von Mises-Fisher exploration (vMF-exp), a scalable method for exploring large action sets in reinforcement learning problems where hyperspherical embedding vectors represent these actions. vMF-exp involves initially sampling a state embedding representation using a von Mises-Fi…

Cited by 0SourcePDFScholar
2023

Topological Planning with Post-unique and Unary Actions

IJCAI 2023poster

We are interested in realistic planning problems to model the behavior of Non-Playable Characters (NPCs) in video games. Search-based action planning, introduced by the game F.E.A.R. in 2005, has an exponential time complexity allowing to control only a dozen NPCs between two frames. A close study o…

Cited by 0SourcePDFScholar
2023

Warm-Starting Nested Rollout Policy Adaptation with Optimal Stopping

AAAI 2023technical

Nested Rollout Policy Adaptation (NRPA) is an approach using online learning policies in a nested structure. It has achieved a great result in a variety of difficult combinatorial optimization problems. In this paper, we propose Meta-NRPA, which combines optimal stopping theory with NRPA for warm-st…

Cited by 9SourcePDFScholar
2022

Generalisation of Alpha-Beta Search for AND-OR Graphs With Partially Ordered Values

IJCAI 2022poster

We define a new setting related to the evaluation of AND-OR directed acyclic graphs with partially ordered values. Such graphs arise naturally when solving games with incomplete information (e.g. most card games such as Bridge) or games with multiple criteria. In particular, this setting generalises…

Cited by 12SourcePDFScholar
2022

Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability Using Tree Search and Graph Neural Networks

AAAI 2022technical

Scheduling under uncertainty is an area of interest in artificial intelligence. We study the problem of Dynamic Controllability (DC) of Disjunctive Temporal Networks with Uncertainty (DTNU), which seeks a reactive scheduling strategy to satisfy temporal constraints in response to uncontrollable acti…

Cited by 5SourcePDFScholar
2019

Optimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search

IROS 2019poster

Learning-based methods are growing prominence for planning purposes. However, there are very few approaches for learning-assisted constrained path-planning on graphs, while there are multiple downstream practical applications. This is the case for constrained path-planning for Autonomous Unmanned Gr…

Cited by 19SourceScholar