{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:K5ZNFOP77M2XANLTI4BQVGPZSK","short_pith_number":"pith:K5ZNFOP7","schema_version":"1.0","canonical_sha256":"5772d2b9fffb3570357347030a99f992883ef001cea603e43c810519d9e5453e","source":{"kind":"arxiv","id":"1907.08531","version":1},"attestation_state":"computed","paper":{"title":"An optimization-based cooperative path-following framework for multiple robotic vehicles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Andrea Alessandretti, A. Pedro Aguiar","submitted_at":"2019-07-19T14:39:09Z","abstract_excerpt":"This paper addresses the design of an optimization-based cooperative path-following control law for multiple robotic vehicles that optimally balances the transient trade-off between coordination and path-following errors. To this end, we formulate a more general multi-agent framework where each agent is associated with (i) a continuous-time dynamical model, which governs the evolution of its state, and (ii) an output equation that is a function of both the state of the agent and a coordination vector. According to a given network topology, each agent can access its state and coordination vecto"},"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":"1907.08531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-07-19T14:39:09Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"38010a4f61cc99f427e7c3f59f64337358cf869c53ffde4bf9ffc261cfa5466f","abstract_canon_sha256":"afde05ec0b37b622f371d8bcccf4e2385b19c814896cffa00d6b48e18eb381b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:09.537252Z","signature_b64":"qEpqBhJEpoOz7gwvAXOFL0jQwjCt66XhxfYCMG7GHY20S9BR3g+h7twaAxM1ork0VBVUvG8SgP0YBXGq1bEIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5772d2b9fffb3570357347030a99f992883ef001cea603e43c810519d9e5453e","last_reissued_at":"2026-05-17T23:40:09.536604Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:09.536604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An optimization-based cooperative path-following framework for multiple robotic vehicles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Andrea Alessandretti, A. Pedro Aguiar","submitted_at":"2019-07-19T14:39:09Z","abstract_excerpt":"This paper addresses the design of an optimization-based cooperative path-following control law for multiple robotic vehicles that optimally balances the transient trade-off between coordination and path-following errors. To this end, we formulate a more general multi-agent framework where each agent is associated with (i) a continuous-time dynamical model, which governs the evolution of its state, and (ii) an output equation that is a function of both the state of the agent and a coordination vector. According to a given network topology, each agent can access its state and coordination vecto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08531","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":"1907.08531","created_at":"2026-05-17T23:40:09.536716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08531v1","created_at":"2026-05-17T23:40:09.536716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08531","created_at":"2026-05-17T23:40:09.536716+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5ZNFOP77M2X","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5ZNFOP77M2XANLT","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5ZNFOP7","created_at":"2026-05-18T12:33:21.387695+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/K5ZNFOP77M2XANLTI4BQVGPZSK","json":"https://pith.science/pith/K5ZNFOP77M2XANLTI4BQVGPZSK.json","graph_json":"https://pith.science/api/pith-number/K5ZNFOP77M2XANLTI4BQVGPZSK/graph.json","events_json":"https://pith.science/api/pith-number/K5ZNFOP77M2XANLTI4BQVGPZSK/events.json","paper":"https://pith.science/paper/K5ZNFOP7"},"agent_actions":{"view_html":"https://pith.science/pith/K5ZNFOP77M2XANLTI4BQVGPZSK","download_json":"https://pith.science/pith/K5ZNFOP77M2XANLTI4BQVGPZSK.json","view_paper":"https://pith.science/paper/K5ZNFOP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08531&json=true","fetch_graph":"https://pith.science/api/pith-number/K5ZNFOP77M2XANLTI4BQVGPZSK/graph.json","fetch_events":"https://pith.science/api/pith-number/K5ZNFOP77M2XANLTI4BQVGPZSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5ZNFOP77M2XANLTI4BQVGPZSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5ZNFOP77M2XANLTI4BQVGPZSK/action/storage_attestation","attest_author":"https://pith.science/pith/K5ZNFOP77M2XANLTI4BQVGPZSK/action/author_attestation","sign_citation":"https://pith.science/pith/K5ZNFOP77M2XANLTI4BQVGPZSK/action/citation_signature","submit_replication":"https://pith.science/pith/K5ZNFOP77M2XANLTI4BQVGPZSK/action/replication_record"}},"created_at":"2026-05-17T23:40:09.536716+00:00","updated_at":"2026-05-17T23:40:09.536716+00:00"}