{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:J4OOFRBOF325K3GFWVDODGDXON","short_pith_number":"pith:J4OOFRBO","schema_version":"1.0","canonical_sha256":"4f1ce2c42e2ef5d56cc5b546e19877734d2ae5ae597783ddd3d1f6e530608dc6","source":{"kind":"arxiv","id":"2404.11817","version":3},"attestation_state":"computed","paper":{"title":"Reinforcement Learning of Multi-robot Task Allocation for Multi-object Transportation with Infeasible Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Tadashi Odashima, Takamitsu Matsubara, Tomohiko Jimbo, Yuma Shida","submitted_at":"2024-04-18T00:33:07Z","abstract_excerpt":"Multi-object transport using multi-robot systems has the potential for diverse practical applications such as delivery services owing to its efficient individual and scalable cooperative transport. However, allocating transportation tasks of objects with unknown weights remains challenging. Moreover, the presence of infeasible tasks (untransportable objects) can lead to robot stoppage (deadlock). This paper proposes a framework for dynamic task allocation that involves storing task experiences for each task in a scalable manner with respect to the number of robots. First, these experiences are"},"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.11817","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-04-18T00:33:07Z","cross_cats_sorted":[],"title_canon_sha256":"62037e21419d64c42a2eb0a8880e003711a71c1bfb33f984f4f273c29b13d520","abstract_canon_sha256":"fca375f8a90e021ef05fe724f070a8cb8990c123cad771dfd77222837f8a86a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:16:33.368545Z","signature_b64":"WY4+6XgyOB/RH20xlcAv96aZ7YoQpIs93tCAKXJfRCfQoMkVmsKeS0g+H9ihhy7+kZrcqzq9QA7euIxATL3xBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f1ce2c42e2ef5d56cc5b546e19877734d2ae5ae597783ddd3d1f6e530608dc6","last_reissued_at":"2026-07-05T10:16:33.367963Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:16:33.367963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement Learning of Multi-robot Task Allocation for Multi-object Transportation with Infeasible Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Tadashi Odashima, Takamitsu Matsubara, Tomohiko Jimbo, Yuma Shida","submitted_at":"2024-04-18T00:33:07Z","abstract_excerpt":"Multi-object transport using multi-robot systems has the potential for diverse practical applications such as delivery services owing to its efficient individual and scalable cooperative transport. However, allocating transportation tasks of objects with unknown weights remains challenging. Moreover, the presence of infeasible tasks (untransportable objects) can lead to robot stoppage (deadlock). This paper proposes a framework for dynamic task allocation that involves storing task experiences for each task in a scalable manner with respect to the number of robots. First, these experiences are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.11817","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/2404.11817/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.11817","created_at":"2026-07-05T10:16:33.368022+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.11817v3","created_at":"2026-07-05T10:16:33.368022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.11817","created_at":"2026-07-05T10:16:33.368022+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4OOFRBOF325","created_at":"2026-07-05T10:16:33.368022+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4OOFRBOF325K3GF","created_at":"2026-07-05T10:16:33.368022+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4OOFRBO","created_at":"2026-07-05T10:16:33.368022+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/J4OOFRBOF325K3GFWVDODGDXON","json":"https://pith.science/pith/J4OOFRBOF325K3GFWVDODGDXON.json","graph_json":"https://pith.science/api/pith-number/J4OOFRBOF325K3GFWVDODGDXON/graph.json","events_json":"https://pith.science/api/pith-number/J4OOFRBOF325K3GFWVDODGDXON/events.json","paper":"https://pith.science/paper/J4OOFRBO"},"agent_actions":{"view_html":"https://pith.science/pith/J4OOFRBOF325K3GFWVDODGDXON","download_json":"https://pith.science/pith/J4OOFRBOF325K3GFWVDODGDXON.json","view_paper":"https://pith.science/paper/J4OOFRBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.11817&json=true","fetch_graph":"https://pith.science/api/pith-number/J4OOFRBOF325K3GFWVDODGDXON/graph.json","fetch_events":"https://pith.science/api/pith-number/J4OOFRBOF325K3GFWVDODGDXON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4OOFRBOF325K3GFWVDODGDXON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4OOFRBOF325K3GFWVDODGDXON/action/storage_attestation","attest_author":"https://pith.science/pith/J4OOFRBOF325K3GFWVDODGDXON/action/author_attestation","sign_citation":"https://pith.science/pith/J4OOFRBOF325K3GFWVDODGDXON/action/citation_signature","submit_replication":"https://pith.science/pith/J4OOFRBOF325K3GFWVDODGDXON/action/replication_record"}},"created_at":"2026-07-05T10:16:33.368022+00:00","updated_at":"2026-07-05T10:16:33.368022+00:00"}