Academia.eduAcademia.edu

SUMMARY OF THE ONLINE CHARGER DISPATCH STRATEGIES.  ocations for wireless chargers. Moreover, the order of ap- proximation has been theoretically characterized, under the condition that all the target sensors are evenly distributed. The authors also introduced a shifting strategy to prove the performance lower bound of the proposed partition algorithm.  However, there was no simulation evaluation to examine its performance.   where, it incurs an infinite number of constraints. The authors demonstrated that searching for the optimal activation set of chargers to maximize the overall charging throughput, under the imposed constraints, is NP-hard in general. By applying constraint conversion and constraint reduction techniques, the authors showed that the original problem can be transformed into two traditional problems, namely multidimensional 0/1 knapsack problem [341] and Fermat-Weber problem [342]. Then an approximation algorithm with provable near optimal- ity was proposed as a solution, which was shown to outperform a PSO-based heuristic algorithm by around 35%. However, the proposed solution is essentially centralized, which results in high complexity with the increase in number of chargers.

Table 7 SUMMARY OF THE ONLINE CHARGER DISPATCH STRATEGIES. ocations for wireless chargers. Moreover, the order of ap- proximation has been theoretically characterized, under the condition that all the target sensors are evenly distributed. The authors also introduced a shifting strategy to prove the performance lower bound of the proposed partition algorithm. However, there was no simulation evaluation to examine its performance. where, it incurs an infinite number of constraints. The authors demonstrated that searching for the optimal activation set of chargers to maximize the overall charging throughput, under the imposed constraints, is NP-hard in general. By applying constraint conversion and constraint reduction techniques, the authors showed that the original problem can be transformed into two traditional problems, namely multidimensional 0/1 knapsack problem [341] and Fermat-Weber problem [342]. Then an approximation algorithm with provable near optimal- ity was proposed as a solution, which was shown to outperform a PSO-based heuristic algorithm by around 35%. However, the proposed solution is essentially centralized, which results in high complexity with the increase in number of chargers.