Ruipeng Zhang

Dr. Ruipeng Zhang

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 November 2022 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
RZRuipeng Zhang
Ruipeng Zhang
YFYanxiang Feng
Yanxiang Feng
YYYikang Yang
Yikang Yang
XLXiaoling Li
Xiaoling Li
This study addresses the cooperative multi unmanned aerial vehicles task assignment problem (CMTAP) with temporally coupled constraints and aims to find a feasible assignment to minimize the equivalent distances of all tasks. We first present a mixed-integer linear programming model of CMTAP. To solve the undesirable deadlocks of CMTAP, a Petri net amender is constructed based on a candidate solution, and a deadlock-free solution is equivalent to a feasible transition sequence that can be fired sequentially in the corresponding amender. With this amender, we present a Petri net-based deadlock amending method (PDAM) with polynomial time complexity to convert a deadlocked solution into a deadlock-free solution. Also, a deadlock-free hybrid estimation of distribution algorithm (DHEDA) is developed for CMTAP by embedding PDAM into the original EDA. To further improve the solution quality, we establish a local exploitation method, and an adaptive operational probability is used to balance the computational burden and local exploitation ability. Then a match-up based reassignment method is proposed to cope with time-sensitive targets. Finally, extensive computational experiments demonstrate that PDAM is more effective at solving deadlocks than graph-based methods, particularly for large-scale CMTAP, and DHEDA outperforms existing algorithms when solving CMTAP.

14 September 2023 in Aerospace
Verified
Journal Article
Open access
PDF file
RZRuipeng Zhang
Ruipeng Zhang
YFYanxiang Feng
Yanxiang Feng
YYYikang Yang
Yikang Yang
XLXiaoling Li
Xiaoling Li
By enabling a satellite network with edge computing capabilities, satellite edge computing(SEC) provides users with a full range of computing service. In this paper, we construct a multi-objective optimization model for task offloading with data-dependent constraints in an SEC network and aim to achieve optimal tradeoffs among energy consumption, cost, and makespan. However, dependency constraints between tasks may lead to unexpected computational delays and even task failures in an SEC network. To solve this, we proposed a Petri-net-based constraint amending method with polynomial complexity and generated offloading results satisfying our constraints. For the multiple optimization objectives, a strengthened dominance relation sort was established to balance the convergence and diversity of nondominated solutions. Based on these, we designed a multi-objective wolf pack search (MOWPS) algorithm. A series of adaptive mechanisms was employed for avoiding additional computational overhead, and a Lamarckian-learning-based multi-neighborhood search prevents MOWPS from becoming trapped in the local optimum. Extensive computational experiments demonstrate the outperformance of MOWPS for solving task offloading with data-dependent constraints in an SEC network.

13 November 2024 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
RZRuipeng Zhang
Ruipeng Zhang
YFYanxiang Feng
Yanxiang Feng
YYYikang Yang
Yikang Yang
XLXiaoling Li
Xiaoling Li
HLHengnian Li
Hengnian Li
Satellite edge computing (SEC) is important for future network deployments because of its global coverage and low-latency computing services. Nevertheless, due to data dependencies among tasks and limited buffers in satellites, a coupling exists between transmission and computation, and undesired deadlocks may arise. This paper addresses task offloading in SEC and aims to minimize service latency, energy consumption, and time window violations simultaneously. First, a mixed-integer nonlinear programming model is presented. To resolve potential deadlocks, a deadlock amending algorithm (DAA) based on Petri net with polynomial time complexity is proposed. Deadlocks in solutions are amended by finding a transition sequence that corresponding transmission and computation can be performed sequentially. By embedding DAA, we develop a learning-based deadlock-free multi-objective scheduling algorithm (LDMOSA) that combines the exploration of evolutionary algorithms with the perception of reinforcement learning. To enhance the convergence and diversity of solutions, an initialization strategy employing problem-specific constructive heuristics is designed. Then, a learning-based mechanism is used to leverage real-time information to perform adaptive operator selection during the search process. Finally, extensive experiments demonstrate the effectiveness of DAA in resolving deadlocks, and the LDMOSA outperforms state-of-the-art algorithms for task offloading in SEC.

