4.7 Article

Placing Wireless Chargers With Limited Mobility

Journal

IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 22, Issue 6, Pages 3589-3603

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TMC.2021.3136967

Keywords

Placement; directional charging; limited mobility; wireless power transfer; approximation algorithm

Ask authors/readers for more resources

This paper studies the dependence of charging efficiency on initial deployment positions of chargers under the one-to-many charging pattern. The goal is to maximize the overall charging utility for a set of static rechargeable devices on a 2D plane by determining deployment positions, stop positions and orientations, and portions of time for all deployed chargers that can move in a limited area after their deployment. It proposes a (1/2 - epsilon)-approximation algorithm to address the problem.
Several recent works have studied mobile charging under the one-to-many charging pattern where a single charger can charge multiple devices simultaneously. However, most of them focus on path planning and charging time allocation, but overlook the underlying dependence of the charging efficiency on initial deployment positions of chargers. This paper studies the problem of Placing directional wIreless chargers with Limited mObiliTy (PILOT), that is, maximize the overall charging utility for a set of static rechargeable devices on a 2D plane by determining deployment positions, stop positions and orientations, and portions of time for all deployed chargers that can move in a limited area after their deployment. To the best of our knowledge, we are the first to study placement of mobile directional chargers under the one-to-many pattern. To address PILOT, we propose a (1/2 - epsilon)-approximation algorithm. First, we present a method to approximate nonlinear charging power of chargers, and further propose an approach to construct Maximal Covered Set uniform subareas to reduce the infinite continuous search space for stop positions and orientations to a finite discrete one. Second, we present geometrical techniques to further reduce the infinite solution space for candidate deployment positions to a finite one without performance loss, and transform PILOT to a mixed integer nonlinear programming problem. Finally, we propose a linear programming based greedy algorithm to address it. Simulation and experimental results show that our algorithm outperforms six comparison algorithms by 19.74% similar to 500.01%.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available