{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ICPGRZVFPEOAU6VJLBPZANESM2","short_pith_number":"pith:ICPGRZVF","schema_version":"1.0","canonical_sha256":"409e68e6a5791c0a7aa9585f90349266ab0ca2697df91c91ddbe62e2f66eb732","source":{"kind":"arxiv","id":"1802.09921","version":1},"attestation_state":"computed","paper":{"title":"Approximating the Region of Multi-Task Coordination via the Optimal Lyapunov-Like Barrier Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Dimitra Panagou, Dongkun Han, Lixing Huang","submitted_at":"2018-02-24T13:30:40Z","abstract_excerpt":"We consider the multi-task coordination problem for multi-agent systems under the following objectives: 1. collision avoidance; 2. connectivity maintenance; 3. convergence to desired destinations. The paper focuses on the safety guaranteed region of multi-task coordination (SG-RMTC), i.e., the set of initial states from which all trajectories converge to the desired configuration, while at the same time achieve the multi-task coordination and avoid unsafe sets. In contrast to estimating the domain of attraction via Lyapunov functions, the main underlying idea is to employ the sublevel sets of "},"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":"1802.09921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-24T13:30:40Z","cross_cats_sorted":[],"title_canon_sha256":"e023ea6157bd25318d3c47b391d7e52aae7b71c104063cddc9bf7858fb767f42","abstract_canon_sha256":"346b96427ad81335ef83de2d4ca4f6e617549dfddf0eae083032681082d28487"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:21.894956Z","signature_b64":"oMW0q+6wyRxQrt3nTEaj/iJqQwNzSui0NSjmc0w5Ac2iswWXp4t8ekKqbJPuDx2X1oPru3A8RWJVXjeQma3fBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"409e68e6a5791c0a7aa9585f90349266ab0ca2697df91c91ddbe62e2f66eb732","last_reissued_at":"2026-05-18T00:22:21.894366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:21.894366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Region of Multi-Task Coordination via the Optimal Lyapunov-Like Barrier Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Dimitra Panagou, Dongkun Han, Lixing Huang","submitted_at":"2018-02-24T13:30:40Z","abstract_excerpt":"We consider the multi-task coordination problem for multi-agent systems under the following objectives: 1. collision avoidance; 2. connectivity maintenance; 3. convergence to desired destinations. The paper focuses on the safety guaranteed region of multi-task coordination (SG-RMTC), i.e., the set of initial states from which all trajectories converge to the desired configuration, while at the same time achieve the multi-task coordination and avoid unsafe sets. In contrast to estimating the domain of attraction via Lyapunov functions, the main underlying idea is to employ the sublevel sets of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09921","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":"1802.09921","created_at":"2026-05-18T00:22:21.894454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09921v1","created_at":"2026-05-18T00:22:21.894454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09921","created_at":"2026-05-18T00:22:21.894454+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICPGRZVFPEOA","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICPGRZVFPEOAU6VJ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICPGRZVF","created_at":"2026-05-18T12:32:28.185984+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/ICPGRZVFPEOAU6VJLBPZANESM2","json":"https://pith.science/pith/ICPGRZVFPEOAU6VJLBPZANESM2.json","graph_json":"https://pith.science/api/pith-number/ICPGRZVFPEOAU6VJLBPZANESM2/graph.json","events_json":"https://pith.science/api/pith-number/ICPGRZVFPEOAU6VJLBPZANESM2/events.json","paper":"https://pith.science/paper/ICPGRZVF"},"agent_actions":{"view_html":"https://pith.science/pith/ICPGRZVFPEOAU6VJLBPZANESM2","download_json":"https://pith.science/pith/ICPGRZVFPEOAU6VJLBPZANESM2.json","view_paper":"https://pith.science/paper/ICPGRZVF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09921&json=true","fetch_graph":"https://pith.science/api/pith-number/ICPGRZVFPEOAU6VJLBPZANESM2/graph.json","fetch_events":"https://pith.science/api/pith-number/ICPGRZVFPEOAU6VJLBPZANESM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICPGRZVFPEOAU6VJLBPZANESM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICPGRZVFPEOAU6VJLBPZANESM2/action/storage_attestation","attest_author":"https://pith.science/pith/ICPGRZVFPEOAU6VJLBPZANESM2/action/author_attestation","sign_citation":"https://pith.science/pith/ICPGRZVFPEOAU6VJLBPZANESM2/action/citation_signature","submit_replication":"https://pith.science/pith/ICPGRZVFPEOAU6VJLBPZANESM2/action/replication_record"}},"created_at":"2026-05-18T00:22:21.894454+00:00","updated_at":"2026-05-18T00:22:21.894454+00:00"}