Multi Agent Path Planning

Implemented the M* algorithm in Python to compute collision free paths for seven robots using subdimensional expansion, and benchmarked it against Coupled A*, demonstrating significantly faster solution times and improved scalability in crowded environments.