Content area

Abstract

We address a combinatorial optimization problem to determine the placement of a predefined number of sensors from multiple candidate positions, aiming to maximize information acquisition with the minimum number of sensors. Assuming that the data from predefined candidates of sensor placements follow a multivariate normal distribution, we defined mutual information (MI) between the data from selected sensor positions and the data from the others as an objective function, and formulated it in a Quadratic Unconstrainted Binary Optimization (QUBO) problem by using a method we proposed. As an example, we calculated optimal solutions of the objective functions for 3 candidates of sensor placements using a quantum annealing machine, and confirmed that the results obtained were reasonable. The formulation method we proposed can be applied to any number of sensors, and it is expected that the advantage of quantum annealing emerges as the number of sensors increases.

Details

1009240
Title
Quadratic Formulation of Mutual Information for Sensor Placement Optimization using Ising and Quantum Annealing Machines
Publication title
arXiv.org; Ithaca
Publication year
2024
Publication date
Oct 15, 2024
Section
Quantum Physics
Publisher
Cornell University Library, arXiv.org
Source
arXiv.org
Place of publication
Ithaca
Country of publication
United States
University/institution
Cornell University Library arXiv.org
e-ISSN
2331-8422
Source type
Working Paper
Language of publication
English
Document type
Working Paper
Publication history
 
 
Online publication date
2024-10-16
Milestone dates
2024-07-20 (Submission v1); 2024-10-15 (Submission v2)
Publication history
 
 
   First posting date
16 Oct 2024
ProQuest document ID
3083765438
Document URL
https://www.proquest.com/working-papers/quadratic-formulation-mutual-information-sensor/docview/3083765438/se-2?accountid=208611
Full text outside of ProQuest
Copyright
© 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2024-10-17
Database
ProQuest One Academic