{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R2RUJTUH3OXODEIM3SV6745UKZ","short_pith_number":"pith:R2RUJTUH","schema_version":"1.0","canonical_sha256":"8ea344ce87dbaee1910cdcabeff3b4564587f329d5ab94fa304daddceb570050","source":{"kind":"arxiv","id":"1804.10018","version":2},"attestation_state":"computed","paper":{"title":"Time-constrained multi-agent task scheduling based on prescribed performance control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Dimos V. Dimarogonas, Pian Yu","submitted_at":"2018-04-26T12:35:13Z","abstract_excerpt":"The problem of time-constrained multi-agent task scheduling and control synthesis is addressed. We assume the existence of a high level plan which consists of a sequence of cooperative tasks, each of which is associated with a deadline and several Quality-of-Service levels. By taking into account the reward and cost of satisfying each task, a novel scheduling problem is formulated and a path synthesis algorithm is proposed. Based on the obtained plan, a distributed hybrid control law is further designed for each agent. Under the condition that only a subset of the agents are aware of the high "},"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":"1804.10018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-26T12:35:13Z","cross_cats_sorted":[],"title_canon_sha256":"4037c849b1eb0ad6093172a6ba157341918c344d0f63afa680896570e306ad14","abstract_canon_sha256":"e16f98fd6fe71b22f4a6f08170117060690b907ded56f852c8a49f17e94c2395"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:23.584546Z","signature_b64":"J8LPFdmaYuVXFHALcnLRIMflFUPK9bnElux6OZb45uhceWJo+7NtVukbCjkB8n4oMS+r4u3iNP+zcgMacRg6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ea344ce87dbaee1910cdcabeff3b4564587f329d5ab94fa304daddceb570050","last_reissued_at":"2026-05-18T00:05:23.583900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:23.583900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-constrained multi-agent task scheduling based on prescribed performance control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Dimos V. Dimarogonas, Pian Yu","submitted_at":"2018-04-26T12:35:13Z","abstract_excerpt":"The problem of time-constrained multi-agent task scheduling and control synthesis is addressed. We assume the existence of a high level plan which consists of a sequence of cooperative tasks, each of which is associated with a deadline and several Quality-of-Service levels. By taking into account the reward and cost of satisfying each task, a novel scheduling problem is formulated and a path synthesis algorithm is proposed. Based on the obtained plan, a distributed hybrid control law is further designed for each agent. Under the condition that only a subset of the agents are aware of the high "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10018","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":""},"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":"1804.10018","created_at":"2026-05-18T00:05:23.583990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10018v2","created_at":"2026-05-18T00:05:23.583990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10018","created_at":"2026-05-18T00:05:23.583990+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2RUJTUH3OXO","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2RUJTUH3OXODEIM","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2RUJTUH","created_at":"2026-05-18T12:32:50.500415+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/R2RUJTUH3OXODEIM3SV6745UKZ","json":"https://pith.science/pith/R2RUJTUH3OXODEIM3SV6745UKZ.json","graph_json":"https://pith.science/api/pith-number/R2RUJTUH3OXODEIM3SV6745UKZ/graph.json","events_json":"https://pith.science/api/pith-number/R2RUJTUH3OXODEIM3SV6745UKZ/events.json","paper":"https://pith.science/paper/R2RUJTUH"},"agent_actions":{"view_html":"https://pith.science/pith/R2RUJTUH3OXODEIM3SV6745UKZ","download_json":"https://pith.science/pith/R2RUJTUH3OXODEIM3SV6745UKZ.json","view_paper":"https://pith.science/paper/R2RUJTUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10018&json=true","fetch_graph":"https://pith.science/api/pith-number/R2RUJTUH3OXODEIM3SV6745UKZ/graph.json","fetch_events":"https://pith.science/api/pith-number/R2RUJTUH3OXODEIM3SV6745UKZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2RUJTUH3OXODEIM3SV6745UKZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2RUJTUH3OXODEIM3SV6745UKZ/action/storage_attestation","attest_author":"https://pith.science/pith/R2RUJTUH3OXODEIM3SV6745UKZ/action/author_attestation","sign_citation":"https://pith.science/pith/R2RUJTUH3OXODEIM3SV6745UKZ/action/citation_signature","submit_replication":"https://pith.science/pith/R2RUJTUH3OXODEIM3SV6745UKZ/action/replication_record"}},"created_at":"2026-05-18T00:05:23.583990+00:00","updated_at":"2026-05-18T00:05:23.583990+00:00"}