Fan Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Fan Wu has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
- Kenli Li
Hunan University
8 shared publications - Yunchuan Qin
Hunan University
4 shared publications - Keqin Li
Hunan University
3 shared publications - Zhuo Tang
Hunan University
3 shared publications - Chao Tang
College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, CHINA
2 shared publications - Juan Liu
College of Information Science and Electronic Engineering, Hunan University, Changsha, China
2 shared publications
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28, 15718-15732
SimiCache: Rethinking KV Cache Compression via Token Similarity for MLLMs
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28, 15718-15732
SimiCache: Rethinking KV Cache Compression via Token Similarity for MLLMs
- Open Access
- 28 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 75809-75817
Dynamic Demand-Aware Power Grid Intelligent Pricing Algorithm Based on Deep Reinforcement Learning
The increasing integration of renewable energy sources and the growing complexity of modern power grids demand innovative solutions for efficient energy management. This paper introduces a novel dynamic demand-aware Power Grid Intelligent Pricing (PGIP) algorithm based on Deep Reinforcement Learning (DRL). The proposed PGIP algorithm aims to optimize energy consumption and pricing in real time by leveraging the capabilities of DRL to adapt to dynamic demand patterns and evolving grid conditions. PGIP employs a sophisticated neural network architecture to model the intricate relationships between various grid parameters, user demand, and pricing strategies. Through continuous learning and adaptation, the algorithm dynamically adjusts pricing structures to incentivize demand-side flexibility while ensuring grid stability. The reinforcement learning framework enables the algorithm to discover optimal policies for pricing in response to changing environmental factors and user behaviors. We used real-world data sets to assess its performance in diverse scenarios. Results demonstrate the algorithm’s ability to optimize energy consumption, reduce peak demand, and enhance overall grid efficiency. Moreover, comparisons with traditional pricing models highlight the superior adaptability and responsiveness of PGIP in addressing the challenges posed by the evolving landscape of power grids. PGIP presents a promising approach to address the dynamic nature of power grids and the increasing demand for efficient energy management.
- 28 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 75809-75817
Open AccessDynamic Demand-Aware Power Grid Intelligent Pricing Algorithm Based on Deep Reinforcement Learning
The increasing integration of renewable energy sources and the growing complexity of modern power grids demand innovative solutions for efficient energy management. This paper introduces a novel dynamic demand-aware Power Grid Intelligent Pricing (PGIP) algorithm based on Deep Reinforcement Learning (DRL). The proposed PGIP algorithm aims to optimize energy consumption and pricing in real time by leveraging the capabilities of DRL to adapt to dynamic demand patterns and evolving grid conditions. PGIP employs a sophisticated neural network architecture to model the intricate relationships between various grid parameters, user demand, and pricing strategies. Through continuous learning and adaptation, the algorithm dynamically adjusts pricing structures to incentivize demand-side flexibility while ensuring grid stability. The reinforcement learning framework enables the algorithm to discover optimal policies for pricing in response to changing environmental factors and user behaviors. We used real-world data sets to assess its performance in diverse scenarios. Results demonstrate the algorithm’s ability to optimize energy consumption, reduce peak demand, and enhance overall grid efficiency. Moreover, comparisons with traditional pricing models highlight the superior adaptability and responsiveness of PGIP in addressing the challenges posed by the evolving landscape of power grids. PGIP presents a promising approach to address the dynamic nature of power grids and the increasing demand for efficient energy management.
- Open Access
An Improved CNN-BILSTM Model for Power Load Prediction in Uncertain Power Systems
Power load prediction is fundamental for ensuring the reliability of power grid operation and the accuracy of power demand forecasting. However, the uncertainties stemming from power generation, such as wind speed and water flow, along with variations in electricity demand, present new challenges to existing power load prediction methods. In this paper, we propose an improved Convolutional Neural Network–Bidirectional Long Short-Term Memory (CNN-BILSTM) model for analyzing power load in systems affected by uncertain power conditions. Initially, we delineate the uncertainty characteristics inherent in real-world power systems and establish a data-driven power load model based on fluctuations in power source loads. Building upon this foundation, we design the CNN-BILSTM model, which comprises a convolutional neural network (CNN) module for extracting features from power data, along with a forward Long Short-Term Memory (LSTM) module and a reverse LSTM module. The two LSTM modules account for factors influencing forward and reverse power load timings in the entire power load data, thus enhancing model performance and data utilization efficiency. We further conduct comparative experiments to evaluate the effectiveness of the proposed CNN-BILSTM model. The experimental results demonstrate that CNN-BILSTM can effectively and more accurately predict power loads within power systems characterized by uncertain power generation and electricity demand. Consequently, it exhibits promising prospects for industrial applications.
Open AccessAn Improved CNN-BILSTM Model for Power Load Prediction in Uncertain Power Systems
Power load prediction is fundamental for ensuring the reliability of power grid operation and the accuracy of power demand forecasting. However, the uncertainties stemming from power generation, such as wind speed and water flow, along with variations in electricity demand, present new challenges to existing power load prediction methods. In this paper, we propose an improved Convolutional Neural Network–Bidirectional Long Short-Term Memory (CNN-BILSTM) model for analyzing power load in systems affected by uncertain power conditions. Initially, we delineate the uncertainty characteristics inherent in real-world power systems and establish a data-driven power load model based on fluctuations in power source loads. Building upon this foundation, we design the CNN-BILSTM model, which comprises a convolutional neural network (CNN) module for extracting features from power data, along with a forward Long Short-Term Memory (LSTM) module and a reverse LSTM module. The two LSTM modules account for factors influencing forward and reverse power load timings in the entire power load data, thus enhancing model performance and data utilization efficiency. We further conduct comparative experiments to evaluate the effectiveness of the proposed CNN-BILSTM model. The experimental results demonstrate that CNN-BILSTM can effectively and more accurately predict power loads within power systems characterized by uncertain power generation and electricity demand. Consequently, it exhibits promising prospects for industrial applications.
- Open Access
- 11 March 2024
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 17 (1) , 1-18
Optimizing Placement and Scheduling for VNF by a Multi-objective Optimization Genetic Algorithm
Virtual network functions (VNFs) have gradually replaced the implementation of traditional network functions. Through efficient placement, the VNF placement technology strives to operate VNFs consistently to the greatest extent possible within restricted resources. Thus, VNF mapping and scheduling tasks can be framed as an optimization problem. Existing research efforts focus only on optimizing the VNFs scheduling or mapping. Besides, the existing methods focus only on one or two objectives. In this work, we proposed addressing the problem of VNFs scheduling and mapping. This work proposed framing the problem of VNFs scheduling and mapping as a multi-objective optimization problem on three objectives, namely (1) minimizing line latency of network link, (2) reducing the processing capacity of each virtual machine, and (3) reducing the processing latency of virtual machines. Then, the proposed VNF-NSGA-III algorithm, an adapted variation of the NSGA-III algorithm, was used to solve this multi-objective problem. Our proposed algorithm has been thoroughly evaluated through a series of experiments on homogeneous and heterogeneous data center environments. The proposed method was compared to several heuristic and recent meta-heuristic methods. The results reveal that the VNF-NSGA-III outperformed the comparison methods.
- 11 March 2024
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 17 (1) , 1-18
Open AccessOptimizing Placement and Scheduling for VNF by a Multi-objective Optimization Genetic Algorithm
Virtual network functions (VNFs) have gradually replaced the implementation of traditional network functions. Through efficient placement, the VNF placement technology strives to operate VNFs consistently to the greatest extent possible within restricted resources. Thus, VNF mapping and scheduling tasks can be framed as an optimization problem. Existing research efforts focus only on optimizing the VNFs scheduling or mapping. Besides, the existing methods focus only on one or two objectives. In this work, we proposed addressing the problem of VNFs scheduling and mapping. This work proposed framing the problem of VNFs scheduling and mapping as a multi-objective optimization problem on three objectives, namely (1) minimizing line latency of network link, (2) reducing the processing capacity of each virtual machine, and (3) reducing the processing latency of virtual machines. Then, the proposed VNF-NSGA-III algorithm, an adapted variation of the NSGA-III algorithm, was used to solve this multi-objective problem. Our proposed algorithm has been thoroughly evaluated through a series of experiments on homogeneous and heterogeneous data center environments. The proposed method was compared to several heuristic and recent meta-heuristic methods. The results reveal that the VNF-NSGA-III outperformed the comparison methods.
- 29 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (11) , 7201-7216
Trajectory-Aware Task Coalition Assignment in Spatial Crowdsourcing
With the popularity of GPS-equipped smart devices, spatial crowdsourcing (SC) techniques have attracted growing attention in both academia and industry. A fundamental problem in SC is assigning location-based tasks to workers under spatial-temporal constraints. In many real-life applications, workers choose tasks on the basis of their preferred trajectories. However, by existing trajectory-aware task assignment approaches, tasks assigned to a worker may be far apart from each other, resulting in a higher detour cost as the worker needs to deviate from the original trajectory more often than necessary. Motivated by the above observations, we investigate a trajectory-aware task coalition assignment (TCA) problem and prove it to be NP-hard. The goal is to maximize the number of assigned tasks by assigning task coalitions to workers based on their preferred trajectories. For tackling the TCA problem, we develop a batch-based three-stage framework consisting of task grouping, planning, and assignment. First, we design greedy and spanning grouping approaches to generate task coalitions. Second, to gain candidate task coalitions for each worker efficiently, we design task-based and trajectory-based pruning strategies to reduce the search space. Furthermore, a 2-approximate algorithm, termed MST-Euler, is proposed to obtain a route among each worker and task coalition with a minimal detour cost. Third, the MST-Euler Greedy (MEG) algorithm is presented to compute an assignment that results in the maximal number of tasks assigned and a parallel strategy is introduced to boost its efficiency. Extensive experiments on real and synthetic datasets demonstrate the effectiveness and efficiency of the proposed algorithms.
- 29 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (11) , 7201-7216
Trajectory-Aware Task Coalition Assignment in Spatial Crowdsourcing
With the popularity of GPS-equipped smart devices, spatial crowdsourcing (SC) techniques have attracted growing attention in both academia and industry. A fundamental problem in SC is assigning location-based tasks to workers under spatial-temporal constraints. In many real-life applications, workers choose tasks on the basis of their preferred trajectories. However, by existing trajectory-aware task assignment approaches, tasks assigned to a worker may be far apart from each other, resulting in a higher detour cost as the worker needs to deviate from the original trajectory more often than necessary. Motivated by the above observations, we investigate a trajectory-aware task coalition assignment (TCA) problem and prove it to be NP-hard. The goal is to maximize the number of assigned tasks by assigning task coalitions to workers based on their preferred trajectories. For tackling the TCA problem, we develop a batch-based three-stage framework consisting of task grouping, planning, and assignment. First, we design greedy and spanning grouping approaches to generate task coalitions. Second, to gain candidate task coalitions for each worker efficiently, we design task-based and trajectory-based pruning strategies to reduce the search space. Furthermore, a 2-approximate algorithm, termed MST-Euler, is proposed to obtain a route among each worker and task coalition with a minimal detour cost. Third, the MST-Euler Greedy (MEG) algorithm is presented to compute an assignment that results in the maximal number of tasks assigned and a parallel strategy is introduced to boost its efficiency. Extensive experiments on real and synthetic datasets demonstrate the effectiveness and efficiency of the proposed algorithms.
- 20 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 43 (2) , 404-416
NGLIC: A Nonaligned-Row Legalization Approach for 3-D Interdie Connection
3-D placement is an important stage in 3-D physical synthesis. In addition to the need to place the standard cells or Macros inside the die, the placement of interdie connections also needs to be considered. As the density of the interdie connections gradually increases, their placement becomes more critical. However, unlike standard cells, the interdie connection does not need to be aligned into rows, which leads to a larger legalization solution space. Legalization aims at minimizing the total and maximum displacement to maintain the quality of global placement on the premise of no violation of the physical circuit constraint. In this article, we propose a two-stage legalization approach (NGLIC) for nonaligned-row interdie connections. In the initial stage, a single-row height legalization algorithm is used for dense placement. Afterward, the unequal multirow height legalization (UML) is designed for sparse placement in the post-optimization stage. A pruning scheme is adopted to identify and eliminate redundant computations. The performance, effectiveness, and configuration are analyzed empirically based on ICCAD 2022 benchmarks. Compared to the state-of-the-art multirow or single-row height legalization, our approach outperforms well-known algorithms, such as multirow global legalization (MGL) and Abacus by at least 24% averaged total displacement, 3% averaged maximum displacement, and 31% averaged HPWL Growth. Our case study also illustrates the effectiveness of UML and NGLIC. In addition, the effectiveness of pruning is also validated by experiments that show savings of 33% redundant computations.
- 20 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 43 (2) , 404-416
NGLIC: A Nonaligned-Row Legalization Approach for 3-D Interdie Connection
3-D placement is an important stage in 3-D physical synthesis. In addition to the need to place the standard cells or Macros inside the die, the placement of interdie connections also needs to be considered. As the density of the interdie connections gradually increases, their placement becomes more critical. However, unlike standard cells, the interdie connection does not need to be aligned into rows, which leads to a larger legalization solution space. Legalization aims at minimizing the total and maximum displacement to maintain the quality of global placement on the premise of no violation of the physical circuit constraint. In this article, we propose a two-stage legalization approach (NGLIC) for nonaligned-row interdie connections. In the initial stage, a single-row height legalization algorithm is used for dense placement. Afterward, the unequal multirow height legalization (UML) is designed for sparse placement in the post-optimization stage. A pruning scheme is adopted to identify and eliminate redundant computations. The performance, effectiveness, and configuration are analyzed empirically based on ICCAD 2022 benchmarks. Compared to the state-of-the-art multirow or single-row height legalization, our approach outperforms well-known algorithms, such as multirow global legalization (MGL) and Abacus by at least 24% averaged total displacement, 3% averaged maximum displacement, and 31% averaged HPWL Growth. Our case study also illustrates the effectiveness of UML and NGLIC. In addition, the effectiveness of pruning is also validated by experiments that show savings of 33% redundant computations.
- Top Cited PapersOpen Access
- 13 July 2023
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 55 (13s) , 1-36
Recent Trends in Task and Motion Planning for Robotics: A Survey
Autonomous robots are increasingly served in real-world unstructured human environments with complex long-horizon tasks, such as restaurant serving and office delivery. Task and motion planning (TAMP) is a recent research method in Artificial Intelligence Planning for these applications. TAMP integrates high-level abstract reasoning with the low-level geometric feasibility check and thus is more comprehensive than traditional task planning methods. While regular TAMP approaches are challenged by different types of uncertainties and the generalization of various applications when implemented in real-world scenarios. This article systematically reviews the most relevant approaches to TAMP and classifies them according to their features and emphasis; it categorizes the challenges and presents online TAMP and machine learning-based TAMP approaches for addressing them.
- 13 July 2023
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 55 (13s) , 1-36
Top Cited PapersOpen AccessRecent Trends in Task and Motion Planning for Robotics: A Survey
Autonomous robots are increasingly served in real-world unstructured human environments with complex long-horizon tasks, such as restaurant serving and office delivery. Task and motion planning (TAMP) is a recent research method in Artificial Intelligence Planning for these applications. TAMP integrates high-level abstract reasoning with the low-level geometric feasibility check and thus is more comprehensive than traditional task planning methods. While regular TAMP approaches are challenged by different types of uncertainties and the generalization of various applications when implemented in real-world scenarios. This article systematically reviews the most relevant approaches to TAMP and classifies them according to their features and emphasis; it categorizes the challenges and presents online TAMP and machine learning-based TAMP approaches for addressing them.
- 31 May 2023
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 35 (28)
A parallel game model‐based intrusion response system for cross‐layer security in industrial internet of things
Summary: With the rise of industrialization, the importance of the industrial Internet of Things (IIoT) has increased significantly, and with it comes a variety of security threats. Therefore, the security of these networks is critical. Industrial Response Systems (IRSs), as the last line of security, plays an important role in the security system of the Industrial Internet of Things. In this paper, a new IRS model based on the non‐cooperative game is proposed. First, by combining the Partially Observable Markov Decision Process (POMDP) model with the stochastic game model based on the expanded attack tree, our model could effectively perceive the changes at each node. Second, our model incorporates the alarms of intrusion detection system (IDS) and the physical quantities of sensors in Industrial Cyber‐Physical System (ICPS) into the quantization system so that the model can respond to intruders more accurately and comprehensively. Finally, we develop this model based on multiprocessors to speed up the solution process, and adopt an approximation algorithm to reduce the number of iterations of the POMDP
- 31 May 2023
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 35 (28)
A parallel game model‐based intrusion response system for cross‐layer security in industrial internet of things
Summary: With the rise of industrialization, the importance of the industrial Internet of Things (IIoT) has increased significantly, and with it comes a variety of security threats. Therefore, the security of these networks is critical. Industrial Response Systems (IRSs), as the last line of security, plays an important role in the security system of the Industrial Internet of Things. In this paper, a new IRS model based on the non‐cooperative game is proposed. First, by combining the Partially Observable Markov Decision Process (POMDP) model with the stochastic game model based on the expanded attack tree, our model could effectively perceive the changes at each node. Second, our model incorporates the alarms of intrusion detection system (IDS) and the physical quantities of sensors in Industrial Cyber‐Physical System (ICPS) into the quantization system so that the model can respond to intruders more accurately and comprehensively. Finally, we develop this model based on multiprocessors to speed up the solution process, and adopt an approximation algorithm to reduce the number of iterations of the POMDP
- 26 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 29 (1) , 2-15
Constrained Multiobjective Optimization With Escape and Expansion Forces
Constraints may scatter the Pareto optimal solutions of a constrained multiobjective optimization problem (CMOP) into multiple feasible regions. To avoid getting trapped in local optimal feasible regions or a part of the global optimal feasible regions, a constrained multiobjective evolutionary algorithm (CMOEA) should consider both the escape force and the expansion force carefully during the search process. However, most CMOEAs fail to provide these two forces effectively. As a remedy for this limitation, this article proposes a method called three-population evolutionary algorithm (TPEA). TPEA maintains three populations, termed Pop1, Pop2, and Pop3. Pop1 is a regular population, updated with a constrained NSGA-II variant. Pop2 and Pop3 are two auxiliary populations, containing the innermost and outermost nondominated infeasible solutions, respectively. The analysis reveals that these two types of nondominated infeasible solutions can contribute to the generation of escape and expansion forces, respectively. Due to these two forces, TPEA is likely to identify more global optimal feasible regions, which is crucial for constrained multiobjective optimization. Also, a mating selection strategy is developed in TPEA to coordinate the interaction among these three populations. Extensive experiments on 58 benchmark CMOPs and 35 real-world ones demonstrate that TPEA is significantly superior or comparable to six state-of-the-art CMOEAs on most test instances.
- 26 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 29 (1) , 2-15
Constrained Multiobjective Optimization With Escape and Expansion Forces
Constraints may scatter the Pareto optimal solutions of a constrained multiobjective optimization problem (CMOP) into multiple feasible regions. To avoid getting trapped in local optimal feasible regions or a part of the global optimal feasible regions, a constrained multiobjective evolutionary algorithm (CMOEA) should consider both the escape force and the expansion force carefully during the search process. However, most CMOEAs fail to provide these two forces effectively. As a remedy for this limitation, this article proposes a method called three-population evolutionary algorithm (TPEA). TPEA maintains three populations, termed Pop1, Pop2, and Pop3. Pop1 is a regular population, updated with a constrained NSGA-II variant. Pop2 and Pop3 are two auxiliary populations, containing the innermost and outermost nondominated infeasible solutions, respectively. The analysis reveals that these two types of nondominated infeasible solutions can contribute to the generation of escape and expansion forces, respectively. Due to these two forces, TPEA is likely to identify more global optimal feasible regions, which is crucial for constrained multiobjective optimization. Also, a mating selection strategy is developed in TPEA to coordinate the interaction among these three populations. Extensive experiments on 58 benchmark CMOPs and 35 real-world ones demonstrate that TPEA is significantly superior or comparable to six state-of-the-art CMOEAs on most test instances.
- 27 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (8) , 2336-2349
AAPP: An Accelerative and Adaptive Path Planner for Robots on GPU
Optimal path planning is one of the major bottlenecks for the effective navigation of robots working towards accomplishing complex missions. To overcome the bottleneck and support efficient applications, this paper presents AAPP , an accelerative and adaptive path planner based on RRT*, a popular path planning algorithm, on GPU, to alleviate four main performance limitations, i.e., bandwidth limitation, load imbalance, high computing complexity, and the choice of parameters. First, AAPP employs a data storage structure, named simplified compressed sparse rows (SCSR), to compress the large-scale map data and increase the utilization of bandwidth. Second, to exploit the computing performance of GPU, we propose a two-layer parallel framework for RRT* based on SCSR format, named TLRRT*, by using the dynamic parallelism technique. Third, aiming at the problems of parallel load imbalance and high computing complexity in TLRRT*, we further design a two-stage parallel framework, named TSRRT*, that fully exploits hardware heterogeneity (CPU/GPU) by scheduling tasks on CPU and GPU adaptively. Finally, we present optimizations for AAPP to adaptively select execution schemes and parameters. Experimental results on a heterogeneous CPU/GPU machine show that AAPP yields the speedup up to$22.72\times$ over the RRT* algorithm. Compared to the state-of-the-art, AAPP can handle large-scale datasets and obtain feasible solutions with shorter trajectory lengths.- 27 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (8) , 2336-2349
AAPP: An Accelerative and Adaptive Path Planner for Robots on GPU
Optimal path planning is one of the major bottlenecks for the effective navigation of robots working towards accomplishing complex missions. To overcome the bottleneck and support efficient applications, this paper presents AAPP , an accelerative and adaptive path planner based on RRT*, a popular path planning algorithm, on GPU, to alleviate four main performance limitations, i.e., bandwidth limitation, load imbalance, high computing complexity, and the choice of parameters. First, AAPP employs a data storage structure, named simplified compressed sparse rows (SCSR), to compress the large-scale map data and increase the utilization of bandwidth. Second, to exploit the computing performance of GPU, we propose a two-layer parallel framework for RRT* based on SCSR format, named TLRRT*, by using the dynamic parallelism technique. Third, aiming at the problems of parallel load imbalance and high computing complexity in TLRRT*, we further design a two-stage parallel framework, named TSRRT*, that fully exploits hardware heterogeneity (CPU/GPU) by scheduling tasks on CPU and GPU adaptively. Finally, we present optimizations for AAPP to adaptively select execution schemes and parameters. Experimental results on a heterogeneous CPU/GPU machine show that AAPP yields the speedup up to$22.72\times$ over the RRT* algorithm. Compared to the state-of-the-art, AAPP can handle large-scale datasets and obtain feasible solutions with shorter trajectory lengths.