{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:O7XWHDLGU34HRSZQSPCKRJIWYQ","short_pith_number":"pith:O7XWHDLG","schema_version":"1.0","canonical_sha256":"77ef638d66a6f878cb3093c4a8a516c4360fd6097da248b1c046d2d234cba19b","source":{"kind":"arxiv","id":"1707.00228","version":1},"attestation_state":"computed","paper":{"title":"Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ariel Felner, Eli Boyarski, Pavel Surynek, Roni Stern","submitted_at":"2017-07-02T03:08:26Z","abstract_excerpt":"In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. In this paper we focus on finding suboptimal solutions for MAPF for the sum-of-costs variant. Recently, a SAT-based approached was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we present SAT-based unbounded- and bounded-suboptimal algorithms and compare them to relevant algorithms. Experimental results show that in many case the SAT-based solver significantly outperforms the search-based solvers."},"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":"1707.00228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-02T03:08:26Z","cross_cats_sorted":[],"title_canon_sha256":"17c42eeb43af9947235d52b493ef2bc1ddd7be19dd36bd3f0766abded30d5bc3","abstract_canon_sha256":"66e812675c661aa7b7373de8556a2ba534ae5a2abf888582ca5e27ad376d96f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:04.048465Z","signature_b64":"PXaGqsFhoUQCa07onpGCT+G+34mQrboPQ0Mg0mOnwHQr0DcYB5cOR2we0O9p6hgWynSWrTisBHmowzlTtCQLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77ef638d66a6f878cb3093c4a8a516c4360fd6097da248b1c046d2d234cba19b","last_reissued_at":"2026-05-18T00:41:04.047725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:04.047725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ariel Felner, Eli Boyarski, Pavel Surynek, Roni Stern","submitted_at":"2017-07-02T03:08:26Z","abstract_excerpt":"In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. In this paper we focus on finding suboptimal solutions for MAPF for the sum-of-costs variant. Recently, a SAT-based approached was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we present SAT-based unbounded- and bounded-suboptimal algorithms and compare them to relevant algorithms. Experimental results show that in many case the SAT-based solver significantly outperforms the search-based solvers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00228","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":""},"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":"1707.00228","created_at":"2026-05-18T00:41:04.047871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00228v1","created_at":"2026-05-18T00:41:04.047871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00228","created_at":"2026-05-18T00:41:04.047871+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7XWHDLGU34H","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7XWHDLGU34HRSZQ","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7XWHDLG","created_at":"2026-05-18T12:31:34.259226+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/O7XWHDLGU34HRSZQSPCKRJIWYQ","json":"https://pith.science/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ.json","graph_json":"https://pith.science/api/pith-number/O7XWHDLGU34HRSZQSPCKRJIWYQ/graph.json","events_json":"https://pith.science/api/pith-number/O7XWHDLGU34HRSZQSPCKRJIWYQ/events.json","paper":"https://pith.science/paper/O7XWHDLG"},"agent_actions":{"view_html":"https://pith.science/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ","download_json":"https://pith.science/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ.json","view_paper":"https://pith.science/paper/O7XWHDLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00228&json=true","fetch_graph":"https://pith.science/api/pith-number/O7XWHDLGU34HRSZQSPCKRJIWYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/O7XWHDLGU34HRSZQSPCKRJIWYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ/action/storage_attestation","attest_author":"https://pith.science/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ/action/author_attestation","sign_citation":"https://pith.science/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ/action/citation_signature","submit_replication":"https://pith.science/pith/O7XWHDLGU34HRSZQSPCKRJIWYQ/action/replication_record"}},"created_at":"2026-05-18T00:41:04.047871+00:00","updated_at":"2026-05-18T00:41:04.047871+00:00"}