Metraipolis › archive › dc_676d4bce2412

Quantum-Based k-Coverage Optimization for UAV-Aided Search and Rescue Missions — arXiv:2609.01930

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.01930
License (as archived)
CC0-1.0
Archived
2026-10-17T06:27:55.744Z
SHA-256 of the archived text
bd0ab78e7e68c48c72b439822e8b6367f2e691083f0ef6095c1e77da74cff09a
Stable URL of this page
https://metraipolis.com/documento/dc_676d4bce2412

How to cite

Quantum-Based k-Coverage Optimization for UAV-Aided Search and Rescue Missions — arXiv:2609.01930 — arXiv (en), https://arxiv.org/abs/2609.01930 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_676d4bce2412 (Metraipolis archive dc_676d4bce2412, sha256 bd0ab78e7e68c48c72b439822e8b6367f2e691083f0ef6095c1e77da74cff09a)
BibTeX
@misc{dc676d4bce2412,
  title = {Quantum-Based k-Coverage Optimization for UAV-Aided Search and Rescue Missions — arXiv:2609.01930},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.01930},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_676d4bce2412; sha256 bd0ab78e7e68c48c72b439822e8b6367f2e691083f0ef6095c1e77da74cff09a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01930. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In large-scale disaster scenarios, rapid localization of missing persons is a critical challenge for search-and-rescue (SAR) operations. Unmanned aerial vehicles (UAVs) equipped with radio frequency (RF) receivers can support RF-based localization by collecting signals emitted from mobile devices at spatially distributed sensing locations. This paper addresses the resulting waypoint-selection problem: determining a minimum set of UAV waypoints that provides at least threefold coverage of every potential target location. We formulate this task as an extended k-coverage problem that independently defines the UAV-navigable and target regions, and derive an exact-penalty quadratic unconstrained binary optimization (QUBO) formulation with a sufficient penalty condition that preserves feasibility and minimum waypoint cardinality. The QUBO is mapped to an Ising-form cost Hamiltonian and evaluated using the quantum approximate optimization algorithm (QAOA) on both a noise-free simulator and IBM's 127-qubit Eagle processor. On the tested simulator instances, QAOA recovers the known minimum-cardinality solutions. Across the rectangular hardware test cases, the mean 3-coverage ratio exceeded 95%. In the campus-scale evaluation, ten hardware executions achieved 99.3% mean 3-coverage with a 90% feasible-run rate, while the shortest feasible flight path was up to 37.0% shorter than those of the deterministic grid-based baselines. Additional comparisons with classical optimization and learning-based baselines are provided, together with computational and quantum-resource analyses for larger generated instances. These results establish an exact QUBO representation for RF-based SAR waypoint selection and characterize its implementation on current gate-based quantum hardware.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-03 in eess.SY).
Categorie arXiv: Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2609.01930 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T06:13:51.274Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).