{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4VV2ICM5OUAZTOFCDFXGDOOG2D","short_pith_number":"pith:4VV2ICM5","schema_version":"1.0","canonical_sha256":"e56ba4099d750199b8a2196e61b9c6d0db6edeb3d3fb76fca0592b8a4bc3faf7","source":{"kind":"arxiv","id":"1705.10868","version":1},"attestation_state":"computed","paper":{"title":"Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Hang Ma, Jiaoyang Li, Sven Koenig, T. K. Satish Kumar","submitted_at":"2017-05-30T21:08:16Z","abstract_excerpt":"The multi-agent path-finding (MAPF) problem has recently received a lot of attention. However, it does not capture important characteristics of many real-world domains, such as automated warehouses, where agents are constantly engaged with new tasks. In this paper, we therefore study a lifelong version of the MAPF problem, called the multi-agent pickup and delivery (MAPD) problem. In the MAPD problem, agents have to attend to a stream of delivery tasks in an online setting. One agent has to be assigned to each delivery task. This agent has to first move to a given pickup location and then to a"},"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":"1705.10868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-30T21:08:16Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"6815bd4726b244ea8fdc160e7a60367bafbf84d65d6c25360ffff68fdba72ccd","abstract_canon_sha256":"a12ac408a8f9e9764a4b46e3cd5c5188a1783cb1ce6f267e0838cbaf9050baec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:20.028255Z","signature_b64":"PmKHcrO2PfgNohW+t5SVETanwCeReARHyImCseKQZGK4WWkvnq/N/3T/83+Ck11ckwxDO96hOCJZHgF92vk+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e56ba4099d750199b8a2196e61b9c6d0db6edeb3d3fb76fca0592b8a4bc3faf7","last_reissued_at":"2026-05-18T00:43:20.027661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:20.027661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Hang Ma, Jiaoyang Li, Sven Koenig, T. K. Satish Kumar","submitted_at":"2017-05-30T21:08:16Z","abstract_excerpt":"The multi-agent path-finding (MAPF) problem has recently received a lot of attention. However, it does not capture important characteristics of many real-world domains, such as automated warehouses, where agents are constantly engaged with new tasks. In this paper, we therefore study a lifelong version of the MAPF problem, called the multi-agent pickup and delivery (MAPD) problem. In the MAPD problem, agents have to attend to a stream of delivery tasks in an online setting. One agent has to be assigned to each delivery task. This agent has to first move to a given pickup location and then to a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10868","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":"1705.10868","created_at":"2026-05-18T00:43:20.027777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10868v1","created_at":"2026-05-18T00:43:20.027777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10868","created_at":"2026-05-18T00:43:20.027777+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VV2ICM5OUAZ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VV2ICM5OUAZTOFC","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VV2ICM5","created_at":"2026-05-18T12:31:00.734936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2509.14127","citing_title":"Relay-Based Coordination for Energy-Efficient Multi-Robot Pickup and Delivery","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2510.14063","citing_title":"Adaptive Obstacle-Aware Task Assignment and Planning for Heterogeneous Robot Teaming","ref_index":52,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03842","citing_title":"SOAR: Real-Time Joint Optimization of Order Allocation and Robot Scheduling in Robotic Mobile Fulfillment Systems","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D","json":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D.json","graph_json":"https://pith.science/api/pith-number/4VV2ICM5OUAZTOFCDFXGDOOG2D/graph.json","events_json":"https://pith.science/api/pith-number/4VV2ICM5OUAZTOFCDFXGDOOG2D/events.json","paper":"https://pith.science/paper/4VV2ICM5"},"agent_actions":{"view_html":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D","download_json":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D.json","view_paper":"https://pith.science/paper/4VV2ICM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10868&json=true","fetch_graph":"https://pith.science/api/pith-number/4VV2ICM5OUAZTOFCDFXGDOOG2D/graph.json","fetch_events":"https://pith.science/api/pith-number/4VV2ICM5OUAZTOFCDFXGDOOG2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D/action/storage_attestation","attest_author":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D/action/author_attestation","sign_citation":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D/action/citation_signature","submit_replication":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D/action/replication_record"}},"created_at":"2026-05-18T00:43:20.027777+00:00","updated_at":"2026-05-18T00:43:20.027777+00:00"}