Yuanchao Yang

Dr. Yuanchao Yang


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
1 August 2012 in Applied Energy
Verified
Journal Article
Closed access
YYYuanchao Yang
Yuanchao Yang
JWJianhui Wang
Jianhui Wang
XGXiaohong Guan
Xiaohong Guan
QZQiaozhu Zhai
Qiaozhu Zhai

1 April 2019 in Energy
Verified
Journal Article
Closed access
YYYuanchao Yang
Yuanchao Yang
ZGZichen Gao
Zichen Gao

21 May 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
YYYuanchao Yang
Yuanchao Yang
ZGZichen Gao
Zichen Gao
The next generation of aircraft with a large number of effectors will require advanced methods for control allocation (CA) to compute the effectors' commands needed to follow the desired objective while respecting associated constraints. Currently, the main challenge of the CA is to achieve low enough computation time with a deterministically optimal result for a real time application. In this paper, at first we cast the CA as a nonlinear convex programming problem which depicts the desired objective function subject to three-axis moment demands and the limits of effectors' movement; then we develop a computationally tractable method for real time application on the CA of the aircraft flight control system. The method can analytically and deterministically give one optimal solution for the CA and prove this optimal solution to be guaranteed within a certainly maximal computation time. Numerical testing results based on Boeing C-17 transport aircraft and Lockheed-Martin tailless fighter models demonstrate the method is effective in terms of its computational efficiency, accuracy and reliability.

24 June 2022 in IET Intelligent Transport Systems
Verified
Journal Article
Open access
YYYuanchao Yang
Yuanchao Yang
ZGZichen Gao
Zichen Gao
The authors propose a new scheduling model and solution method for Ground Movement Problem (GMP) which is designed to manage the movements of flights on the surface of airport air‐side in an effective manner. Since the arrival time for arrival flights and off‐block time for departure flights are usually uncertain parameters for GMP, the proposed scheduling model is stochastic and integrates the three‐dimensional (3‐D) taxiway routes’ assignment (with variable taxiing speed for flights) and the gates/stands allocation for the flights, with fully capturing multiple constraints related to taxiways, gates/stands and aircraft performance limits. The solution method also provides a stochastic quantification scheme concerning both uncertainties by the arrival time and off‐block time information. The schedule results can realize the immunity of the above time uncertainties within a tolerable risk probability. We finally provide numerical analysis to verify the stochastic scheduling model with mixed integer and linear programming (MILP) basics and illustrate the effectiveness of proposed solution method by a test case on Hangzhou international airport in China.

2 March 2020 in Bioinformatics
Verified
Journal Article
Open access
SWShiwei Wei
Shiwei Wei
YWYuping Wang
Yuping Wang
YYYuanchao Yang
Yuanchao Yang
LSLiu Sen
Liu Sen
Motivation: Searching the Longest Common Subsequences of many sequences is called a Multiple Longest Common Subsequence (MLCS) problem which is a very fundamental and challenging problem in many fields of data mining. The existing algorithms cannot be applicable to problems with long and large-scale sequences due to their huge time and space consumption. To efficiently handle large-scale MLCS problems, a Path Recorder Directed Acyclic Graph (PRDAG) model and a novel Path Recorder Algorithm (PRA) are proposed. Results: In PRDAG, we transform the MLCS problem into searching the longest path from the Directed Acyclic Graph (DAG), where each longest path in DAG corresponds to an MLCS. To tackle the problem efficiently, we eliminate all redundant and repeated nodes during the construction of DAG, and for each node, we only maintain the longest paths from the source node to it but ignore all non-longest paths. As a result, the size of the DAG becomes very small, and the memory space and search time will be greatly saved. Empirical experiments have been performed on a standard benchmark set of both DNA sequences and protein sequences. The experimental results demonstrate that our model and algorithm outperform the related leading algorithms, especially for large-scale MLCS problems. Availability and implementation: This program code is written by the first author and can be available at https://www.ncbi.nlm.nih.gov/nuccore and https://blog.csdn.net/wswguilin. Supplementary information: Supplementary data are available at Bioinformatics online.

9 August 2017 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YYYuanchao Yang
Yuanchao Yang
Strategic air traffic management (SATM) problem, one of the critical tasks in air traffic operations, faces new challenges as the increased concerns on environmental impact and operation efficiency of the air transportation, and the system uncertainty increases due to the time-varying interference, such as the convective weather. To effectively address these challenges, we propose the formulation and solution of a generalized 4-D SATM problem for an air traffic system with convective weather uncertainty. The proposed SATM problem formulation is computationally tractable and the schedule results can realize the avoidance of the convective weather with more than a tolerable risk probability. We provide a solution approach to tackle this problem with complex mathematical basics and illustrate the capabilities of the proposed mixed integer solution approach on the real regional air traffic system operated by the China civil aviation administration. Numerical results demonstrate the effectiveness of the proposed solution approach.