{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IUVABU5N36HNZDYAFNHT4NYUJP","short_pith_number":"pith:IUVABU5N","schema_version":"1.0","canonical_sha256":"452a00d3addf8edc8f002b4f3e37144bddae561e32d45e3c66663350b06c8cee","source":{"kind":"arxiv","id":"2302.14289","version":1},"attestation_state":"computed","paper":{"title":"DrMaMP: Distributed Real-time Multi-agent Mission Planning in Cluttered Environment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Shaoshuai Mou, Tianyu Zhou, Zehui Lu","submitted_at":"2023-02-28T03:49:35Z","abstract_excerpt":"Solving a collision-aware multi-agent mission planning (task allocation and path finding) problem is challenging due to the requirement of real-time computational performance, scalability, and capability of handling static/dynamic obstacles and tasks in a cluttered environment. This paper proposes a distributed real-time (on the order of millisecond) algorithm DrMaMP, which partitions the entire unassigned task set into subsets via approximation and decomposes the original problem into several single-agent mission planning problems. This paper presents experiments with dynamic obstacles and ta"},"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":"2302.14289","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-02-28T03:49:35Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"bec367a7f29fc6f4fcc619fbaf0a60d017234fb08165476b6b4ca80d96a8e9f4","abstract_canon_sha256":"fbcc69d251c5426e83c367b3906ab09dffa3e6b0b042151a633413cf807dcc6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:46:42.990124Z","signature_b64":"Z9L3pPF4JeIU/MJ89AfjiI7RPVei7qdFj+/lCwLGfXCxmVDkmR66WlUPop9OGqgkn3ZUVoS9i8eAdZPcaCENDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"452a00d3addf8edc8f002b4f3e37144bddae561e32d45e3c66663350b06c8cee","last_reissued_at":"2026-07-05T05:46:42.989708Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:46:42.989708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DrMaMP: Distributed Real-time Multi-agent Mission Planning in Cluttered Environment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Shaoshuai Mou, Tianyu Zhou, Zehui Lu","submitted_at":"2023-02-28T03:49:35Z","abstract_excerpt":"Solving a collision-aware multi-agent mission planning (task allocation and path finding) problem is challenging due to the requirement of real-time computational performance, scalability, and capability of handling static/dynamic obstacles and tasks in a cluttered environment. This paper proposes a distributed real-time (on the order of millisecond) algorithm DrMaMP, which partitions the entire unassigned task set into subsets via approximation and decomposes the original problem into several single-agent mission planning problems. This paper presents experiments with dynamic obstacles and ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.14289","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.14289/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":"2302.14289","created_at":"2026-07-05T05:46:42.989765+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.14289v1","created_at":"2026-07-05T05:46:42.989765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.14289","created_at":"2026-07-05T05:46:42.989765+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUVABU5N36HN","created_at":"2026-07-05T05:46:42.989765+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUVABU5N36HNZDYA","created_at":"2026-07-05T05:46:42.989765+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUVABU5N","created_at":"2026-07-05T05:46:42.989765+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/IUVABU5N36HNZDYAFNHT4NYUJP","json":"https://pith.science/pith/IUVABU5N36HNZDYAFNHT4NYUJP.json","graph_json":"https://pith.science/api/pith-number/IUVABU5N36HNZDYAFNHT4NYUJP/graph.json","events_json":"https://pith.science/api/pith-number/IUVABU5N36HNZDYAFNHT4NYUJP/events.json","paper":"https://pith.science/paper/IUVABU5N"},"agent_actions":{"view_html":"https://pith.science/pith/IUVABU5N36HNZDYAFNHT4NYUJP","download_json":"https://pith.science/pith/IUVABU5N36HNZDYAFNHT4NYUJP.json","view_paper":"https://pith.science/paper/IUVABU5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.14289&json=true","fetch_graph":"https://pith.science/api/pith-number/IUVABU5N36HNZDYAFNHT4NYUJP/graph.json","fetch_events":"https://pith.science/api/pith-number/IUVABU5N36HNZDYAFNHT4NYUJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUVABU5N36HNZDYAFNHT4NYUJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUVABU5N36HNZDYAFNHT4NYUJP/action/storage_attestation","attest_author":"https://pith.science/pith/IUVABU5N36HNZDYAFNHT4NYUJP/action/author_attestation","sign_citation":"https://pith.science/pith/IUVABU5N36HNZDYAFNHT4NYUJP/action/citation_signature","submit_replication":"https://pith.science/pith/IUVABU5N36HNZDYAFNHT4NYUJP/action/replication_record"}},"created_at":"2026-07-05T05:46:42.989765+00:00","updated_at":"2026-07-05T05:46:42.989765+00:00"}