Quantum Optimization for Access Point Selection Under Budget Constraint
Mohamed Khalil Brik, Ahmed Shokry, Moustafa Youssef

TL;DR
This paper presents a quantum annealing-based algorithm for access point selection in indoor localization, significantly reducing infrastructure needs and improving speed and accuracy over classical methods.
Contribution
It formulates AP selection as a QUBO problem and demonstrates a quantum approach that outperforms classical algorithms in speed and accuracy in large-scale 3D environments.
Findings
Reduces APs by 96.1% with minimal accuracy loss
Achieves 61x faster computation than classical methods
Improves floor localization accuracy to 73%
Abstract
Optimal Access Point (AP) selection is crucial for accurate indoor localization, yet it is constrained by budget, creating a trade-off between localization accuracy and deployment cost. Classical approaches to AP selection are often computationally expensive, hindering their application in large-scale 3D indoor environments. In this paper, we introduce a quantum APs selection algorithm under a budget constraint. The proposed algorithm leverages quantum annealing to identify the most effective subset of APs allowed within a given budget. We formulate the APs selection problem as a quadratic unconstrained binary optimization (QUBO) problem, making it suitable for quantum annealing solvers. The proposed technique can drastically reduce infrastructure requirements with a negligible impact on performance. We implement the proposed quantum algorithm and deploy it in a realistic 3D…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIndoor and Outdoor Localization Technologies · Robotics and Sensor-Based Localization · Sparse and Compressive Sensing Techniques
