{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7S2BEX6RQ5AAKUQIUWVZEP3E7G","short_pith_number":"pith:7S2BEX6R","schema_version":"1.0","canonical_sha256":"fcb4125fd18740055208a5ab923f64f99af2fe8daa2ba4d9925f4a3f61593e15","source":{"kind":"arxiv","id":"2305.03632","version":1},"attestation_state":"computed","paper":{"title":"Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Keisuke Okumura","submitted_at":"2023-05-05T15:43:20Z","abstract_excerpt":"This study extends the recently-developed LaCAM algorithm for multi-agent pathfinding (MAPF). LaCAM is a sub-optimal search-based algorithm that uses lazy successor generation to dramatically reduce the planning effort. We present two enhancements. First, we propose its anytime version, called LaCAM*, which eventually converges to optima, provided that solution costs are accumulated transition costs. Second, we improve the successor generation to quickly obtain initial solutions. Exhaustive experiments demonstrate their utility. For instance, LaCAM* sub-optimally solved 99% of the instances re"},"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":"2305.03632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-05-05T15:43:20Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"ba8c6a7c51e68e4ef16d8ef5938c64f7d9d51f0b2bac4bf4753453fafe6680b4","abstract_canon_sha256":"ea52b4c1ef25bd30f9c25fc251c1fdc84670181467be4d56b7d90f18e4b84afe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:07:25.562892Z","signature_b64":"K95R27Yf3mGGg6b4KuO0lZNcYxTXRh6RteRN1Zl7Zfw4svHMYfnR0grZfc974/IQ5fVlJp3fvNFkBXNhVagHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcb4125fd18740055208a5ab923f64f99af2fe8daa2ba4d9925f4a3f61593e15","last_reissued_at":"2026-07-05T06:07:25.562404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:07:25.562404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Keisuke Okumura","submitted_at":"2023-05-05T15:43:20Z","abstract_excerpt":"This study extends the recently-developed LaCAM algorithm for multi-agent pathfinding (MAPF). LaCAM is a sub-optimal search-based algorithm that uses lazy successor generation to dramatically reduce the planning effort. We present two enhancements. First, we propose its anytime version, called LaCAM*, which eventually converges to optima, provided that solution costs are accumulated transition costs. Second, we improve the successor generation to quickly obtain initial solutions. Exhaustive experiments demonstrate their utility. For instance, LaCAM* sub-optimally solved 99% of the instances re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.03632","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/2305.03632/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":"2305.03632","created_at":"2026-07-05T06:07:25.562466+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.03632v1","created_at":"2026-07-05T06:07:25.562466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.03632","created_at":"2026-07-05T06:07:25.562466+00:00"},{"alias_kind":"pith_short_12","alias_value":"7S2BEX6RQ5AA","created_at":"2026-07-05T06:07:25.562466+00:00"},{"alias_kind":"pith_short_16","alias_value":"7S2BEX6RQ5AAKUQI","created_at":"2026-07-05T06:07:25.562466+00:00"},{"alias_kind":"pith_short_8","alias_value":"7S2BEX6R","created_at":"2026-07-05T06:07:25.562466+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.19219","citing_title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G","json":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G.json","graph_json":"https://pith.science/api/pith-number/7S2BEX6RQ5AAKUQIUWVZEP3E7G/graph.json","events_json":"https://pith.science/api/pith-number/7S2BEX6RQ5AAKUQIUWVZEP3E7G/events.json","paper":"https://pith.science/paper/7S2BEX6R"},"agent_actions":{"view_html":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G","download_json":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G.json","view_paper":"https://pith.science/paper/7S2BEX6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.03632&json=true","fetch_graph":"https://pith.science/api/pith-number/7S2BEX6RQ5AAKUQIUWVZEP3E7G/graph.json","fetch_events":"https://pith.science/api/pith-number/7S2BEX6RQ5AAKUQIUWVZEP3E7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G/action/storage_attestation","attest_author":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G/action/author_attestation","sign_citation":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G/action/citation_signature","submit_replication":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G/action/replication_record"}},"created_at":"2026-07-05T06:07:25.562466+00:00","updated_at":"2026-07-05T06:07:25.562466+00:00"}