michaelbzms / MonteCarloTreeSearchLinks
A fast C++ impementation of Monte Carlo Tree Search with abstract classes that a user of this library can extend in order to use it. To demonstrate it I apply it to the game of Quoridor.
☆47Updated 4 years ago
Alternatives and similar repositories for MonteCarloTreeSearch
Users that are interested in MonteCarloTreeSearch are comparing it to the libraries listed below
Sorting:
- A Monte Carlo Tree Search library for C++☆50Updated 4 years ago
- A Reinforcement Learning Library for C++11/14☆51Updated 3 years ago
- C++ version of a Deep Reinforcement Learning algorithm PPO☆36Updated 5 years ago
- Monte Carlo Tree Search - C++14 implementation☆42Updated 2 years ago
- Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.☆65Updated 3 years ago
- Parallel Monte Carlo Tree Search, see README.md for more detailed usage and information.☆50Updated 4 years ago
- Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)☆94Updated 4 months ago
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆35Updated 2 months ago
- Quick Multi-Robot Motion Planning by Combining Sampling and Search (IJCAI-23)☆25Updated 6 months ago
- Minimal Python implementation of PIBT for MAPF☆41Updated 2 weeks ago
- Continuous-Time/State/Action Fitted Value Iteration via Hamilton-Jacobi-Bellman (HJB)☆15Updated 3 years ago
- A full-stack solution for multi-robot pickup and delivery (MAPD) problem under uncertainty. The solution runs in a 3D simulation environm…☆16Updated 4 years ago
- [AAAI-2025] This repository contains MAPF-GPT, a deep learning-based model for solving MAPF problems. Trained with imitation learning on …☆86Updated 3 months ago
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆98Updated last year
- C++ lib to perform continuous and combinatorial optimization metaheuristics with parallelism support.☆30Updated 3 years ago
- Pathfinding and search testbed/visualization suite. Current code is in PDB-refactor branch.☆119Updated 2 months ago
- Python demo for the paper "Pareto Monte Carlo Tree Search for Multi-Objective Informative Planning".☆34Updated 2 years ago
- Bernstein/Beziér Optimal Trajectories (BeBOT) toolkit for generating optimal trajectories for single or multiple autonomous vehicles.☆49Updated 2 years ago
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆64Updated 2 months ago
- POGEMA stands for Partially-Observable Grid Environment for Multiple Agents. This is a grid-based environment that was specifically desig…☆44Updated 3 months ago
- A Torch Based RL Framework for Rapid Prototyping of Research Papers☆70Updated 3 months ago
- Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution (ICAPS-22; AIJ-23)☆29Updated 2 months ago
- Accelerating Quadratic Optimization with Reinforcement Learning☆93Updated 4 years ago
- A gym environment for a miniature racecar using the pybullet physics engine.☆208Updated 2 years ago
- Optimizing Dynamic Programming-Based Algorithms☆123Updated last month
- Monte Carlo Tree Search with Reinforcement Learning for Motion Planning☆80Updated 5 years ago
- QP Benchmarks for the OSQP Solver against GUROBI, MOSEK, ECOS and qpOASES☆106Updated this week
- ☆29Updated 2 months ago
- Sampling based Model Predictive Control package for Model-Based RL research☆55Updated 5 years ago
- [AAAI-2024] Follower: This study addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed Follow…☆48Updated 3 months ago