{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:I2PBNRSKS3X7NMWWGASNRHVQES","short_pith_number":"pith:I2PBNRSK","schema_version":"1.0","canonical_sha256":"469e16c64a96eff6b2d63024d89eb02494e181c5e17025fe5bb9cf60e0f7c5e0","source":{"kind":"arxiv","id":"2203.00315","version":3},"attestation_state":"computed","paper":{"title":"Quick Multi-Robot Motion Planning by Combining Sampling and Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Keisuke Okumura, Xavier D\\'efago","submitted_at":"2022-03-01T09:43:20Z","abstract_excerpt":"We propose a novel algorithm to solve multi-robot motion planning (MRMP) rapidly, called Simultaneous Sampling-and-Search Planning (SSSP). Conventional MRMP studies mostly take the form of two-phase planning that constructs roadmaps and then finds inter-robot collision-free paths on those roadmaps. In contrast, SSSP simultaneously performs roadmap construction and collision-free pathfinding. This is realized by uniting techniques of single-robot sampling-based motion planning and search techniques of multi-agent pathfinding on discretized spaces. Doing so builds the small search space, leading"},"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":"2203.00315","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-03-01T09:43:20Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"b6500524909ceb0b66858e872299b0d010ba8325cf5d2136ceeae7e6ae21d2d9","abstract_canon_sha256":"b2947182c5e6887ffafb2efc911c746e45d7fc22a507ce8ffb8d1410d0d22d92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:07:19.845575Z","signature_b64":"MjXOf9YudbyiAPGcl6wnb5wEnSituQjBgz8aDhJ51z6mi462GYenXFTusg+GJ0W4TItKlMYzP6vkJkpeyCZqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"469e16c64a96eff6b2d63024d89eb02494e181c5e17025fe5bb9cf60e0f7c5e0","last_reissued_at":"2026-07-05T06:07:19.845127Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:07:19.845127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quick Multi-Robot Motion Planning by Combining Sampling and Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Keisuke Okumura, Xavier D\\'efago","submitted_at":"2022-03-01T09:43:20Z","abstract_excerpt":"We propose a novel algorithm to solve multi-robot motion planning (MRMP) rapidly, called Simultaneous Sampling-and-Search Planning (SSSP). Conventional MRMP studies mostly take the form of two-phase planning that constructs roadmaps and then finds inter-robot collision-free paths on those roadmaps. In contrast, SSSP simultaneously performs roadmap construction and collision-free pathfinding. This is realized by uniting techniques of single-robot sampling-based motion planning and search techniques of multi-agent pathfinding on discretized spaces. Doing so builds the small search space, leading"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00315","kind":"arxiv","version":3},"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/2203.00315/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":"2203.00315","created_at":"2026-07-05T06:07:19.845184+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.00315v3","created_at":"2026-07-05T06:07:19.845184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00315","created_at":"2026-07-05T06:07:19.845184+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2PBNRSKS3X7","created_at":"2026-07-05T06:07:19.845184+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2PBNRSKS3X7NMWW","created_at":"2026-07-05T06:07:19.845184+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2PBNRSK","created_at":"2026-07-05T06:07:19.845184+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.03509","citing_title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I2PBNRSKS3X7NMWWGASNRHVQES","json":"https://pith.science/pith/I2PBNRSKS3X7NMWWGASNRHVQES.json","graph_json":"https://pith.science/api/pith-number/I2PBNRSKS3X7NMWWGASNRHVQES/graph.json","events_json":"https://pith.science/api/pith-number/I2PBNRSKS3X7NMWWGASNRHVQES/events.json","paper":"https://pith.science/paper/I2PBNRSK"},"agent_actions":{"view_html":"https://pith.science/pith/I2PBNRSKS3X7NMWWGASNRHVQES","download_json":"https://pith.science/pith/I2PBNRSKS3X7NMWWGASNRHVQES.json","view_paper":"https://pith.science/paper/I2PBNRSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.00315&json=true","fetch_graph":"https://pith.science/api/pith-number/I2PBNRSKS3X7NMWWGASNRHVQES/graph.json","fetch_events":"https://pith.science/api/pith-number/I2PBNRSKS3X7NMWWGASNRHVQES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2PBNRSKS3X7NMWWGASNRHVQES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2PBNRSKS3X7NMWWGASNRHVQES/action/storage_attestation","attest_author":"https://pith.science/pith/I2PBNRSKS3X7NMWWGASNRHVQES/action/author_attestation","sign_citation":"https://pith.science/pith/I2PBNRSKS3X7NMWWGASNRHVQES/action/citation_signature","submit_replication":"https://pith.science/pith/I2PBNRSKS3X7NMWWGASNRHVQES/action/replication_record"}},"created_at":"2026-07-05T06:07:19.845184+00:00","updated_at":"2026-07-05T06:07:19.845184+00:00"}