{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6YCBC5KAJ3I4DEUTTECMSMGPTH","short_pith_number":"pith:6YCBC5KA","schema_version":"1.0","canonical_sha256":"f6041175404ed1c192939904c930cf99fc0f404523d00cf69bff118a2a6bf2ea","source":{"kind":"arxiv","id":"1402.3735","version":3},"attestation_state":"computed","paper":{"title":"Decentralized Goal Assignment and Safe Trajectory Generation in Multi-Robot Networks via Multiple Lyapunov Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"cs.MA","authors_text":"Dimitra Panagou, Matthew Turpin, Vijay Kumar","submitted_at":"2014-02-15T23:55:12Z","abstract_excerpt":"This paper considers the problem of decentralized goal assignment and trajectory generation for multi-robot networks when only local communication is available, and proposes an approach based on methods related to switched systems and set invariance. A family of Lyapunov-like functions is employed to encode the (local) decision making among candidate goal assignments, under which a group of connected agents chooses the assignment that results in the shortest total distance to the goals. An additional family of Lyapunov-like barrier functions is activated in the case when the optimal assignment"},"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":"1402.3735","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-02-15T23:55:12Z","cross_cats_sorted":["cs.RO","cs.SY","eess.SY"],"title_canon_sha256":"ceab5014ace576c3d692ad42060b9f3eb410fcce6e9195f0bf94149b5d4e1428","abstract_canon_sha256":"1864c640c4389ac7dc44bfcfaa0c601ef8782c6c2ae1b5ac4901d2c7ea9387dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T14:09:26.225194Z","signature_b64":"bmsFcoaZfDR6DXGoyEXk2xeiPLtLfHACzHg9YZtZ+3Z8rectV5xAOi+jzaihZzg5UJolWn+6aZzlXcNUSyJ5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6041175404ed1c192939904c930cf99fc0f404523d00cf69bff118a2a6bf2ea","last_reissued_at":"2026-06-04T14:09:26.224694Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T14:09:26.224694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Goal Assignment and Safe Trajectory Generation in Multi-Robot Networks via Multiple Lyapunov Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"cs.MA","authors_text":"Dimitra Panagou, Matthew Turpin, Vijay Kumar","submitted_at":"2014-02-15T23:55:12Z","abstract_excerpt":"This paper considers the problem of decentralized goal assignment and trajectory generation for multi-robot networks when only local communication is available, and proposes an approach based on methods related to switched systems and set invariance. A family of Lyapunov-like functions is employed to encode the (local) decision making among candidate goal assignments, under which a group of connected agents chooses the assignment that results in the shortest total distance to the goals. An additional family of Lyapunov-like barrier functions is activated in the case when the optimal assignment"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3735","kind":"arxiv","version":3},"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/1402.3735/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":"1402.3735","created_at":"2026-06-04T14:09:26.224796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3735v3","created_at":"2026-06-04T14:09:26.224796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3735","created_at":"2026-06-04T14:09:26.224796+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YCBC5KAJ3I4","created_at":"2026-06-04T14:09:26.224796+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YCBC5KAJ3I4DEUT","created_at":"2026-06-04T14:09:26.224796+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YCBC5KA","created_at":"2026-06-04T14:09:26.224796+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/6YCBC5KAJ3I4DEUTTECMSMGPTH","json":"https://pith.science/pith/6YCBC5KAJ3I4DEUTTECMSMGPTH.json","graph_json":"https://pith.science/api/pith-number/6YCBC5KAJ3I4DEUTTECMSMGPTH/graph.json","events_json":"https://pith.science/api/pith-number/6YCBC5KAJ3I4DEUTTECMSMGPTH/events.json","paper":"https://pith.science/paper/6YCBC5KA"},"agent_actions":{"view_html":"https://pith.science/pith/6YCBC5KAJ3I4DEUTTECMSMGPTH","download_json":"https://pith.science/pith/6YCBC5KAJ3I4DEUTTECMSMGPTH.json","view_paper":"https://pith.science/paper/6YCBC5KA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3735&json=true","fetch_graph":"https://pith.science/api/pith-number/6YCBC5KAJ3I4DEUTTECMSMGPTH/graph.json","fetch_events":"https://pith.science/api/pith-number/6YCBC5KAJ3I4DEUTTECMSMGPTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YCBC5KAJ3I4DEUTTECMSMGPTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YCBC5KAJ3I4DEUTTECMSMGPTH/action/storage_attestation","attest_author":"https://pith.science/pith/6YCBC5KAJ3I4DEUTTECMSMGPTH/action/author_attestation","sign_citation":"https://pith.science/pith/6YCBC5KAJ3I4DEUTTECMSMGPTH/action/citation_signature","submit_replication":"https://pith.science/pith/6YCBC5KAJ3I4DEUTTECMSMGPTH/action/replication_record"}},"created_at":"2026-06-04T14:09:26.224796+00:00","updated_at":"2026-06-04T14:09:26.224796+00:00"}