{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ACWN477R352NSOXDWDBHB7BJSE","short_pith_number":"pith:ACWN477R","schema_version":"1.0","canonical_sha256":"00acde7ff1df74d93ae3b0c270fc299137fe4e879efa230f66bdff4fca1b4fbb","source":{"kind":"arxiv","id":"2511.06874","version":2},"attestation_state":"computed","paper":{"title":"Radio-Coverage-Aware Path Planning for Cooperative Autonomous Vehicles","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"Autonomous vehicle fleets can plan routes that favor strong radio coverage while keeping extra distance minimal.","cross_cats":["cs.SY","eess.SY"],"primary_cat":"eess.SP","authors_text":"Fabrizio Frescura, Francesco Binucci, Giuseppe Baruffa, Luca Rugini, Paolo Banelli, Renzo Perfetti","submitted_at":"2025-11-10T09:18:42Z","abstract_excerpt":"Fleets of autonomous vehicles (AV) often are at the core of intelligent transportation scenarios for smart cities, and may require a wireless Internet connection to offload computer vision tasks to data centers located either in the edge or the cloud section of the network. Cooperation among AVs is successful when the environment is unknown, or changes dynamically, so as to improve coverage and trip time, and minimize the traveled distance. The AVs, while mapping the environment with range-based sensors, move across the wireless coverage areas, with consequences on the experienced access bit r"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2511.06874","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"eess.SP","submitted_at":"2025-11-10T09:18:42Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"cac984c3f56fe2c8528c0ab6ee0fb9094537b24ac6826633b1fa6b14e6a939f9","abstract_canon_sha256":"9099fe693da50a57d82ee51117014d722e3c82850cd26f82d9503c6c66425a06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:33.344611Z","signature_b64":"ZcuepctJW+7s0hEXLQiUZmh7yUNmSlsJMIS3PYG9wOJ1RoyzNoeabLLJ4ZiGH/BSRO40p3mhUHN5JMJIa/TSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00acde7ff1df74d93ae3b0c270fc299137fe4e879efa230f66bdff4fca1b4fbb","last_reissued_at":"2026-05-18T03:09:33.343762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:33.343762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Radio-Coverage-Aware Path Planning for Cooperative Autonomous Vehicles","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"Autonomous vehicle fleets can plan routes that favor strong radio coverage while keeping extra distance minimal.","cross_cats":["cs.SY","eess.SY"],"primary_cat":"eess.SP","authors_text":"Fabrizio Frescura, Francesco Binucci, Giuseppe Baruffa, Luca Rugini, Paolo Banelli, Renzo Perfetti","submitted_at":"2025-11-10T09:18:42Z","abstract_excerpt":"Fleets of autonomous vehicles (AV) often are at the core of intelligent transportation scenarios for smart cities, and may require a wireless Internet connection to offload computer vision tasks to data centers located either in the edge or the cloud section of the network. Cooperation among AVs is successful when the environment is unknown, or changes dynamically, so as to improve coverage and trip time, and minimize the traveled distance. The AVs, while mapping the environment with range-based sensors, move across the wireless coverage areas, with consequences on the experienced access bit r"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The proposed mapping algorithm can achieve a mapping error probability below 2%, while the proposed path-planning algorithms extend the radio coverage of the AVs, with only a limited increase in traveled distance with respect to shortest-path existing methods, such as conventional Dijkstra and A* algorithms.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That radio coverage areas can be accurately sensed and mapped in real time by the vehicles' range-based sensors while they move, and that the introduced radio-related cost-weighting functions produce meaningful improvements without hidden trade-offs not captured in the simulations.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Autonomous vehicles can improve radio coverage during path planning by weighting costs in Dijkstra and A* algorithms, achieving low mapping error and only modest extra distance.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Autonomous vehicle fleets can plan routes that favor strong radio coverage while keeping extra distance minimal.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"249f7f04000ce4afaf9b276d84196465f74d3ff21b7a6619434ddc38f4e3601a"},"source":{"id":"2511.06874","kind":"arxiv","version":2},"verdict":{"id":"3436ba28-b975-4aa5-ba5d-734ce0d0442a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T00:07:56.525580Z","strongest_claim":"The proposed mapping algorithm can achieve a mapping error probability below 2%, while the proposed path-planning algorithms extend the radio coverage of the AVs, with only a limited increase in traveled distance with respect to shortest-path existing methods, such as conventional Dijkstra and A* algorithms.","one_line_summary":"Autonomous vehicles can improve radio coverage during path planning by weighting costs in Dijkstra and A* algorithms, achieving low mapping error and only modest extra distance.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That radio coverage areas can be accurately sensed and mapped in real time by the vehicles' range-based sensors while they move, and that the introduced radio-related cost-weighting functions produce meaningful improvements without hidden trade-offs not captured in the simulations.","pith_extraction_headline":"Autonomous vehicle fleets can plan routes that favor strong radio coverage while keeping extra distance minimal."},"references":{"count":38,"sample":[{"doi":"","year":2023,"title":"Region coverage-aware path planning for unmanned aerial vehicles: A systematic review,","work_id":"9fed3db7-e8d8-4416-9ad3-3763cc5e96f4","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Cooperative heterogeneous multi-robot systems: A survey,","work_id":"49a812e2-006d-4c86-b4cd-b11429d769ab","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"A clustering- based coverage path planning method for autonomous heteroge- neous UA Vs,","work_id":"117bb384-ff52-4727-89ac-2ba8839ae077","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2005,"title":"Path planning protocol for collaborative multi-robot systems,","work_id":"cca7dc3c-b955-4c14-97bb-4a744cd94ee2","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"A review of cooperative path planning of an unmanned aerial vehicle group,","work_id":"1d15ec60-e551-48e2-8623-d8f0742b84c9","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":38,"snapshot_sha256":"de5729b29c5bcfbf5fed5d95922a275e4d7f57ed5efea87a9087b870a06fb9ac","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"1a986b8c61974834f5f80ce91ba3cde06b37cedf1a322a01862104af61502b14"},"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":"2511.06874","created_at":"2026-05-18T03:09:33.343894+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.06874v2","created_at":"2026-05-18T03:09:33.343894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.06874","created_at":"2026-05-18T03:09:33.343894+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACWN477R352N","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACWN477R352NSOXD","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACWN477R","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ACWN477R352NSOXDWDBHB7BJSE","json":"https://pith.science/pith/ACWN477R352NSOXDWDBHB7BJSE.json","graph_json":"https://pith.science/api/pith-number/ACWN477R352NSOXDWDBHB7BJSE/graph.json","events_json":"https://pith.science/api/pith-number/ACWN477R352NSOXDWDBHB7BJSE/events.json","paper":"https://pith.science/paper/ACWN477R"},"agent_actions":{"view_html":"https://pith.science/pith/ACWN477R352NSOXDWDBHB7BJSE","download_json":"https://pith.science/pith/ACWN477R352NSOXDWDBHB7BJSE.json","view_paper":"https://pith.science/paper/ACWN477R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.06874&json=true","fetch_graph":"https://pith.science/api/pith-number/ACWN477R352NSOXDWDBHB7BJSE/graph.json","fetch_events":"https://pith.science/api/pith-number/ACWN477R352NSOXDWDBHB7BJSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACWN477R352NSOXDWDBHB7BJSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACWN477R352NSOXDWDBHB7BJSE/action/storage_attestation","attest_author":"https://pith.science/pith/ACWN477R352NSOXDWDBHB7BJSE/action/author_attestation","sign_citation":"https://pith.science/pith/ACWN477R352NSOXDWDBHB7BJSE/action/citation_signature","submit_replication":"https://pith.science/pith/ACWN477R352NSOXDWDBHB7BJSE/action/replication_record"}},"created_at":"2026-05-18T03:09:33.343894+00:00","updated_at":"2026-05-18T03:09:33.343894+00:00"}