{"adoption": {"forks": 238, "observed_at": "2026-08-28T04:03:17.864385+00:00", "stars": 1030}, "canonical_url": "https://ross.abutalabs.com/products/libmultirobotplanning", "card": {"archived": false, "artifact_type": "library", "description": "Library with search algorithms for task and path planning for multi robot/agent systems", "domain": ["robotics", "simulation"], "enriched": true, "function": ["simulation", "math", "robotics"], "health_score": 20, "homepage": null, "language": "C++", "license": "MIT", "license_family": "permissive", "maturity": "stable", "member_repos": ["whoenig/libMultiRobotPlanning"], "name": "whoenig/libMultiRobotPlanning", "platform": ["cpp", "cross-platform"], "pushed_at": "2023-08-10T05:42:02+00:00", "repo": "whoenig/libMultiRobotPlanning", "stars": 1030, "tags": ["multi-robot-planning", "path-planning", "task-assignment", "mapf", "conflict-based-search", "a-star", "sipp", "c++14", "templated-library", "algorithms", "linux"], "topics": [], "urls": [], "use_cases": ["plan collision-free paths for multiple robots or agents", "compute optimal task assignments across a fleet of agents", "run conflict-based search (CBS/ECBS) for multi-agent pathfinding", "plan paths with safe intervals using SIPP", "solve minimum sum-of-cost assignment problems", "prototype and benchmark multi-robot planning algorithms in C++"], "what_it_is": "A C++14 header-style library providing highly templated search algorithms for multi-robot/agent task and path planning. It implements single-agent planners (A*, focal search, SIPP), multi-agent planners (CBS, ECBS, CBS-TA, ECBS-TA), and assignment algorithms, with examples and benchmarks.", "when_to_avoid": ["you need a ready-to-run robotics middleware or full motion planner rather than search algorithms", "your project is not in C++ or cannot interoperate with C++14 code", "you need dynamic replanning under real-world sensor uncertainty out of the box", "you want a maintained GUI or visualization tool (only simple Python visualizers are provided)"], "when_to_choose": ["you need proven MAPF algorithms like CBS, ECBS, or CBS-TA in C++", "you want high-performance, templated planning code you can embed in a robot stack", "you need both path planning and task assignment in one library", "you want example code and benchmarks to compare planning algorithms"]}, "data_as_of": "2026-08-30T08:39:29.467469+00:00", "members": [{"path": "/products/libmultirobotplanning", "repo": "whoenig/libMultiRobotPlanning", "role": "main", "score": 32}], "provenance": {"archived": {"kind": "observed", "observed_at": "2026-08-28T04:03:17.864385+00:00", "source": "github"}, "artifact_type": {"confidence": null, "enriched_at": "2026-08-30T07:07:36.359774+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "967ed372cfc4212a82c4e2397ca81ea9e540b181c418de569475148e63bcabfa", "fetched_at": "2026-08-28T04:03:17.864385+00:00", "kind": "readme", "missing": false, "url": "https://github.com/whoenig/libMultiRobotPlanning"}], "taxonomy_version": 1}, "description": {"kind": "observed", "observed_at": "2026-08-28T04:03:17.864385+00:00", "source": "github"}, "domain": {"confidence": null, "enriched_at": "2026-08-30T07:07:36.359774+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "967ed372cfc4212a82c4e2397ca81ea9e540b181c418de569475148e63bcabfa", "fetched_at": "2026-08-28T04:03:17.864385+00:00", "kind": "readme", "missing": false, "url": "https://github.com/whoenig/libMultiRobotPlanning"}], "taxonomy_version": 1}, "enriched": {"inputs": [], "kind": "computed", "method": "enrichment_status"}, "function": {"confidence": null, "enriched_at": "2026-08-30T07:07:36.359774+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "967ed372cfc4212a82c4e2397ca81ea9e540b181c418de569475148e63bcabfa", "fetched_at": "2026-08-28T04:03:17.864385+00:00", "kind": "readme", "missing": false, "url": "https://github.com/whoenig/libMultiRobotPlanning"}], "taxonomy_version": 1}, "health_score": {"inputs": ["days_since_push", "days_since_release", "archived"], "kind": "computed", "method": "health_v1"}, "homepage": {"kind": "observed", "observed_at": "2026-08-28T04:03:17.864385+00:00", "source": "github"}, "language": {"kind": "observed", "observed_at": "2026-08-28T04:03:17.864385+00:00", "source": "github"}, "license": {"kind": "observed", "observed_at": "2026-08-28T04:03:17.864385+00:00", "source": "github"}, "license_family": {"inputs": ["license"], "kind": "computed", "method": "license_family"}, "maturity": {"confidence": null, "enriched_at": "2026-08-30T07:07:36.359774+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "967ed372cfc4212a82c4e2397ca81ea9e540b181c418de569475148e63bcabfa", "fetched_at": "2026-08-28T04:03:17.864385+00:00", "kind": "readme", "missing": false, "url": "https://github.com/whoenig/libMultiRobotPlanning"}], "taxonomy_version": 1}, "member_repos": {"kind": "observed", "observed_at": "2026-08-28T04:03:17.864385+00:00", "source": "github"}, "name": {"kind": "observed", "observed_at": "2026-08-28T04:03:17.864385+00:00", "source": "github"}, "platform": {"confidence": null, "enriched_at": "2026-08-30T07:07:36.359774+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "967ed372cfc4212a82c4e2397ca81ea9e540b181c418de569475148e63bcabfa", "fetched_at": "2026-08-28T04:03:17.864385+00:00", "kind": "readme", "missing": false, "url": "https://github.com/whoenig/libMultiRobotPlanning"}], "taxonomy_version": 1}, "pushed_at": {"kind": "observed", "observed_at": "2026-08-28T04:03:17.864385+00:00", "source": "github"}, "repo": {"kind": "observed", "observed_at": "2026-08-28T04:03:17.864385+00:00", "source": "github"}, "stars": {"kind": "observed", "observed_at": "2026-08-28T04:03:17.864385+00:00", "source": "github"}, "tags": {"confidence": null, "enriched_at": "2026-08-30T07:07:36.359774+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "967ed372cfc4212a82c4e2397ca81ea9e540b181c418de569475148e63bcabfa", "fetched_at": "2026-08-28T04:03:17.864385+00:00", "kind": "readme", "missing": false, "url": "https://github.com/whoenig/libMultiRobotPlanning"}], "taxonomy_version": 1}, "topics": {"kind": "observed", "observed_at": "2026-08-28T04:03:17.864385+00:00", "source": "github"}, "urls": {"kind": "observed", "observed_at": "2026-08-28T04:03:17.864385+00:00", "source": "github"}, "use_cases": {"confidence": null, "enriched_at": "2026-08-30T07:07:36.359774+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "967ed372cfc4212a82c4e2397ca81ea9e540b181c418de569475148e63bcabfa", "fetched_at": "2026-08-28T04:03:17.864385+00:00", "kind": "readme", "missing": false, "url": "https://github.com/whoenig/libMultiRobotPlanning"}], "taxonomy_version": 1}, "what_it_is": {"confidence": null, "enriched_at": "2026-08-30T07:07:36.359774+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "967ed372cfc4212a82c4e2397ca81ea9e540b181c418de569475148e63bcabfa", "fetched_at": "2026-08-28T04:03:17.864385+00:00", "kind": "readme", "missing": false, "url": "https://github.com/whoenig/libMultiRobotPlanning"}], "taxonomy_version": 1}, "when_to_avoid": {"confidence": null, "enriched_at": "2026-08-30T07:07:36.359774+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "967ed372cfc4212a82c4e2397ca81ea9e540b181c418de569475148e63bcabfa", "fetched_at": "2026-08-28T04:03:17.864385+00:00", "kind": "readme", "missing": false, "url": "https://github.com/whoenig/libMultiRobotPlanning"}], "taxonomy_version": 1}, "when_to_choose": {"confidence": null, "enriched_at": "2026-08-30T07:07:36.359774+00:00", "kind": "inferred", "prompt_version": 1, "sources": [{"content_hash": "967ed372cfc4212a82c4e2397ca81ea9e540b181c418de569475148e63bcabfa", "fetched_at": "2026-08-28T04:03:17.864385+00:00", "kind": "readme", "missing": false, "url": "https://github.com/whoenig/libMultiRobotPlanning"}], "taxonomy_version": 1}}, "score": {"components": {"activity": 0, "longevity": 100, "rhythm": 35}, "computed_at": "2026-09-03T02:20:16.233290+00:00", "flags": ["no_releases"], "formula": "round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10)", "inputs": {"age_days": 3222, "days_push": 1119, "days_rel": null, "gap_med": null, "n_releases_24m": 0}, "score": 32, "version": 2}, "staleness": {"enrichment_outdated": false, "low_confidence": false, "scrape_days": 9, "stale_scrape": false}}