24 March 2023 in Remote Sensing
Verified
Journal Article
Open access
PDF file
YFYanxiang Feng
Yanxiang Feng
RZRuipeng Zhang
Ruipeng Zhang
SRSida Ren
Sida Ren
SZShuailin Zhu
Shuailin Zhu
YYYikang Yang
Yikang Yang
The increasing number of agile earth observation satellites (AEOSs) in orbit have advanced maneuverable capabilities, enabling the AEOS constellation to provide richer observation services. Therefore, observation scheduling in the AEOS constellation is crucial for improving the performance of satellite remote sensing systems. This paper focuses on the problem of distributed observation scheduling in the AEOS constellation, where a period of transition time is required between two consecutive observations, and this constraint depends on the start time of observations. We define a new fitness function that not only maximizes the profit sum but also considers system load balancing. Based on the fundamental idea of a distributed performance impact (PI) algorithm, we develop a PI-based distributed scheduling method (PIDSM) that runs concurrently on all AEOSs via local inter-satellite link (ISL)-based communications. The PIDSM iterates between two phases: target inclusion and consensus and target removal. The first phase aims to select the optimal task for each AEOS, while the second phase reaches a consensus over all AEOSs and removes targets that may decrease overall fitness. Experimental results demonstrate that the PIDSM can schedule more targets, reduce communication overhead, and achieve higher fitness values than existing algorithms. Sensitivity analyses further validate the effectiveness of the PIDSM.

18 September 2024 in Remote Sensing
Verified
Journal Article
Open access
PDF file
RZRuipeng Zhang
Ruipeng Zhang
YYYikang Yang
Yikang Yang
HLHengnian Li
Hengnian Li
Integrated communication–sensing–computing (ICSC) satellites, which integrate edge computing servers on Earth observation satellites to process collected data directly in orbit, are attracting growing attention. Nevertheless, some monitoring tasks involve sequential sub-tasks like target observation and movement prediction, leading to data dependencies. Moreover, the limited energy supply on satellites requires the sequential execution of sub-tasks. Therefore, inappropriate assignments can cause circular waiting among satellites, resulting in deadlocks. This paper formulates task offloading in ICSC satellites with data-dependent constraints as a mixed-integer linear programming (MILP) problem, aiming to minimize service latency and energy consumption simultaneously. Given the non-centrality of ICSC satellites, we propose a distributed deadlock-free task offloading (DDFTO) algorithm. DDFTO operates in parallel on each satellite, alternating between sub-task inclusion and consensus and sub-task removal until a common offloading assignment is reached. To avoid deadlocks arising from sub-task inclusion, we introduce the deadlock-free insertion mechanism (DFIM), which strategically restricts the insertion positions of sub-tasks based on interval relationships, ensuring deadlock-free assignments. Extensive experiments demonstrate the effectiveness of DFIM in avoiding deadlocks and show that the DDFTO algorithm outperforms benchmark algorithms in achieving deadlock-free offloading assignments.

16 June 2024 in Remote Sensing
Verified
Journal Article
Open access
PDF file
RZRuipeng Zhang
Ruipeng Zhang
YFYanxiang Feng
Yanxiang Feng
YYYikang Yang
Yikang Yang
XLXiaoling Li
Xiaoling Li
HLHengnian Li
Hengnian Li
Satellite edge computing (SEC) plays an increasing role in earth observation, due to its global coverage and low-latency computing service. In SEC, it is pivotal to offload diverse observation-data-processing tasks to the appropriate satellites. Nevertheless, due to the sparse intersatellite link (ISL) connections, it is hard to gather complete information from all satellites. Moreover, the dynamic arriving tasks will also influence the obtained offloading assignment. Therefore, one daunting challenge in SEC is achieving optimal offloading assignments with consideration of the dynamic delay-sensitive tasks. In this paper, we formulate task offloading in SEC with delay-sensitive tasks as a mixed-integer linear programming problem, aiming to minimize the weighted sum of deadline violations and energy consumption. Due to the limited ISLs, we propose a fully-decentralized method, called the PI-based task offloading (PITO) algorithm. The PITO operates on each satellite in parallel and only relies on local communication via ISLs. Tasks can be directly offloaded on board without depending on any central server. To further handle the dynamic arriving tasks, we propose a re-offloading mechanism based on the match-up strategy, which reduces the tasks involved and avoids unnecessary insertion attempts by pruning. Finally, extensive experiments demonstrate that PITO outperforms state-of-the-art algorithms when solving task offloading in SEC, and the proposed re-offloading mechanism is significantly more efficient than existing methods.