20 September 2005 in Journal of Computational Physics
21 September 2021 in IEEE Transactions on Wireless Communications
Information freshness, which is characterized by a new performance metric called age of information (AoI), significantly influences decision making in numerous applications. In wireless sensor networks, unmanned aerial vehicle (UAV) has been widely adopted for fresh data collection. The key to applying UAV lies in UAV trajectory planning. Considering several fixed waypoints in UAV trajectory, the trajectory planning is an NP-hard combinatorial optimization problem, and is difficult to solve in practice. To well balance between the accuracy and efficiency, we propose an end-to-end AI-based framework in this paper to deal with the UAV trajectory planning within two stages. First, the hover positions of UAV and data transmission time are decided using a clustering module. Then, the AoI-minimal flight path is obtained through a neural trajectory solver. Compared with classic heuristic algorithms, the proposed AI-based framework achieves a smaller AoI with two orders of magnitude lower computational time. Besides, the proposed AI-based framework can be easily generalized to larger-scale scenarios (e.g., up to 2,000 sensor nodes) which cannot be solved by exact algorithms (e.g., dynamic programming) in a limited time. Moreover, the AI-based framework is comparable in accuracy with the commercial open-source solver Google OR-tools, but the efficiency is increased by 200%.
1 February 2008 in Journal of Scientific Computing
31 March 2009 in Journal of Scientific Computing
1 January 2019 in Journal of Scientific Computing
1 January 2009 in Networks and Heterogeneous Media
In this paper, we propose a tailored-finite-point method for a numerical simulation of the second order elliptic equation with discontinuous coefficients. Our finite point method has been tailored to some particular properties of the problem, then we can get the approximate solution with the same behaviors as that of the exact solution very naturally. Especially, in one-dimensional case, when the coefficients are piecewise linear functions, we can get the exact solution with only one point in each subdomain. Furthermore, the stability analysis and the uniform convergence analysis in the energy norm are proved. On the other hand, our computational complexity is only $\O(N)$ for $N$ discrete points. We also extend our method to two-dimensional problems.