{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5I6MB2CY4BPVQFDUG2UWMROSLS","short_pith_number":"pith:5I6MB2CY","schema_version":"1.0","canonical_sha256":"ea3cc0e858e05f58147436a96645d25c99323ecc728ec419120b2fd77980e86f","source":{"kind":"arxiv","id":"2503.18545","version":1},"attestation_state":"computed","paper":{"title":"Communication-aware planning for robot teams deployment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Luis Montano, Yaroslav Marchukov","submitted_at":"2025-03-24T10:59:23Z","abstract_excerpt":"In the present work we address the problem of deploying a team of robots in a scenario where some locations of interest must be reached. Thus, a planning for a deployment is required, before sending the robots. The obstacles, the limited communication range, and the need of communicating to a base station, constrain the connectivity of the team and the deployment planning. We propose a method consisting of three algorithms: a distributed path planner to obtain communication-aware trajectories; a deployment planner providing dual-use of the robots, visiting primary goals and performing connecti"},"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":"2503.18545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-03-24T10:59:23Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"0000c6422f276698c8299c82ee7e7dd096ac83dbf8369aaad5dd29134f2fc10e","abstract_canon_sha256":"4c4cf138e0fa8287b0d29104838be03f84dd270a0f6911cabbc5cc7ee060fc68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:12.990289Z","signature_b64":"TwQrc6yBfsb6ImbiddgUwi12xjY0aNM6uTt5XQPmeRr84BOxjMtQYqXqiE74ztEU8Gce9zwY9Za9sSV5pHMnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea3cc0e858e05f58147436a96645d25c99323ecc728ec419120b2fd77980e86f","last_reissued_at":"2026-07-05T10:38:12.988962Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:12.988962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-aware planning for robot teams deployment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Luis Montano, Yaroslav Marchukov","submitted_at":"2025-03-24T10:59:23Z","abstract_excerpt":"In the present work we address the problem of deploying a team of robots in a scenario where some locations of interest must be reached. Thus, a planning for a deployment is required, before sending the robots. The obstacles, the limited communication range, and the need of communicating to a base station, constrain the connectivity of the team and the deployment planning. We propose a method consisting of three algorithms: a distributed path planner to obtain communication-aware trajectories; a deployment planner providing dual-use of the robots, visiting primary goals and performing connecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.18545","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.18545/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":"2503.18545","created_at":"2026-07-05T10:38:12.989040+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.18545v1","created_at":"2026-07-05T10:38:12.989040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.18545","created_at":"2026-07-05T10:38:12.989040+00:00"},{"alias_kind":"pith_short_12","alias_value":"5I6MB2CY4BPV","created_at":"2026-07-05T10:38:12.989040+00:00"},{"alias_kind":"pith_short_16","alias_value":"5I6MB2CY4BPVQFDU","created_at":"2026-07-05T10:38:12.989040+00:00"},{"alias_kind":"pith_short_8","alias_value":"5I6MB2CY","created_at":"2026-07-05T10:38:12.989040+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/5I6MB2CY4BPVQFDUG2UWMROSLS","json":"https://pith.science/pith/5I6MB2CY4BPVQFDUG2UWMROSLS.json","graph_json":"https://pith.science/api/pith-number/5I6MB2CY4BPVQFDUG2UWMROSLS/graph.json","events_json":"https://pith.science/api/pith-number/5I6MB2CY4BPVQFDUG2UWMROSLS/events.json","paper":"https://pith.science/paper/5I6MB2CY"},"agent_actions":{"view_html":"https://pith.science/pith/5I6MB2CY4BPVQFDUG2UWMROSLS","download_json":"https://pith.science/pith/5I6MB2CY4BPVQFDUG2UWMROSLS.json","view_paper":"https://pith.science/paper/5I6MB2CY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.18545&json=true","fetch_graph":"https://pith.science/api/pith-number/5I6MB2CY4BPVQFDUG2UWMROSLS/graph.json","fetch_events":"https://pith.science/api/pith-number/5I6MB2CY4BPVQFDUG2UWMROSLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5I6MB2CY4BPVQFDUG2UWMROSLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5I6MB2CY4BPVQFDUG2UWMROSLS/action/storage_attestation","attest_author":"https://pith.science/pith/5I6MB2CY4BPVQFDUG2UWMROSLS/action/author_attestation","sign_citation":"https://pith.science/pith/5I6MB2CY4BPVQFDUG2UWMROSLS/action/citation_signature","submit_replication":"https://pith.science/pith/5I6MB2CY4BPVQFDUG2UWMROSLS/action/replication_record"}},"created_at":"2026-07-05T10:38:12.989040+00:00","updated_at":"2026-07-05T10:38:12.989040+00:00"}