{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EC2GZDPH26NVVY6CS6SW4PM3YR","short_pith_number":"pith:EC2GZDPH","schema_version":"1.0","canonical_sha256":"20b46c8de7d79b5ae3c297a56e3d9bc45333cbd09a6c8d9fdb999095b06cbaa1","source":{"kind":"arxiv","id":"2305.17527","version":2},"attestation_state":"computed","paper":{"title":"Towards computing low-makespan solutions for multi-arm multi-task planning problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Marc Toussaint, Valentin N. Hartmann","submitted_at":"2023-05-27T16:59:13Z","abstract_excerpt":"We propose an approach to find low-makespan solutions to multi-robot multi-task planning problems in environments where robots block each other from completing tasks simultaneously. We introduce a formulation of the problem that allows for an approach based on greedy descent with random restarts for generation of the task assignment and task sequence. We then use a multi-agent path planner to evaluate the makespan of a given assignment and sequence. The planner decomposes the problem into multiple simple subproblems that only contain a single robots and a single task, and can thus be solved qu"},"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.17527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-05-27T16:59:13Z","cross_cats_sorted":[],"title_canon_sha256":"f1d179d11c86c209b3ef4cec8d0cd3a031008612726ef77ebc9dc87d5ae6874a","abstract_canon_sha256":"b3dcf010c74c1b14a8d39e547f5174a6b1e5bd65db0ac38e878b71c8944dfbf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:17:07.880783Z","signature_b64":"qsxR9yK/C60EMBpNnmB/dp9nGpTUPFVQC5P2e9uNpQ5p95Gym2db3qm7kZl8XNo3gECDpgoBCfPkuUYg6Ak/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20b46c8de7d79b5ae3c297a56e3d9bc45333cbd09a6c8d9fdb999095b06cbaa1","last_reissued_at":"2026-07-05T06:17:07.880367Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:17:07.880367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards computing low-makespan solutions for multi-arm multi-task planning problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Marc Toussaint, Valentin N. Hartmann","submitted_at":"2023-05-27T16:59:13Z","abstract_excerpt":"We propose an approach to find low-makespan solutions to multi-robot multi-task planning problems in environments where robots block each other from completing tasks simultaneously. We introduce a formulation of the problem that allows for an approach based on greedy descent with random restarts for generation of the task assignment and task sequence. We then use a multi-agent path planner to evaluate the makespan of a given assignment and sequence. The planner decomposes the problem into multiple simple subproblems that only contain a single robots and a single task, and can thus be solved qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.17527","kind":"arxiv","version":2},"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.17527/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.17527","created_at":"2026-07-05T06:17:07.880424+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.17527v2","created_at":"2026-07-05T06:17:07.880424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.17527","created_at":"2026-07-05T06:17:07.880424+00:00"},{"alias_kind":"pith_short_12","alias_value":"EC2GZDPH26NV","created_at":"2026-07-05T06:17:07.880424+00:00"},{"alias_kind":"pith_short_16","alias_value":"EC2GZDPH26NVVY6C","created_at":"2026-07-05T06:17:07.880424+00:00"},{"alias_kind":"pith_short_8","alias_value":"EC2GZDPH","created_at":"2026-07-05T06:17:07.880424+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.03509","citing_title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EC2GZDPH26NVVY6CS6SW4PM3YR","json":"https://pith.science/pith/EC2GZDPH26NVVY6CS6SW4PM3YR.json","graph_json":"https://pith.science/api/pith-number/EC2GZDPH26NVVY6CS6SW4PM3YR/graph.json","events_json":"https://pith.science/api/pith-number/EC2GZDPH26NVVY6CS6SW4PM3YR/events.json","paper":"https://pith.science/paper/EC2GZDPH"},"agent_actions":{"view_html":"https://pith.science/pith/EC2GZDPH26NVVY6CS6SW4PM3YR","download_json":"https://pith.science/pith/EC2GZDPH26NVVY6CS6SW4PM3YR.json","view_paper":"https://pith.science/paper/EC2GZDPH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.17527&json=true","fetch_graph":"https://pith.science/api/pith-number/EC2GZDPH26NVVY6CS6SW4PM3YR/graph.json","fetch_events":"https://pith.science/api/pith-number/EC2GZDPH26NVVY6CS6SW4PM3YR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EC2GZDPH26NVVY6CS6SW4PM3YR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EC2GZDPH26NVVY6CS6SW4PM3YR/action/storage_attestation","attest_author":"https://pith.science/pith/EC2GZDPH26NVVY6CS6SW4PM3YR/action/author_attestation","sign_citation":"https://pith.science/pith/EC2GZDPH26NVVY6CS6SW4PM3YR/action/citation_signature","submit_replication":"https://pith.science/pith/EC2GZDPH26NVVY6CS6SW4PM3YR/action/replication_record"}},"created_at":"2026-07-05T06:17:07.880424+00:00","updated_at":"2026-07-05T06:17:07.880424+00:00"}