{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OAJZ67RATKEL6OQ7BFTJOP2ILJ","short_pith_number":"pith:OAJZ67RA","schema_version":"1.0","canonical_sha256":"70139f7e209a88bf3a1f0966973f485a7273ebe6e324381ec36f2263d17613be","source":{"kind":"arxiv","id":"2502.16531","version":2},"attestation_state":"computed","paper":{"title":"Efficient Coordination and Synchronization of Multi-Robot Systems Under Recurring Linear Temporal Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Davide Peron, Dimos V. Dimarogonas, Eleftherios E. Vlahakis, Victor Nan Fernandez-Ayala","submitted_at":"2025-02-23T10:35:04Z","abstract_excerpt":"We consider multi-robot systems under recurring tasks formalized as linear temporal logic (LTL) specifications. To solve the planning problem efficiently, we propose a bottom-up approach combining offline plan synthesis with online coordination, dynamically adjusting plans via real-time communication. To address action delays, we introduce a synchronization mechanism ensuring coordinated task execution, leading to a multi-agent coordination and synchronization framework that is adaptable to a wide range of multi-robot applications. The software package is developed in Python and ROS2 for broad"},"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":"2502.16531","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-02-23T10:35:04Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"9c467a3467f5ef3cdd4d9c19c7290f69d554bfcbf0c2b36f132b17001153cfaa","abstract_canon_sha256":"1b4bebbd7c25ebd9ba924365273da609f60d3f1263e81476ac0c618d349a8ff0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:05:00.112038Z","signature_b64":"iVQxEDxfxi/6OuTO5godjI7YFbGTm6Qb6EuqAVrMMMoCRWchxY+0rMwvW8FfC5k4GN5pp6hOrkEj6QGdnEuwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70139f7e209a88bf3a1f0966973f485a7273ebe6e324381ec36f2263d17613be","last_reissued_at":"2026-06-08T01:05:00.111078Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:05:00.111078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Coordination and Synchronization of Multi-Robot Systems Under Recurring Linear Temporal Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Davide Peron, Dimos V. Dimarogonas, Eleftherios E. Vlahakis, Victor Nan Fernandez-Ayala","submitted_at":"2025-02-23T10:35:04Z","abstract_excerpt":"We consider multi-robot systems under recurring tasks formalized as linear temporal logic (LTL) specifications. To solve the planning problem efficiently, we propose a bottom-up approach combining offline plan synthesis with online coordination, dynamically adjusting plans via real-time communication. To address action delays, we introduce a synchronization mechanism ensuring coordinated task execution, leading to a multi-agent coordination and synchronization framework that is adaptable to a wide range of multi-robot applications. The software package is developed in Python and ROS2 for broad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16531","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.16531/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":"2502.16531","created_at":"2026-06-08T01:05:00.111184+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.16531v2","created_at":"2026-06-08T01:05:00.111184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16531","created_at":"2026-06-08T01:05:00.111184+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAJZ67RATKEL","created_at":"2026-06-08T01:05:00.111184+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAJZ67RATKEL6OQ7","created_at":"2026-06-08T01:05:00.111184+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAJZ67RA","created_at":"2026-06-08T01:05:00.111184+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/OAJZ67RATKEL6OQ7BFTJOP2ILJ","json":"https://pith.science/pith/OAJZ67RATKEL6OQ7BFTJOP2ILJ.json","graph_json":"https://pith.science/api/pith-number/OAJZ67RATKEL6OQ7BFTJOP2ILJ/graph.json","events_json":"https://pith.science/api/pith-number/OAJZ67RATKEL6OQ7BFTJOP2ILJ/events.json","paper":"https://pith.science/paper/OAJZ67RA"},"agent_actions":{"view_html":"https://pith.science/pith/OAJZ67RATKEL6OQ7BFTJOP2ILJ","download_json":"https://pith.science/pith/OAJZ67RATKEL6OQ7BFTJOP2ILJ.json","view_paper":"https://pith.science/paper/OAJZ67RA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.16531&json=true","fetch_graph":"https://pith.science/api/pith-number/OAJZ67RATKEL6OQ7BFTJOP2ILJ/graph.json","fetch_events":"https://pith.science/api/pith-number/OAJZ67RATKEL6OQ7BFTJOP2ILJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAJZ67RATKEL6OQ7BFTJOP2ILJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAJZ67RATKEL6OQ7BFTJOP2ILJ/action/storage_attestation","attest_author":"https://pith.science/pith/OAJZ67RATKEL6OQ7BFTJOP2ILJ/action/author_attestation","sign_citation":"https://pith.science/pith/OAJZ67RATKEL6OQ7BFTJOP2ILJ/action/citation_signature","submit_replication":"https://pith.science/pith/OAJZ67RATKEL6OQ7BFTJOP2ILJ/action/replication_record"}},"created_at":"2026-06-08T01:05:00.111184+00:00","updated_at":"2026-06-08T01:05:00.111184+00:00"}