{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DPDTLWKQWLH4SIO5ETL4GFPN6W","short_pith_number":"pith:DPDTLWKQ","schema_version":"1.0","canonical_sha256":"1bc735d950b2cfc921dd24d7c315edf59ab4f615d2714c00e7a8e60322560696","source":{"kind":"arxiv","id":"2006.08845","version":1},"attestation_state":"computed","paper":{"title":"Optimal Sequential Task Assignment and Path Finding for Multi-Agent Robotic Assembly Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Kyle Brown, Mac Schwager, Martin A. Sehr, Mykel J. Kochenderfer, Oriana Peltzer","submitted_at":"2020-06-16T00:45:07Z","abstract_excerpt":"We study the problem of sequential task assignment and collision-free routing for large teams of robots in applications with inter-task precedence constraints (e.g., task $A$ and task $B$ must both be completed before task $C$ may begin). Such problems commonly occur in assembly planning for robotic manufacturing applications, in which sub-assemblies must be completed before they can be combined to form the final product. We propose a hierarchical algorithm for computing makespan-optimal solutions to the problem. The algorithm is evaluated on a set of randomly generated problem instances where"},"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":"2006.08845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-06-16T00:45:07Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"9282cc5d2c97615334cc3878c1da19d0074fbe2e9b4c3811af77b36fddaab901","abstract_canon_sha256":"967d67c13ade56db832a6990102c91efc7e03718394bdc85a35c63ea0cd9708b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:43.549342Z","signature_b64":"Antyjt4q2gUGbCoCWwR38QOg1x/ohMZyE4vp9sP64L3oYRJL+b9QFEm9tDAoBoeyLUXPg4GDzRXqLbZVg6YTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bc735d950b2cfc921dd24d7c315edf59ab4f615d2714c00e7a8e60322560696","last_reissued_at":"2026-07-05T01:10:43.548881Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:43.548881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Sequential Task Assignment and Path Finding for Multi-Agent Robotic Assembly Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Kyle Brown, Mac Schwager, Martin A. Sehr, Mykel J. Kochenderfer, Oriana Peltzer","submitted_at":"2020-06-16T00:45:07Z","abstract_excerpt":"We study the problem of sequential task assignment and collision-free routing for large teams of robots in applications with inter-task precedence constraints (e.g., task $A$ and task $B$ must both be completed before task $C$ may begin). Such problems commonly occur in assembly planning for robotic manufacturing applications, in which sub-assemblies must be completed before they can be combined to form the final product. We propose a hierarchical algorithm for computing makespan-optimal solutions to the problem. The algorithm is evaluated on a set of randomly generated problem instances where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08845","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.08845/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":"2006.08845","created_at":"2026-07-05T01:10:43.548937+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.08845v1","created_at":"2026-07-05T01:10:43.548937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08845","created_at":"2026-07-05T01:10:43.548937+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPDTLWKQWLH4","created_at":"2026-07-05T01:10:43.548937+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPDTLWKQWLH4SIO5","created_at":"2026-07-05T01:10:43.548937+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPDTLWKQ","created_at":"2026-07-05T01:10:43.548937+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/DPDTLWKQWLH4SIO5ETL4GFPN6W","json":"https://pith.science/pith/DPDTLWKQWLH4SIO5ETL4GFPN6W.json","graph_json":"https://pith.science/api/pith-number/DPDTLWKQWLH4SIO5ETL4GFPN6W/graph.json","events_json":"https://pith.science/api/pith-number/DPDTLWKQWLH4SIO5ETL4GFPN6W/events.json","paper":"https://pith.science/paper/DPDTLWKQ"},"agent_actions":{"view_html":"https://pith.science/pith/DPDTLWKQWLH4SIO5ETL4GFPN6W","download_json":"https://pith.science/pith/DPDTLWKQWLH4SIO5ETL4GFPN6W.json","view_paper":"https://pith.science/paper/DPDTLWKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.08845&json=true","fetch_graph":"https://pith.science/api/pith-number/DPDTLWKQWLH4SIO5ETL4GFPN6W/graph.json","fetch_events":"https://pith.science/api/pith-number/DPDTLWKQWLH4SIO5ETL4GFPN6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPDTLWKQWLH4SIO5ETL4GFPN6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPDTLWKQWLH4SIO5ETL4GFPN6W/action/storage_attestation","attest_author":"https://pith.science/pith/DPDTLWKQWLH4SIO5ETL4GFPN6W/action/author_attestation","sign_citation":"https://pith.science/pith/DPDTLWKQWLH4SIO5ETL4GFPN6W/action/citation_signature","submit_replication":"https://pith.science/pith/DPDTLWKQWLH4SIO5ETL4GFPN6W/action/replication_record"}},"created_at":"2026-07-05T01:10:43.548937+00:00","updated_at":"2026-07-05T01:10:43.548937+00:00"}