Shengpeng Chen

dblp:372/9067 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Software-defined and programmable networks · 46% Edge and fog computing · 46% Cellular and mobile networks · 7%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Edge and fog computing
mobile edge computing
1.012026
Adaptive Orchestration of Service Function Chains in SAGIN-MEC via Graph Reinforcement Learning · IEEE Trans. Mob. Comput. 2026
Software-defined and programmable networks › network function virtualization
service function chain deployment
1.012026
Adaptive Orchestration of Service Function Chains in SAGIN-MEC via Graph Reinforcement Learning · IEEE Trans. Mob. Comput. 2026
Software-defined and programmable networks › network function virtualization
service function chaining
1.012026
Adaptive Orchestration of Service Function Chains in SAGIN-MEC via Graph Reinforcement Learning · IEEE Trans. Mob. Comput. 2026
Edge and fog computing › service provisioning
VNF placement and routing
1.012026
Adaptive Orchestration of Service Function Chains in SAGIN-MEC via Graph Reinforcement Learning · IEEE Trans. Mob. Comput. 2026
Cellular and mobile networks › 6g
space-air-ground integrated network
0.312026
Adaptive Orchestration of Service Function Chains in SAGIN-MEC via Graph Reinforcement Learning · IEEE Trans. Mob. Comput. 2026

Methods — techniques the papers use, named apart from their topics

proximal policy optimization · 1.0graph reinforcement learning · 1.0graph convolution · 1.0
YearPublicationVenuePosition
2026 Adaptive Orchestration of Service Function Chains in SAGIN-MEC via Graph Reinforcement Learning
abstract
Space-air-ground integrated networks (SAGINs) augmented with mobile edge computing (MEC) provide a unified yet heterogeneous substrate for latency-sensitive services. Deploying service function chains (SFCs) over satellites, aerial platforms, and ground nodes, however, is difficult due to hierarchical resource heterogeneity, time-varying network states, and stringent end-to-end (E2E) delay requirements. In this paper, we study online SFC embedding in a three-layer SAGIN-MEC architecture under coupled computing and networking constraints. We model the deployment as a two-stage process: (i) placing each virtual network function (VNF) onto feasible nodes subject to computing-capacity constraints, and (ii) mapping inter-VNF traffic onto feasible paths subject to bandwidth and delay constraints. To achieve adaptive decisions under dynamic states, we cast the problem as graph reinforcement learning by jointly encoding the substrate topology and each SFC into a unified graph state, and propose a structure-aware PPO agent that combines graph convolution with domain features and an action-masking mechanism to eliminate infeasible placement/routing actions. Extensive experiments in dynamic large-scale scenarios show that the proposed method consistently outperforms competitive baselines, improving the acceptance rate by 6.991% under high load, reducing the average E2E delay by 13.556%, and increasing the long-term revenue-to-cost ratio by 27.763% on average.
Peiying Zhang 0001, Shengpeng Chen, Jian Fan, Lizhuang Tan, Chunxiao Jiang
IEEE Trans. Mob. Comput.2
2024 Fast LS Image Matching and Vision-Based DIG Measurement for LSM's Positioning
abstract
Linear servomotors (LSM) are widely used in industries. A LSM requires a mover positioning tool for precise control. A Vision-based digital image grating (DIG) measurement for LSM mover positioning is proposed in this study with advantages of simple system, low cost, and good robustness to environments. It estimates the LSM's rough position according to four mark-lines and obtains accurate LSM's positions by a fast least-square (FLS) image-matching algorithm. As a result, it can measure the LSM's position accurately in a wide range. The FLS proposed here represents the least-square cost function by the transformation parameters explicitly, and then calculates the parameters directly. Therefore, the image resampling process, which is inevitable for the existing least-square methods is not necessary. Simulations prove that the FLS is approximately 4.4 times faster than the classic inverse compositional Gauss–Newton (IC-GN) algorithm, and that the FLS is more accurate and robust than the IC-GN. Experiments show that the proposed DIG method can measure the LSM mover positions with an accuracy of 0.75μm mean absolute error.
Jianting Mai, Shengpeng Chen, Chenghao Ning, Lijun Zhong
IEEE Trans. Ind. Informatics3
2024 Keypoints Filtrating Nonlinear Refinement in Spatial Target Pose Estimation with Deep Learning
abstract
Spatial target pose estimation with deep learning has garnered increasing attention in recent years. However, the existing methods in this field suffer from poor generalization. In this study, we propose a robust and reliable pose estimation method for spatial targets. The method aims to achieve keypoints filtrating. It involves a detection network tasked with identifying the target area, while the subsequent stage employs a classification network to regress keypoints from the detected target area. To improve the accuracy of pose estimation, we leverage spatial target geometric constraints to formulate 2-D–3-D keypoints equations for an initial pose. Then, we create a nonlinear optimization equation based on the confidence of 2-D keypoints and accomplish nonlinear refinement. We conduct extensive experiments on commonly used datasets and demonstrate the effectiveness of the proposed method. Furthermore, thanks to the effectiveness of keypoints filtrating and nonlinear refinement, the proposed method is robust with challenging scenarios and domain bias.
Lijun Zhong, Shengpeng Chen, Zhi Jin 0002, Pengyu Guo
IEEE Trans. Ind. Informatics2