Dongcheng Li

Dongcheng Li

Auto-generated profile, based on publicly available information

Dongcheng Li

Department of Computer Science, The University of Texas at Dallas, Richardson, TX, USA

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
18 August 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
FMFei Ming
Fei Ming
WGWenYin Gong
WenYin Gong
DLDongcheng Li
Dongcheng Li
LWLing Wang
Ling Wang
LGLiang Gao
Liang Gao
Solving multi-objective optimization problems through meta-heuristic methods gets considerable attention. Based on the classical variation operators, several enhanced operators, as well as multi-objective optimization evolutionary algorithms, have been developed. Among these operators, the competitive swarm optimizer exhibits promising performance. However, it encounters difficulties when tackling constrained multi-objective optimization problems with large objective spaces or complex infeasible regions. In this paper, a competitive and cooperative swarm optimizer is proposed, which contains two particle update strategies: i) the competitive swarm optimizer provides faster convergence speed to accelerate the approximation of the Pareto front; and ii) the cooperative swarm optimizer suggests a mutual-learning strategy to enhance the ability to jump out of local feasible regions or local optima. We also present a new algorithm for constrained multi-objective optimization problems. The results on four benchmark suites with 47 instances demonstrate the superiority of our approach compared with other state-of-the-art methods. Additionally, its effectiveness on large scale constrained multi-objective optimization problems has also been verified.

30 December 2021 in IEEE Access
Verified
Journal Article
Open access
DLDongcheng Li
Dongcheng Li
WYWangping Yin
Wangping Yin
WWW. Eric Wong
W. Eric Wong
MJMingyong Jian
Mingyong Jian
MCMatthew Chau
Matthew Chau
Unmanned aerial vehicles (UAVs) are playing an increasingly important role in people’s daily lives due to their low cost of operation, low requirements for ground support, high maneuverability, high environmental adaptability, and high safety. Yet UAV path planning under various safety risks, such as crash and collision, is not an easy task, due to the complicated and dynamic nature of path environments. Therefore, developing an efficient and flexible algorithm for UAV path planning has become inevitable. Aimed at quality-oriented UAV path planning, this paper is designed to analyze UAV path planning from two aspects: global static planning and local dynamic hierarchical planning. Through a theoretical and mathematical approach, a three-dimensional UAV path planning model was established. Based on the A* algorithm, the search strategy, the step size, and the cost function were improved, and the OPEN set was simplified, thereby shortening the planning time and greatly improving the execution efficiency of the algorithm. Moreover, a dynamic exploration factor was added to the exploration mechanism of Q-learning to solve the exploration-exploitation dilemma of Q-learning to adapt to the local dynamic path adjustment for UAVs. The global-local hybrid UAV path planning algorithm was formed by combining the two. The simulation results indicate that the proposed planning model and algorithm can efficiently solve the problem of UAV path planning, improve the path quality, and can be a significant reference for solving other problems related to path planning, such as the reliability, security, and safety of UAV, when embedded into the heuristic function of the proposed algorithm.

27 May 2021 in IEEE Access
Verified
Journal Article
Open access
MZMan Zhao
Man Zhao
DLDongcheng Li
Dongcheng Li
On the basis of investigating dynamic collaborative task allocation of heterogeneous multi-unmanned platform, a dynamic collaborative task allocation model was constructed to settle these problems in this paper. Moreover, the contract net algorithm was improved by means of mental coefficients, the blackboard model and the buffer pool mechanism; and a hybrid method of three modified contract net algorithms was applied to dynamic collaborative task allocation of heterogeneous multi-unmanned platform. As a result, not only is the task allocation efficiency raised, but outcomes of collaborative task allocation become more reasonable. As demonstrated by relevant laboratory findings, the corresponding performance is significantly boosted.

4 April 2022 in IEEE Access
Verified
Journal Article
Open access
DLDongcheng Li
Dongcheng Li
WWW. Eric Wong
W. Eric Wong
MJMingyong Jian
Mingyong Jian
YGYi Geng
Yi Geng
MCMatthew Chau
Matthew Chau
The challenge of automatically repairing bugs in programs to reduce debugging expenses and increase program quality is known as automated program repair. To overcome this issue, test-suite-based repair techniques use a specified test suite as an oracle and alter the input faulty program to pass the full test suite. GenProg is a well-known example of this kind of repair, in which genetic programming is used to reorder the statements already present in the faulty program. However, recent practical experiments suggest that GenProg’s performance, notably for Java, is not sufficient. Improved program dependability necessitates the use of automatic program repair techniques. Template-based program repair techniques have recently been combined with search-based techniques to solve program issues automatically. Although intriguing, it has two fundamental drawbacks: Its search space often lacks the correct solution, and the technique disregards program expertise, such as precise code language. Compared with the template-based program repair approach, existing neural-machine-translation-based approaches are not limited by these constraints due to their ability to learn and generate new solutions. We propose an approach that combines a search-based automatic program repair technique with a neural-machine-translation-based approach. More specifically, we use both redundancy assumption and sequence-to-sequence learning of correct patches as the source for potential fix statements that feed into a multiobjective evolutionary search algorithm to find test-suite-adequate patches. In this work, a novel framework called ARJANMT is introduced for automatically repairing Java programs. Two sets of controlled experiments are conducted on 410 bugs from two benchmarks to investigate the repairability and correctness of our proposed framework. A comparison between state-of-the-art automatic program repair frameworks is made. The experimental results indicate that combining those two types of repair techniques (search-based and neural-machine-translation-based) produces better results or fixes bugs that they previously were unable to fix individually.

16 August 2022 in IEEE Access
Verified
Journal Article
Open access
DLDongcheng Li
Dongcheng Li
WWW. Eric Wong
W. Eric Wong
SPSean Pan
Sean Pan
LKLiang-Seng Koh
Liang-Seng Koh
SLShenglong Li
Shenglong Li
MCMatthew Chau
Matthew Chau
Test case generation in essence is a many-objective optimization problem, with objectives such as program statements and branches. Currently, the DynaMOSA algorithm built on the EvoSuite framework simultaneously searches multiple objectives and eventually produces a test suite with high coverage for multiple testing criteria. However, its performance is undesirable in searching test cases when there are an excessive number of objectives. As the software structure becomes increasingly complex and the lines of program code increase, the high cost of testing limits the application of search-based automatic test case generation technology for software testing. To generate test cases with high coverage within a limited time, this paper proposes PCA-DynaMOSA to overcome the shortcomings of DynaMOSA, and the improvement in the proposed algorithm is due to dimensionality reduction. To carry out the experiments, 49 projects or 110 classes were selected from the SF110 benchmarking dataset according to the complexity and the number of objectives of the classes under test. The experimental results indicate that PCA-DynaMOSA outperforms DynaMOSA in generating test cases on most projects in terms of line, branch, mutation, and multi-criteria coverage. Moreover, it achieves higher or equivalent coverage and offers improved test case generation performance.

1 January 2022 in International Journal of Performability Engineering
Verified
Journal Article
Closed access
PDF file
CYCheng Yuting
Cheng Yuting
LDLi Dongcheng
Li Dongcheng
WEWong W. Eric
Wong W. Eric
ZMZhao Man
Zhao Man
MDMo Dengfeng
Mo Dengfeng