adaptive large neighborhood search for tsp

MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search

A simulation system based on ROS and Gazebo which is specially built for multi-robot task allocation (exploration and destruction problem)

《CMake实践》这本书的练习

Modular IntRalogistics Intelligent plAtforM

Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)

MOPSO及pso可编译运行matlab源码，及相关论文资源

The reproduction project of the BEV model # StreamPETR, which includes some code annotation work

Multiple Traveling Salesman Problem (mTSP) for Flight Path Planning using Mixed-Integer Linear Programming (MILP)

Dynamic decentralized task allocation algorithms for multi-agent systems using auctions and machine learning

An Efficient Multi-Agent Path Finding Solver for Car-Like Robots

Optimization-based controllers for multi-robot task allocation.

Demonstrations of our Kinodynamic Conflict-Based Search algorithm that are too involved to be included in OMPL.

Benchmark instances for Extended Colored Traveling Salesperson (ECTSP)

An efficient single/multi-agent trajectory planner for multicopters.

Formation Flight in Dense Environments

Robot-agnostic online coordination for multiple robots

Implementation of several multiagent trajectory generation algorithms

灰狼优化算法(GWO)路径规划/轨迹规划/轨迹优化、多智能体/多无人机航迹规划