Alternatives and similar repositories for MonteCarloTreeSearch

Users that are interested in MonteCarloTreeSearch are comparing it to the libraries listed below

• Konijnendijk / cpp-mcts
  A Monte Carlo Tree Search library for C++
  ☆51Updated 5 years ago
• Antymon / ppo_cpp
  C++ version of a Deep Reinforcement Learning algorithm PPO
  ☆37Updated 5 years ago
• resibots / mcts
  Monte Carlo Tree Search - C++14 implementation
  ☆42Updated 2 years ago
• Jiaoyang-Li / Flatland
  Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.
  ☆68Updated 4 years ago
• alexge233 / relearn
  A Reinforcement Learning Library for C++11/14
  ☆51Updated 3 years ago
• qpsolvers / qpbenchmark
  Benchmark for quadratic programming solvers available in Python
  ☆167Updated last month
• kevin-tracy / DifferentiableCollisions.jl
  Differentiable collision detection for polytopes, capsules, cylinders, cones, spheres, and polygons.
  ☆213Updated last year
• Jiaoyang-Li / MAPF-LNS2
  MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search
  ☆100Updated last year
• PhilippeW83440 / MCTS-NNET
  Monte Carlo Tree Search with Reinforcement Learning for Motion Planning
  ☆81Updated 5 years ago
• theOGognf / rl8
  A high throughput, end-to-end RL library for infinite-horizon tasks.
  ☆21Updated 2 months ago
• SFU-MARS / optimized_dp
  Optimizing Dynamic Programming-Based Algorithms
  ☆127Updated 3 months ago
• BerkeleyAutomation / rlqp
  Accelerating Quadratic Optimization with Reinforcement Learning
  ☆94Updated 4 years ago
• cvxgrp / cvxpygen
  Code generation with CVXPY
  ☆175Updated last month
• Kei18 / lacam3
  Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
  ☆102Updated 6 months ago
• osqp / osqp_benchmarks
  QP Benchmarks for the OSQP Solver against GUROBI, MOSEK, ECOS and qpOASES
  ☆107Updated last month
• PREDICT-EPFL / piqp
  A Proximal Interior Point Quadratic Programming solver
  ☆130Updated 3 weeks ago
• CyCTW / Parallel-MCTS
  Parallel Monte Carlo Tree Search, see README.md for more detailed usage and information.
  ☆50Updated 4 years ago
• osqp / cuosqp
  Python interface for CUDA implementation of OSQP
  ☆104Updated 4 years ago
• wanxinjin / Safe-PDP
  Safe Pontryagin Differentiable Programming (Safe PDP) is a new theoretical and algorithmic safe differentiable framework to solve a broad…
  ☆71Updated 3 years ago
• navneet-nmk / Pytorch-RL-CPP
  A Repository with C++ implementations of Reinforcement Learning Algorithms (Pytorch)
  ☆101Updated 6 years ago
• Kei18 / lacam
  LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)
  ☆65Updated 4 months ago
• Kei18 / sssp
  Quick Multi-Robot Motion Planning by Combining Sampling and Search (IJCAI-23)
  ☆25Updated 8 months ago
• Willtl / heurisko
  C++ lib to perform continuous and combinatorial optimization metaheuristics with parallelism support.
  ☆30Updated 3 years ago
• Weizhe-Chen / ParetoMCTS
  Python demo for the paper "Pareto Monte Carlo Tree Search for Multi-Objective Informative Planning".
  ☆34Updated 3 years ago
• osqp / miosqp
  MIQP solver based on OSQP
  ☆105Updated 2 years ago
• krichelj / PyDiffGame
  PyDiffGame is a Python implementation of a Nash Equilibrium solution to Differential Games, based on a reduction of Game Hamilton-Bellman…
  ☆56Updated 10 months ago
• philtabor / ProtoRL
  A Torch Based RL Framework for Rapid Prototyping of Research Papers
  ☆71Updated 5 months ago
• caslabuiowa / BeBOT
  Bernstein/Beziér Optimal Trajectories (BeBOT) toolkit for generating optimal trajectories for single or multiple autonomous vehicles.
  ☆52Updated 2 years ago
• bark-simulator / planner-mcts
  Behavior planners based on single- and multi-agent Monte Carlo Tree Search
  ☆41Updated 3 years ago
• MahanFathi / HJxB
  Continuous-Time/State/Action Fitted Value Iteration via Hamilton-Jacobi-Bellman (HJB)
  ☆16Updated 3 years ago