CHCancan He

Cancan He

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Cancan He has a total of 8 co-authors. Here are the top co-authors by number of shared publications:

  • Zhengying Cai

    Hubei Province Engineering Technology Research Center for Construction Quality Testing Equipment, College of Computer and Information Technology, China Three Gorges University, Yichang 443002, China

    2 shared publications
  • Guoqiang Gong

    Hubei Province Engineering Technology Research Center for Construction Quality Testing Equipments, College of Computer and Information Technology, China Three Gorges University, Yichang 443002, China

    1 shared publication
  • Huiyan Deng

    Hubei Province Engineering Technology Research Center for Construction Quality Testing Equipment, College of Computer and Information Technology, China Three Gorges University, Yichang 443002, China

    1 shared publication
  • Shulan Huang

    Hubei Province Engineering Technology Research Center for Construction Quality Testing Equipment, College of Computer and Information Technology, China Three Gorges University, Yichang 443002, China

    1 shared publication
  • Xinfei Dou

    Hubei Province Engineering Technology Research Center for Construction Quality Testing Equipment, College of Computer and Information Technology, China Three Gorges University, Yichang 443002, China

    1 shared publication
  • Yingjing Fang

    Hubei Province Engineering Technology Research Center for Construction Quality Testing Equipment, College of Computer and Information Technology, China Three Gorges University, Yichang 443002, China

    1 shared publication

Latest Publications

  • Open Access

    An Artificial Plant Community with a Random-Pairwise Single-Elimination Tournament System for Conflict-Free Human–Machine Collaborative Manufacturing in Industry 5.0

    by Zhengying Cai, Xinfei Dou, Cancan He, Huiyan Deng, Zhen Liu

    Human–machine collaborative manufacturing plays an important role in emerging Industry 5.0 and smart manufacturing. However, addressing the conflict-free human–machine collaborative manufacturing problem (CHMCMP) is extremely challenging because the cooperation and conflict between humans and machines are closely intertwined. This article examines the CHMCMP within the context of integrating the flexible job-shop scheduling problem (FJSP) and the flow-shop scheduling problem (FSP). Firstly, the CHMCMP was modeled as a job-flow-shop scheduling problem (JFSP), where machine processing is an FJSP and human operation is an FSP. Our goal is to complete all manufacturing jobs while pursuing multi-objective optimization, i.e., high manufacturing performance, conflict-free human–machine collaboration, and low no-load energy consumption. Secondly, an improved artificial plant community (APC) algorithm was developed to solve the NP-hard problem. A random-pairwise single-elimination tournament system is introduced for elite selection, with a time complexity of O(S) linearly correlated with the population size (S), superior to the sorting-based elite selection used by most evolutionary algorithms with polynomial time complexity, i.e., O(S3) of the genetic algorithm (GA) and O(S2) of the non-dominated sorting genetic algorithm-II (NSGA-II). Thirdly, a medium-scale benchmark dataset was exploited according to a human–machine collaborative manufacturing scenario. The Gantt charts of machine processing and human operating reveal that the FJSP and the FSP are entangled and are interdependent on each other in the CHMCMP, and solving FJSP and FSP separately cannot eliminate the conflict between the two. Compared with other state-of-the-art algorithms, the APC algorithm improves the makespan by up to 11.38%, the total transfer time of humans by up to 14.09%, and the no-loaded processing energy consumption by up to 12.62% with conflict avoidance.

  • Open Access

    A Heuristic Approach to Minimize Age of Information for Wirelessly Charging Unmanned Aerial Vehicles in Unmanned Data Collection Systems

    by Zhengying Cai, Yingjing Fang, Zeya Liu, Cancan He, Shulan Huang, Guoqiang Gong

    Wirelessly charging unmanned aerial vehicles (WCUAVs) can complete charging tasks without human intervention and may help us efficiently collect various types of geographically dispersed data in unmanned data collection systems (UDCSs). However, the limited number of wireless charging stations and longer wireless charging times also pose challenges to minimizing the Age of Information (AoI). Here, we provide a heuristic method to minimize AoI for WCUAVs. Firstly, the problem of minimizing AoI is modeled as a trajectory optimization problem with nonlinear constraints involving n sensor nodes, a data center, and a limited number of wireless charging stations. Secondly, to solve this NP-hard problem, an improved artificial plant community (APC) approach is proposed, including a single-WCUAV architecture and a multi-WCUAV architecture. Thirdly, a benchmark test set is designed, and benchmark experiments are conducted. When the number of WCUAVs increased from 1 to 2, the total flight distance increased by 12.011% and the average AoI decreased by 45.674%. When the number of WCUAVs increased from 1 to 10, the total flight distance increased by 87.667% and the average AoI decreased by 78.641%. The experimental results show that the proposed APC algorithm can effectively solve AoI minimization challenges of WCUAVs and is superior to other baseline algorithms with a maximum improvement of 9.791% in average AoI. Due to its simple calculation and efficient solution, it is promising to deploy the APC algorithm on the edge computing platform of WCUAVs.