Xueming Zhang

Xueming Zhang

Auto-generated profile, based on publicly available information

Xueming Zhang

College of Electrical and Information Engineering, Hunan University,National Engineering Laboratory for Robot Visual Perception and Control Technology,Changsha,China,410082

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
30 July 2013 in IEEE Transactions on Power Delivery
Verified
Journal Article
Closed access
ZLZhu Liying
Zhu Liying
JWJianwen Wu
Jianwen Wu
ZXZhang Xueming
Zhang Xueming
This paper describes the arc behavior in the transverse-magnetic-field (TMF) contacts at intermediate frequency (400-800 Hz). With high-speed photography, three different arc modes were identified: expansion arc column, moving arc, and diffuse arc. In the expansion arc column mode, the arc column is immobile and the diameter of the arc column increases with the current. During this stage, the bright anode spots appear with high amplitude noise of arc voltage at high current. The expansion arc column mode plays an important role in the anode erosion. In the moving arc column mode, the average velocities were observed about 10-100 m/s, and the arc velocity increases with the increased frequency at the same current. The arc voltage expressed by arc current and frequency was obtained in this paper. The cross-section area of the arc column decreases with the increased frequency at the same current. The current density increases with the increased frequency at the certain current. Consequently, it is deduced that the arc velocity increases with the increased frequency at the same current. The mean power input concentrates in a smaller area at a higher frequency. It may be one of the reasons why the anode local melted.

9 October 2023 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
XZXueming Zhang
Xueming Zhang
MHMengxue Hou
Mengxue Hou
ZHZhongsheng Hou
Zhongsheng Hou
For a class of unknown MIMO non-affine nonlinear repetitive discrete-time systems, a novel data-driven high-order point-to-point iterative learning control scheme is proposed. The control input objective function of this method consists of two parts. One includes the high-order error information, the other consists of the control inputs within the time sub-intervals divided by prescribed desired points. The control law is designed by optimizing this function and it comprises only the known control input signals in the current iteration and the error data in previous iterations. Further, the convergence analysis is conducted in a data-driven way and does not need precise mathematical models. In addition, a scalar index function is set up to evaluate the tracking error convergence rate. By choosing the appropriate high-order factor and corresponding step-size factors, the convergence rate of higher-order learning law is shown to have a faster speed than that of lower-order one. Simulation experiments verify the effectiveness and advantage of this method. Note to Practitioners —The motivation of this paper is to design a control algorithm that only depends on the information of the prescribed desired points, that is, the point-to-point iterative learning control scheme. This control algorithm can be competent for terminal temperature control tasks with very intense chemical reactions and other control tasks that the information except for the I/O data at the prescribed desired points is unavailable. When we want to improve further the control performance at some prescribed desired points, the data of some intermediate time instants can be used to supply extra support for the control system design to improve the control performance at the prescribed desired points. In fact, the point-to-point iterative learning control scheme can be applied to many fields, such as high-speed trains, functional electrical stimulation areas, and positioning X–Y tables. In this paper, a data-driven high-order point-to-point iterative learning control scheme for the MIMO systems is designed, and the stability of this scheme is theoretically analyzed by using the contraction mapping method. Further, the tracking error convergence rate with different order learning law is analyzed. Finally, two numerical simulations are used to verify the effectiveness of the scheme proposed in this paper.

13 June 2025 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
HTHaoran Tan
Haoran Tan
XZXueming Zhang
Xueming Zhang
YWYaonan Wang
Yaonan Wang
YWYou Wu
You Wu
Yun FengYun Feng
Yun Feng
ZHZhongsheng Hou
Zhongsheng Hou
In this paper, a novel data-driven bipartite consensus control scheme is proposed for the rotation problem of large workpieces with multi-robot systems (MRSs) under a directed communication topology. The rotation of a large workpiece is described as the MRSs with cooperation and antagonism interaction. By the signed graph theory, it is further transformed into a bipartite consensus control problem, where all followers are uniformly degenerated into the general nonlinear systems based on the lateral error model. To augment the flexibility of control protocol and improve control performance, a higher-dimensional full form dynamic linearization (FFDL) technique is committed to the MRSs. The control input criterion function consists of the data model based on FFDL and the bipartite consensus error based on the signed graph theory, and the proposed control protocol is given by optimizing this criterion function. In this way, this scheme has a higher degree of freedom and better adaptive adjustment capability while not excessively increasing the control method complexity, and it can also be compatible with other forms of dynamic linearization techniques in MRSs. Further, three matrix norm lemmas are introduced to deal with the challenges of stability analysis caused by higher matrix dimensions and more robots. Finally, the effectiveness of the proposed method is verified by numerical simulations.

17 November 2023
Verified
Conference Paper
Closed access
JWJunlin Wei
Junlin Wei
YWYaonan Wang
Yaonan Wang
HTHaoran Tan
Haoran Tan
XZXueming Zhang
Xueming Zhang
YMYunlong Ma
Yunlong Ma
Bowen ZhouBowen Zhou
Bowen Zhou
This paper solves the problem that expanding nodes incompletely of pure theta* in dynamic environments. The theta* plus algorithm with known dynamic obstacles is proposed to plan feasible paths for multiple robots. It is a two-level algorithm. At the high-level, each robot is assigned a unique priority by prioritized planning. At the low-level, the theta* plus algorithm with known dynamic obstacles is proposed for each robot to plan the path while avoiding conflict with robots with higher priority. The results of the simulations show that the approach proposed can perform some multi-robot path planning problems well.