{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EPFA3ZZ4PV3IWZZDUC3PDWYBI3","short_pith_number":"pith:EPFA3ZZ4","schema_version":"1.0","canonical_sha256":"23ca0de73c7d768b6723a0b6f1db0146d78b5f6886aa4980b49c0b49160e7623","source":{"kind":"arxiv","id":"2410.03072","version":2},"attestation_state":"computed","paper":{"title":"Multi-Robot Motion Planning with Diffusion Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Itamar Mishani, Jiaoyang Li, Maxim Likhachev, Shivam Vats, Yorai Shaoul","submitted_at":"2024-10-04T01:31:13Z","abstract_excerpt":"Diffusion models have recently been successfully applied to a wide range of robotics applications for learning complex multi-modal behaviors from data. However, prior works have mostly been confined to single-robot and small-scale environments due to the high sample complexity of learning multi-robot diffusion models. In this paper, we propose a method for generating collision-free multi-robot trajectories that conform to underlying data distributions while using only single-robot data. Our algorithm, Multi-robot Multi-model planning Diffusion (MMD), does so by combining learned diffusion mode"},"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":"2410.03072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-10-04T01:31:13Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"d17ff23d14fdf7e8fff6732ba5ceb13b8c61f073db4c3d5c295ab2f1b9a78586","abstract_canon_sha256":"9f5ecf6fa3f2f78c69359da478f5b2384f917745c013c80a52468e5ae251535d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:47.895342Z","signature_b64":"HPJW2dlUwtfuLuvrrmdeIleD/Odp48ORTqtPR4Dehf6KqD0p71NcW2QDXJWl3ZzsrxC7ZlHgrFEAkXjfPy07DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23ca0de73c7d768b6723a0b6f1db0146d78b5f6886aa4980b49c0b49160e7623","last_reissued_at":"2026-07-05T10:59:47.894844Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:47.894844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Robot Motion Planning with Diffusion Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Itamar Mishani, Jiaoyang Li, Maxim Likhachev, Shivam Vats, Yorai Shaoul","submitted_at":"2024-10-04T01:31:13Z","abstract_excerpt":"Diffusion models have recently been successfully applied to a wide range of robotics applications for learning complex multi-modal behaviors from data. However, prior works have mostly been confined to single-robot and small-scale environments due to the high sample complexity of learning multi-robot diffusion models. In this paper, we propose a method for generating collision-free multi-robot trajectories that conform to underlying data distributions while using only single-robot data. Our algorithm, Multi-robot Multi-model planning Diffusion (MMD), does so by combining learned diffusion mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03072","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.03072/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.03072","created_at":"2026-07-05T10:59:47.894901+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.03072v2","created_at":"2026-07-05T10:59:47.894901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03072","created_at":"2026-07-05T10:59:47.894901+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPFA3ZZ4PV3I","created_at":"2026-07-05T10:59:47.894901+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPFA3ZZ4PV3IWZZD","created_at":"2026-07-05T10:59:47.894901+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPFA3ZZ4","created_at":"2026-07-05T10:59:47.894901+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.16780","citing_title":"DIFF-IPPO: Diffusion-Based Informative Path Planning with Open-Vocabulary Belief Maps","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2510.09204","citing_title":"Flow-Opt: Scalable Centralized Multi-Robot Trajectory Optimization with Flow Matching and Differentiable Optimization","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09999","citing_title":"Muninn: Your Trajectory Diffusion Model But Faster","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EPFA3ZZ4PV3IWZZDUC3PDWYBI3","json":"https://pith.science/pith/EPFA3ZZ4PV3IWZZDUC3PDWYBI3.json","graph_json":"https://pith.science/api/pith-number/EPFA3ZZ4PV3IWZZDUC3PDWYBI3/graph.json","events_json":"https://pith.science/api/pith-number/EPFA3ZZ4PV3IWZZDUC3PDWYBI3/events.json","paper":"https://pith.science/paper/EPFA3ZZ4"},"agent_actions":{"view_html":"https://pith.science/pith/EPFA3ZZ4PV3IWZZDUC3PDWYBI3","download_json":"https://pith.science/pith/EPFA3ZZ4PV3IWZZDUC3PDWYBI3.json","view_paper":"https://pith.science/paper/EPFA3ZZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.03072&json=true","fetch_graph":"https://pith.science/api/pith-number/EPFA3ZZ4PV3IWZZDUC3PDWYBI3/graph.json","fetch_events":"https://pith.science/api/pith-number/EPFA3ZZ4PV3IWZZDUC3PDWYBI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPFA3ZZ4PV3IWZZDUC3PDWYBI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPFA3ZZ4PV3IWZZDUC3PDWYBI3/action/storage_attestation","attest_author":"https://pith.science/pith/EPFA3ZZ4PV3IWZZDUC3PDWYBI3/action/author_attestation","sign_citation":"https://pith.science/pith/EPFA3ZZ4PV3IWZZDUC3PDWYBI3/action/citation_signature","submit_replication":"https://pith.science/pith/EPFA3ZZ4PV3IWZZDUC3PDWYBI3/action/replication_record"}},"created_at":"2026-07-05T10:59:47.894901+00:00","updated_at":"2026-07-05T10:59:47.894901+00:00"}