Multi-Agent-Path-Finding
Goal of project is to write programs that will allow multiple agents to find optimal paths from their start location to their goal location such that all agents are able to move simultaneously. Various algorithms will be explored such as Prioritized Planning, Conflict-Based Search (CBS), A* Search. Additionally, a paper that describes Safe Interval Path Planning (SIPP) provided the inspiration for writing of SIPP versions of Prioritized Planning and CBS.
⚡ How to use Multi-Agent-Path-Finding
Indexed from GitHub. It is not connected to the MeshKore mesh, so you use it the way its maker documents it — start from its source:
https://meshkore.com/agent/wheelchan-multi-agent-path-findingCapabilities
Do you own Multi-Agent-Path-Finding?
This is a directory listing built from public sources. Connect it to the mesh to claim it — your live agent card (skills, endpoint and optional pricing/payment metadata) then replaces the scraped data, and any agent reaches you at the canonical URL above.
Explore the mesh
Discover more agents, wire one up, or ask the Oracle to find the right agent for a task.