{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QSGNVTK5ZMQOWZ3I6PVZJEG4M6","short_pith_number":"pith:QSGNVTK5","schema_version":"1.0","canonical_sha256":"848cdacd5dcb20eb6768f3eb9490dc67865181ab42811128052eae4d614f3780","source":{"kind":"arxiv","id":"1702.07934","version":1},"attestation_state":"computed","paper":{"title":"A decentralized algorithm for control of autonomous agents coupled by feasibility constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.MA","authors_text":"Andrew G. Alleyne, Edoardo Sabbioni, Francesco Braghin, Stijn De Bruyne, Ugo Rosolia","submitted_at":"2017-02-25T18:10:37Z","abstract_excerpt":"In this paper a decentralized control algorithm for systems composed of $N$ dynamically decoupled agents, coupled by feasibility constraints, is presented. The control problem is divided into $N$ optimal control sub-problems and a communication scheme is proposed to decouple computations. The derivative of the solution of each sub-problem is used to approximate the evolution of the system allowing the algorithm to decentralize and parallelize computations. The effectiveness of the proposed algorithm is shown through simulations in a cooperative driving scenario."},"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":"1702.07934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-25T18:10:37Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"1e350e4939aa3c544cfd3df2c860039890806a0ea8bfb60c13640c41311ce404","abstract_canon_sha256":"9cb38f37ba4caa58183f8e06715ab96050d4d6bf14f40bda214f5f32008f7543"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:56.647743Z","signature_b64":"BCv79OBfCtRpXj9JWiRWqEa8810sb6aD07BrfwVTUXPT69FPAo/WvXcdUglf0F2QhyyXDSiFEHAWJP5SW7wkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"848cdacd5dcb20eb6768f3eb9490dc67865181ab42811128052eae4d614f3780","last_reissued_at":"2026-05-18T00:49:56.647152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:56.647152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A decentralized algorithm for control of autonomous agents coupled by feasibility constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.MA","authors_text":"Andrew G. Alleyne, Edoardo Sabbioni, Francesco Braghin, Stijn De Bruyne, Ugo Rosolia","submitted_at":"2017-02-25T18:10:37Z","abstract_excerpt":"In this paper a decentralized control algorithm for systems composed of $N$ dynamically decoupled agents, coupled by feasibility constraints, is presented. The control problem is divided into $N$ optimal control sub-problems and a communication scheme is proposed to decouple computations. The derivative of the solution of each sub-problem is used to approximate the evolution of the system allowing the algorithm to decentralize and parallelize computations. The effectiveness of the proposed algorithm is shown through simulations in a cooperative driving scenario."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07934","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":""},"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":"1702.07934","created_at":"2026-05-18T00:49:56.647259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07934v1","created_at":"2026-05-18T00:49:56.647259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07934","created_at":"2026-05-18T00:49:56.647259+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSGNVTK5ZMQO","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSGNVTK5ZMQOWZ3I","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSGNVTK5","created_at":"2026-05-18T12:31:39.905425+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/QSGNVTK5ZMQOWZ3I6PVZJEG4M6","json":"https://pith.science/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6.json","graph_json":"https://pith.science/api/pith-number/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/graph.json","events_json":"https://pith.science/api/pith-number/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/events.json","paper":"https://pith.science/paper/QSGNVTK5"},"agent_actions":{"view_html":"https://pith.science/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6","download_json":"https://pith.science/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6.json","view_paper":"https://pith.science/paper/QSGNVTK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07934&json=true","fetch_graph":"https://pith.science/api/pith-number/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/graph.json","fetch_events":"https://pith.science/api/pith-number/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/action/storage_attestation","attest_author":"https://pith.science/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/action/author_attestation","sign_citation":"https://pith.science/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/action/citation_signature","submit_replication":"https://pith.science/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/action/replication_record"}},"created_at":"2026-05-18T00:49:56.647259+00:00","updated_at":"2026-05-18T00:49:56.647259+00:00"}