Xiang Chang

Xiang Chang

Auto-generated profile, based on publicly available information

Xiang Chang

Institute of Mathematics, Physics, and Computer Science, Aberystwyth University, Aberystwyth, U.K.

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
18 May 2020 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Open access
WFWubing Fang
Wubing Fang
FCFei Chao
Fei Chao
Chih-Min LinChih-Min Lin
Chih-Min Lin
DZDajun Zhou
Dajun Zhou
Longzhi YangLongzhi Yang
Longzhi Yang
CSChangjing Shang
Changjing Shang
This paper proposes a robotic hand-eye coordination system by simulating the human behavior pattern to achieve a fast and robust reaching ability. This is achieved by two neural-network-based controllers, including a rough reaching movement controller implemented by a pre-trained RBF for rough reaching movements, and a correction movement controller built from a specifically designed Brain Emotional Nesting Network (BENN) for smooth correction movements. The proposed BENN is designed with high nonlinear mapping ability, with its adaptive laws derived from the Lyapunov stability theorem; the stability of the proposed control system are guaranteed by the utilisation of the H $^{\infty}$ control approach. The method is validated and evaluated by a chaos synchronisation simulation, and the overall control system by object grasping tasks through a physical robotic arm in a real-world environment. The experimental results demonstrate the superiority of the proposed control system in reference to those with single neural networks.

31 October 2020 in Sustainability
Verified
Journal Article
Open access
PDF file
FCFei Chao
Fei Chao
GLGan Lin
Gan Lin
LZLing Zheng
Ling Zheng
XCXiang Chang
Xiang Chang
Chih-Min LinChih-Min Lin
Chih-Min Lin
CSChangjing Shang
Changjing Shang
Robotic calligraphy is a very challenging task for the robotic manipulators, which can sustain industrial manufacturing. The active mechanism of writing robots require a large sized training set including sequence information of the writing trajectory. However, manual labelling work on those training data may cause the time wasting for researchers. This paper proposes a machine calligraphy learning system using a Long Short-Term Memory (LSTM) network and a generative adversarial network (GAN), which enables the robots to learn and generate the sequences of Chinese character stroke (i.e., writing trajectory). In order to reduce the size of the training set, a generative adversarial architecture combining an LSTM network and a discrimination network is established for a robotic manipulator to learn the Chinese calligraphy regarding its strokes. In particular, this learning system converts Chinese character stroke image into the trajectory sequences in the absence of the stroke trajectory writing sequence information. Due to its powerful learning ability in handling motion sequences, the LSTM network is used to explore the trajectory point writing sequences. Each generation process of the generative adversarial architecture contains a number of loops of LSTM. In each loop, the robot continues to write by following a new trajectory point, which is generated by LSTM according to the previously written strokes. The written stroke in an image format is taken as input to the next loop of the LSTM network until the complete stroke is finally written. Then, the final output of the LSTM network is evaluated by the discriminative network. In addition, a policy gradient algorithm based on reinforcement learning is employed to aid the robot to find the best policy. The experimental results show that the proposed learning system can effectively produce a variety of high-quality Chinese stroke writing.

21 January 2023 in Knowledge-Based Systems
Verified
Journal Article
Closed access
LLLi-Jiang Li
Li-Jiang Li
SZSheng-Lin Zhou
Sheng-Lin Zhou
FCFei Chao
Fei Chao
XCXiang Chang
Xiang Chang
LYLongzhi Yang
Longzhi Yang
QSQiang Shen
Qiang Shen

26 March 2025 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
XGXingen Gao
Xingen Gao
LCLei Chen
Lei Chen
FCFei Chao
Fei Chao
XCXiang Chang
Xiang Chang
XGXinghang Gao
Xinghang Gao
HZHongyi Zhang
Hongyi Zhang
Crowd counting, a method for measuring crowd sizes, has seen significant advancements with deep learning techniques, which have proven highly effective in accurate estimation. However, the improvement in these methods’ accuracy is frequently achieved at the cost of more intricate model architectures. This paper discusses how to construct high-performance crowd counting models using only simple structures. We propose the Fuss-Free Structure, a simple and efficient architecture with a backbone network and multi-scale feature fusion. It exhibits notable adaptability, ensuring that slight replacing its components do not lead to a substantial decline in performance. The multi-scale feature fusion structure is an uncomplicated design that consists of three distinct pathways, each featuring only a focus transition module. It combines the features from these pathways by directly employing the concatenation operation. By selecting appropriate components, our proposed structure has been trained and evaluated across four public datasets, demonstrating an accuracy that rivals that of existing complex models. Furthermore, a comprehensive evaluation is conducted by replacing the backbones of various models such as CCTrans and the proposed structure with different networks, including MobileNet-v3, ConvNeXt-Tiny, and Swin-Transformer-Small. The experimental results further indicate that excellent crowd counting performance can be achieved with the simple structure proposed by us. Code is available at https://github.com/erdongsanshi/Fuss-Free-structure.

26 July 2023 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
RWRuiqi Wu
Ruiqi Wu
FCFei Chao
Fei Chao
CZChangle Zhou
Changle Zhou
XCXiang Chang
Xiang Chang
Longzhi YangLongzhi Yang
Longzhi Yang
QSQiang Shen
Qiang Shen
Learning calligraphy writing skills in robots is regarded as a sophisticated task. Current robotic researchers have proposed many methods to implement various robotic calligraphy systems. However, several limitations of these methods, such as high computational costs and few diversities of generated results constrain the development of calligraphy robots. This article proposes a robotic writing framework based on a robotic hand–eye coordination method to solve these limitations. Inspired by the internal model control (IMC) system, a vision-motor network and a motor-vision network are built to simulate the direct and reverse models, respectively, in the IMC system of a robotic manipulator. The vision-motor network works as an action generator to convert image inputs to robotic actions, and the motor-vision network assists in the training of the vision-motor network. Thus, a pretraining of the motor-vision network is established by random writing movements of a robotic manipulator. Experimental results demonstrate that the proposed method can successfully write strokes of Chinese characters by inputting target stroke images. Although the proposed method is applied to robotic calligraphy, the underpinning research is readily applicable to many other applications, such as human–robot motion mimicking.

3 May 2024 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
BGBo-Wen Guo
Bo-Wen Guo
FCFei Chao
Fei Chao
XCXiang Chang
Xiang Chang
CSChangjing Shang
Changjing Shang
QSQiang Shen
Qiang Shen
Approximation biases of value functions are considered a key problem in reinforcement learning (RL). In particular, existing RL algorithms are hindered by overestimation and underestimation biases, i.e., value mismatching between RL’s actual returns and action-value approximations limits the performance of RL algorithms. In this article, we first develop a new synthesis loss function for RL’s action-value estimation integrating a regularization term and a modified “clipped double Q-learning” structure for solving overestimation and underestimation biases. To minimize the differences between action-value estimations and actual returns in RL, we develop a new discrepancy function to determine the type and magnitude of approximation biases. Then, two coefficients embedded in the synthesis loss are automatically tuned by minimizing the discrepancy function during training to minimize approximation biases. We further design a new actor-critic (AC) algorithm, named AC with synthesis loss (ACSL), by integrating the synthesis loss function and an error-controlled mechanism. Experimental results on continuous control tasks illustrate that the proposed ACSL algorithm outperforms other cutting-edge RL methods in many tasks and that the proposed synthesis loss function is easily implemented into other algorithms and significantly reduces approximation biases while improving performance. The proposed method can successfully handle many complex continuous control tasks and can greatly outperform other state-of-the-art algorithms on most tasks.