{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:EC2GZDPH26NVVY6CS6SW4PM3YR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b3dcf010c74c1b14a8d39e547f5174a6b1e5bd65db0ac38e878b71c8944dfbf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-05-27T16:59:13Z","title_canon_sha256":"f1d179d11c86c209b3ef4cec8d0cd3a031008612726ef77ebc9dc87d5ae6874a"},"schema_version":"1.0","source":{"id":"2305.17527","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.17527","created_at":"2026-07-05T06:17:07Z"},{"alias_kind":"arxiv_version","alias_value":"2305.17527v2","created_at":"2026-07-05T06:17:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.17527","created_at":"2026-07-05T06:17:07Z"},{"alias_kind":"pith_short_12","alias_value":"EC2GZDPH26NV","created_at":"2026-07-05T06:17:07Z"},{"alias_kind":"pith_short_16","alias_value":"EC2GZDPH26NVVY6C","created_at":"2026-07-05T06:17:07Z"},{"alias_kind":"pith_short_8","alias_value":"EC2GZDPH","created_at":"2026-07-05T06:17:07Z"}],"graph_snapshots":[{"event_id":"sha256:609f2b4b37662f42141e318ae6301ee47560436f859ce17432d7b087290125c8","target":"graph","created_at":"2026-07-05T06:17:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.17527/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Marc Toussaint, Valentin N. Hartmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-05-27T16:59:13Z","title":"Towards computing low-makespan solutions for multi-arm multi-task planning problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.17527","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4eb325b6b9412ba5fa0aa79f5edce3b1cc02540abfee7ba057984c69de500e03","target":"record","created_at":"2026-07-05T06:17:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b3dcf010c74c1b14a8d39e547f5174a6b1e5bd65db0ac38e878b71c8944dfbf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-05-27T16:59:13Z","title_canon_sha256":"f1d179d11c86c209b3ef4cec8d0cd3a031008612726ef77ebc9dc87d5ae6874a"},"schema_version":"1.0","source":{"id":"2305.17527","kind":"arxiv","version":2}},"canonical_sha256":"20b46c8de7d79b5ae3c297a56e3d9bc45333cbd09a6c8d9fdb999095b06cbaa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20b46c8de7d79b5ae3c297a56e3d9bc45333cbd09a6c8d9fdb999095b06cbaa1","first_computed_at":"2026-07-05T06:17:07.880367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:17:07.880367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qsxR9yK/C60EMBpNnmB/dp9nGpTUPFVQC5P2e9uNpQ5p95Gym2db3qm7kZl8XNo3gECDpgoBCfPkuUYg6Ak/CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:17:07.880783Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.17527","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4eb325b6b9412ba5fa0aa79f5edce3b1cc02540abfee7ba057984c69de500e03","sha256:609f2b4b37662f42141e318ae6301ee47560436f859ce17432d7b087290125c8"],"state_sha256":"39a322fad231bebeb67fa542caa51458df66876b8bbad09fc32a858449b32d79"}