{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:X2LC7GQE3FBBDUPCTVQS5DISNS","short_pith_number":"pith:X2LC7GQE","schema_version":"1.0","canonical_sha256":"be962f9a04d94211d1e29d612e8d126c8589449eb799669a51c004d3ea6a4959","source":{"kind":"arxiv","id":"2408.13750","version":3},"attestation_state":"computed","paper":{"title":"Multi-Agent Target Assignment and Path Finding for Intelligent Warehouse: A Cooperative Multi-Agent Deep Reinforcement Learning Perspective","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Dongjie Zhu, Jianqi Gao, Jingxiang Guo, Pengbin Chen, Qi Liu, Yanjie Li, Zhongjian Qiao","submitted_at":"2024-08-25T07:32:58Z","abstract_excerpt":"Multi-agent target assignment and path planning (TAPF) are two key problems in intelligent warehouse. However, most literature only addresses one of these two problems separately. In this study, we propose a method to simultaneously solve target assignment and path planning from a perspective of cooperative multi-agent deep reinforcement learning (RL). To the best of our knowledge, this is the first work to model the TAPF problem for intelligent warehouse to cooperative multi-agent deep RL, and the first to simultaneously address TAPF based on multi-agent deep RL. Furthermore, previous literat"},"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":"2408.13750","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-25T07:32:58Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"4bc8d6bcf8bd7cbe497693083fa1cf0b8464758b9ef090a516ce898f56f87d52","abstract_canon_sha256":"ddf8e4be494e5f6a10cd51bf77fa2a76a07a81b08eddaedcf9ab7d138cd20fee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:26:30.146661Z","signature_b64":"wY5gKlpUQlX6crnCr70Ij9ebB5hPf+jZsBT548FxphUyCavevqoRH2ob2YrmBmvmFp6TjG0NfUSqb/Y2q+nJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be962f9a04d94211d1e29d612e8d126c8589449eb799669a51c004d3ea6a4959","last_reissued_at":"2026-07-05T09:26:30.146159Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:26:30.146159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Target Assignment and Path Finding for Intelligent Warehouse: A Cooperative Multi-Agent Deep Reinforcement Learning Perspective","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Dongjie Zhu, Jianqi Gao, Jingxiang Guo, Pengbin Chen, Qi Liu, Yanjie Li, Zhongjian Qiao","submitted_at":"2024-08-25T07:32:58Z","abstract_excerpt":"Multi-agent target assignment and path planning (TAPF) are two key problems in intelligent warehouse. However, most literature only addresses one of these two problems separately. In this study, we propose a method to simultaneously solve target assignment and path planning from a perspective of cooperative multi-agent deep reinforcement learning (RL). To the best of our knowledge, this is the first work to model the TAPF problem for intelligent warehouse to cooperative multi-agent deep RL, and the first to simultaneously address TAPF based on multi-agent deep RL. Furthermore, previous literat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.13750","kind":"arxiv","version":3},"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/2408.13750/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":"2408.13750","created_at":"2026-07-05T09:26:30.146220+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.13750v3","created_at":"2026-07-05T09:26:30.146220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.13750","created_at":"2026-07-05T09:26:30.146220+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2LC7GQE3FBB","created_at":"2026-07-05T09:26:30.146220+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2LC7GQE3FBBDUPC","created_at":"2026-07-05T09:26:30.146220+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2LC7GQE","created_at":"2026-07-05T09:26:30.146220+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/X2LC7GQE3FBBDUPCTVQS5DISNS","json":"https://pith.science/pith/X2LC7GQE3FBBDUPCTVQS5DISNS.json","graph_json":"https://pith.science/api/pith-number/X2LC7GQE3FBBDUPCTVQS5DISNS/graph.json","events_json":"https://pith.science/api/pith-number/X2LC7GQE3FBBDUPCTVQS5DISNS/events.json","paper":"https://pith.science/paper/X2LC7GQE"},"agent_actions":{"view_html":"https://pith.science/pith/X2LC7GQE3FBBDUPCTVQS5DISNS","download_json":"https://pith.science/pith/X2LC7GQE3FBBDUPCTVQS5DISNS.json","view_paper":"https://pith.science/paper/X2LC7GQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.13750&json=true","fetch_graph":"https://pith.science/api/pith-number/X2LC7GQE3FBBDUPCTVQS5DISNS/graph.json","fetch_events":"https://pith.science/api/pith-number/X2LC7GQE3FBBDUPCTVQS5DISNS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2LC7GQE3FBBDUPCTVQS5DISNS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2LC7GQE3FBBDUPCTVQS5DISNS/action/storage_attestation","attest_author":"https://pith.science/pith/X2LC7GQE3FBBDUPCTVQS5DISNS/action/author_attestation","sign_citation":"https://pith.science/pith/X2LC7GQE3FBBDUPCTVQS5DISNS/action/citation_signature","submit_replication":"https://pith.science/pith/X2LC7GQE3FBBDUPCTVQS5DISNS/action/replication_record"}},"created_at":"2026-07-05T09:26:30.146220+00:00","updated_at":"2026-07-05T09:26:30.146220+00:00"}