Bounded Positioning Problem via Bluetooth

Indoor positioning via Bluetooth beacon has been widely applied under the promotion of Google, Apple, and other companies, but it is still difficult to solve large-scale and high-precision positioning problems efficiently. Due to information security, anti-interference and other concerns, bounded positioning which keeps the positioning signals in range and achieves desired accuracy is promising in application. The integer linear programming method for solving bounded positioning problems is investigated in detail in this paper. It is proved that the large-scale positioning problem can be decomposed into several independent bounded positioning problems and the sub-optimal solutions can be obtained quickly. Finally, the performance of the solutions in terms of beacon consumption and running time is verified by simulation.