{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:57MX7MPRURMJTEI5V4MWM7YYDE","short_pith_number":"pith:57MX7MPR","schema_version":"1.0","canonical_sha256":"efd97fb1f1a45899911daf19667f181920715a02b45d43beed4ff78d7234f5dc","source":{"kind":"arxiv","id":"2404.19518","version":1},"attestation_state":"computed","paper":{"title":"MGCBS: An Optimal and Efficient Algorithm for Solving Multi-Goal Multi-Agent Path Finding Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.MA","authors_text":"Hongji Liu, Lujia Wang, Mingkai Tang, Ming Liu, Yingbing Chen, Yuanhang Li","submitted_at":"2024-04-30T12:49:54Z","abstract_excerpt":"With the expansion of the scale of robotics applications, the multi-goal multi-agent pathfinding (MG-MAPF) problem began to gain widespread attention. This problem requires each agent to visit pre-assigned multiple goal points at least once without conflict. Some previous methods have been proposed to solve the MG-MAPF problem based on Decoupling the goal Vertex visiting order search and the Single-agent pathfinding (DVS). However, this paper demonstrates that the methods based on DVS cannot always obtain the optimal solution. To obtain the optimal result, we propose the Multi-Goal Conflict-Ba"},"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":"2404.19518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-04-30T12:49:54Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"2a10c32ceb66ff8d4b1498bb2c2b1b8b8e2f9f9d6ea66274c0e126c9756d0454","abstract_canon_sha256":"5e192fe8f92c0399a3e977a63511519cdd80f0f35a853dc474039ddafe7cf8fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:13:44.594720Z","signature_b64":"X3O+Iwa+J22Lv2BZxyHRGzQHHZdtwFThpDCRDYUvr5NqJzNLkM/PiLHSuqUkhypFpauejKuxXtHMvck+Ie4OBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efd97fb1f1a45899911daf19667f181920715a02b45d43beed4ff78d7234f5dc","last_reissued_at":"2026-07-05T08:13:44.594011Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:13:44.594011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MGCBS: An Optimal and Efficient Algorithm for Solving Multi-Goal Multi-Agent Path Finding Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.MA","authors_text":"Hongji Liu, Lujia Wang, Mingkai Tang, Ming Liu, Yingbing Chen, Yuanhang Li","submitted_at":"2024-04-30T12:49:54Z","abstract_excerpt":"With the expansion of the scale of robotics applications, the multi-goal multi-agent pathfinding (MG-MAPF) problem began to gain widespread attention. This problem requires each agent to visit pre-assigned multiple goal points at least once without conflict. Some previous methods have been proposed to solve the MG-MAPF problem based on Decoupling the goal Vertex visiting order search and the Single-agent pathfinding (DVS). However, this paper demonstrates that the methods based on DVS cannot always obtain the optimal solution. To obtain the optimal result, we propose the Multi-Goal Conflict-Ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.19518","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/2404.19518/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":"2404.19518","created_at":"2026-07-05T08:13:44.594091+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.19518v1","created_at":"2026-07-05T08:13:44.594091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.19518","created_at":"2026-07-05T08:13:44.594091+00:00"},{"alias_kind":"pith_short_12","alias_value":"57MX7MPRURMJ","created_at":"2026-07-05T08:13:44.594091+00:00"},{"alias_kind":"pith_short_16","alias_value":"57MX7MPRURMJTEI5","created_at":"2026-07-05T08:13:44.594091+00:00"},{"alias_kind":"pith_short_8","alias_value":"57MX7MPR","created_at":"2026-07-05T08:13:44.594091+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/57MX7MPRURMJTEI5V4MWM7YYDE","json":"https://pith.science/pith/57MX7MPRURMJTEI5V4MWM7YYDE.json","graph_json":"https://pith.science/api/pith-number/57MX7MPRURMJTEI5V4MWM7YYDE/graph.json","events_json":"https://pith.science/api/pith-number/57MX7MPRURMJTEI5V4MWM7YYDE/events.json","paper":"https://pith.science/paper/57MX7MPR"},"agent_actions":{"view_html":"https://pith.science/pith/57MX7MPRURMJTEI5V4MWM7YYDE","download_json":"https://pith.science/pith/57MX7MPRURMJTEI5V4MWM7YYDE.json","view_paper":"https://pith.science/paper/57MX7MPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.19518&json=true","fetch_graph":"https://pith.science/api/pith-number/57MX7MPRURMJTEI5V4MWM7YYDE/graph.json","fetch_events":"https://pith.science/api/pith-number/57MX7MPRURMJTEI5V4MWM7YYDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57MX7MPRURMJTEI5V4MWM7YYDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57MX7MPRURMJTEI5V4MWM7YYDE/action/storage_attestation","attest_author":"https://pith.science/pith/57MX7MPRURMJTEI5V4MWM7YYDE/action/author_attestation","sign_citation":"https://pith.science/pith/57MX7MPRURMJTEI5V4MWM7YYDE/action/citation_signature","submit_replication":"https://pith.science/pith/57MX7MPRURMJTEI5V4MWM7YYDE/action/replication_record"}},"created_at":"2026-07-05T08:13:44.594091+00:00","updated_at":"2026-07-05T08:13:44.594091+00:00"}