Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Trajectory-aware multi-agent cooperative task offloading method for vehicular edge computing
Chenyang WANG, Xiaoyu SHI, Jie GAN, Mingsheng SHANG
Journal of Computer Applications    2026, 46 (9): 2910-2919.   DOI: 10.11772/j.issn.1001-9081.2025080966
Abstract4)   HTML0)    PDF (1209KB)(8)       Save

In Vehicular Edge Computing (VEC) environments, the high mobility and uneven distribution of vehicles often lead to cross-domain task offloading failures and load imbalance of RoadSide Units (RSUs), thereby degrading system performance significantly. The existing studies mainly focus on load balance or single-step offloading decisions, while failing to address the communication uncertainties caused by vehicle mobility and the requirement for flexible task scheduling across RSUs, which limits offloading efficiency. Therefore, a Trajectory-Aware Collaborative Multi-Agent Reinforcement Learning (TAC-MARL) method was proposed. First, foresighted mobility awareness for task scheduling was realized through introducing a Patch Time Series Transformer (PatchTST) -based multi-step vehicle trajectory prediction module to guide task scheduling. Second, a vehicle-edge-cloud collaborative task offloading framework was constructed, in which vehicles and RSUs were modeled as agent groups, cooperative decision-making was performed by the employment of a reinforcement learning paradigm — Centralized Training and Decentralized Execution (CTDE), and a partially reward-decoupled multi-agent policy optimization method was designed to improve cooperation efficiency and system stability. Simulations under varying task densities, latency constraints, and network topologies were conducted. The proposed method consistently outperforms baseline algorithms such as Independent Proximal Policy Optimization (IPPO), Multi-Agent Deep Deterministic Policy Gradient (MADDPG), and Multi-Agent Proximal Policy Optimization (MAPPO) in task completion rate and task completion latency, verifying the efficiency, robustness, and practical potential of the proposed method in dynamic and complex VEC environments.

Table and Figures | Reference | Related Articles | Metrics
Fast image registration algorithm based on locally significant edge feature
YANG Jian LI Ruonan HUANG Chenyang WANG Gang DING Chuang
Journal of Computer Applications    2014, 34 (1): 149-153.   DOI: 10.11772/j.issn.1001-9081.2014.01.0149
Abstract908)      PDF (889KB)(758)       Save
Considering that the Scale Invariant Feature Transform (SIFT) algorithm extracts a great number of feature points, consumes a lot of matching time but with low matching accuracy, a fast image registration algorithm based on local significant edge features was proposed. Then SIFT algorithm was used to extract feature points, while wavelet edge detection was also used to extract image edge to establish feature points around the edge of the neighborhood characteristics, which filtered out points with a significant edge feature characteristic as significant feature points. A feature vector was formed by the shape-context operator and edge features. Euclidean distance was used as the match metric function to preliminarily match the feature points extracted from different images. Afterwards, RANdom SAmple Consensus (RANSAC) algorithm was applied to eliminate the mismatching points. The experimental results show that the algorithm effectively controlled the number of feature points, improved qulity of the feature points, reduced the feature search space and enhanced the efficiency of the feature matching.
Related Articles | Metrics