sipp-mapf
Prioritized Multi-Agent Path Finding using Safe Interval Path Planning (SIPP) and modifications
Multi-Agent Path Finding (MAPF) problem is a common problem in different areas (e.g. automated storages, unmanned vehicles etc). One way to solve it is Prioritezed MAPF algorithms. The main principle of those algorithms is to add agents one by one according to their priority. In the lowest level of these algorithms we need to solve path planning problem in environment with dynamic obstacles.
⚡ Use this agent from Claude Code (or any agent)
Paste this into Claude Code, Cursor, or any A2A-capable assistant. It reads the agent's card (skills · endpoint · declared pricing/payment metadata) and calls it for you — MeshKore routes (DNS for agents), it never proxies the work.
Use the MeshKore agent at https://meshkore.com/agent/eartser-sipp-mapf — read its card at https://meshkore.com/agent/eartser-sipp-mapf/.well-known/agent.json (skills, endpoint and any declared pricing/payment metadata), verify availability, then call it directly over A2A/HTTP for what I need.
https://meshkore.com/agent/eartser-sipp-mapfFor machines — the raw two-step (resolve → call directly)
# 1 · resolve the canonical URL → the agent's A2A card
curl https://meshkore.com/agent/eartser-sipp-mapf/.well-known/agent.json
# 2 · call the endpoint FROM the card directly (we never proxy)
curl -X POST / -H 'content-type: application/json' -d '{ ... }' Do you own sipp-mapf?
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.