{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3S6DAVMDAH3DMALTDHXRBRCWDK","short_pith_number":"pith:3S6DAVMD","schema_version":"1.0","canonical_sha256":"dcbc30558301f636017319ef10c4561aa1cfd3248e404a99d1ebdd2f55071be2","source":{"kind":"arxiv","id":"1302.2828","version":1},"attestation_state":"computed","paper":{"title":"Multi-agent RRT*: Sampling-based Cooperative Pathfinding (Extended Abstract)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Ji\\v{r}\\'i Vok\\v{r}\\'inek, Michal P\\v{e}chou\\v{c}ek, Michal \\v{C}\\'ap, Peter Nov\\'ak","submitted_at":"2013-02-12T15:47:43Z","abstract_excerpt":"Cooperative pathfinding is a problem of finding a set of non-conflicting trajectories for a number of mobile agents. Its applications include planning for teams of mobile robots, such as autonomous aircrafts, cars, or underwater vehicles. The state-of-the-art algorithms for cooperative pathfinding typically rely on some heuristic forward-search pathfinding technique, where A* is often the algorithm of choice. Here, we propose MA-RRT*, a novel algorithm for multi-agent path planning that builds upon a recently proposed asymptotically-optimal sampling-based algorithm for finding single-agent sho"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1302.2828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-02-12T15:47:43Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"ad5c70e64ffb0ea6511758f1b9f6c587a61dfa485d217b363040c4b9ae9c27de","abstract_canon_sha256":"f97c7c645e2f5c0ef24dc9c0876a47d1b546f18ebe85886f3d97ce23027e3f99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:50.704771Z","signature_b64":"mOFPnAQJxC8curU4QzRUD+1If3lFGDFcfNlFDjNZWmS0NdMWRteLkB6u3FJwszsAc6hJRgTtOO2N3KtrkE4DDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcbc30558301f636017319ef10c4561aa1cfd3248e404a99d1ebdd2f55071be2","last_reissued_at":"2026-05-18T03:33:50.704103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:50.704103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-agent RRT*: Sampling-based Cooperative Pathfinding (Extended Abstract)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Ji\\v{r}\\'i Vok\\v{r}\\'inek, Michal P\\v{e}chou\\v{c}ek, Michal \\v{C}\\'ap, Peter Nov\\'ak","submitted_at":"2013-02-12T15:47:43Z","abstract_excerpt":"Cooperative pathfinding is a problem of finding a set of non-conflicting trajectories for a number of mobile agents. Its applications include planning for teams of mobile robots, such as autonomous aircrafts, cars, or underwater vehicles. The state-of-the-art algorithms for cooperative pathfinding typically rely on some heuristic forward-search pathfinding technique, where A* is often the algorithm of choice. Here, we propose MA-RRT*, a novel algorithm for multi-agent path planning that builds upon a recently proposed asymptotically-optimal sampling-based algorithm for finding single-agent sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2828","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.2828","created_at":"2026-05-18T03:33:50.704217+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2828v1","created_at":"2026-05-18T03:33:50.704217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2828","created_at":"2026-05-18T03:33:50.704217+00:00"},{"alias_kind":"pith_short_12","alias_value":"3S6DAVMDAH3D","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3S6DAVMDAH3DMALT","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3S6DAVMD","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3S6DAVMDAH3DMALTDHXRBRCWDK","json":"https://pith.science/pith/3S6DAVMDAH3DMALTDHXRBRCWDK.json","graph_json":"https://pith.science/api/pith-number/3S6DAVMDAH3DMALTDHXRBRCWDK/graph.json","events_json":"https://pith.science/api/pith-number/3S6DAVMDAH3DMALTDHXRBRCWDK/events.json","paper":"https://pith.science/paper/3S6DAVMD"},"agent_actions":{"view_html":"https://pith.science/pith/3S6DAVMDAH3DMALTDHXRBRCWDK","download_json":"https://pith.science/pith/3S6DAVMDAH3DMALTDHXRBRCWDK.json","view_paper":"https://pith.science/paper/3S6DAVMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2828&json=true","fetch_graph":"https://pith.science/api/pith-number/3S6DAVMDAH3DMALTDHXRBRCWDK/graph.json","fetch_events":"https://pith.science/api/pith-number/3S6DAVMDAH3DMALTDHXRBRCWDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3S6DAVMDAH3DMALTDHXRBRCWDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3S6DAVMDAH3DMALTDHXRBRCWDK/action/storage_attestation","attest_author":"https://pith.science/pith/3S6DAVMDAH3DMALTDHXRBRCWDK/action/author_attestation","sign_citation":"https://pith.science/pith/3S6DAVMDAH3DMALTDHXRBRCWDK/action/citation_signature","submit_replication":"https://pith.science/pith/3S6DAVMDAH3DMALTDHXRBRCWDK/action/replication_record"}},"created_at":"2026-05-18T03:33:50.704217+00:00","updated_at":"2026-05-18T03:33:50.704217+00:00"}