Pierre Le Bodic
6 papers · 2017–2025 · 3 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (14) π£ Hot Topic Early Bird π Academic Marathon Β· Sprint π Conference Polyglot Β· Bronze π Interdisciplinary Bridge Β· Silver
π
Renaissance Researcher
(5)
π
Conference Pioneer
Venues
Top co-authors
Research topics
Machine Learning
(3)
Optimization & Theory
(3)
Artificial Intelligence
(2)
Computer Science
(2)
Mathematics & Optimization
(2)
Core AI
(2)
Foundations
(2)
Optimization
(2)
Reinforcement Learning
(1)
Robotics
(1)
Application Areas
(1)
Applications Β· Reinforcement Learning
(1)
Applications Β· Robotics
(1)
Core Methods
(1)
Learning Types
(1)
Keywords
mixed integer programming
(2)
multi-agent path finding
(2)
feature learning
(1)
orthogonal projection
(1)
heuristic search
(1)
branch and bound
(1)
risk minimization
(1)
gradient boosting
(1)
online algorithm
(1)
optimization algorithm
(1)
additive model
(1)
mathematical optimization
(1)
interpretable model
(1)
sampling algorithm
(1)
probabilistic analysis
(1)
rule ensemble
(1)
restart strategy
(1)
conflict-based search
(1)
optimal planning
(1)
search tree
(1)
Papers
Concurrent Planning and Execution in Lifelong Multi-Agent Path Finding with Delay Probabilities
AAAI 2025
Orthogonal Gradient Boosting for Simpler Additive Rule Ensembles
AISTATS 2024
f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search
AAAI 2021
Branch-and-Cut-and-Price for Multi-Agent Pathfinding
IJCAI 2019
Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation
AAAI 2019
Estimating the size of search trees by sampling with domain knowledge
IJCAI 2017