Baoling Han

Baoling Han

Auto-generated profile, based on publicly available information

Baoling Han

Beijing Institute of Technology

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
19 February 2020 in Applied Sciences
Verified
Journal Article
Open access
PDF file
XWXinda Wang
Xinda Wang
XLXiao Luo
Xiao Luo
BHBaoling Han
Baoling Han
YCYuhan Chen
Yuhan Chen
GLGuanhao Liang
Guanhao Liang
KZKailin Zheng
Kailin Zheng
Sampling-based methods are popular in the motion planning of robots, especially in high-dimensional spaces. Among the many such methods, the Rapidly-exploring Random Tree (RRT) algorithm has been widely used in multi-degree-of-freedom manipulators and has yielded good results. However, existing RRT planners have low exploration efficiency and slow convergence speed and have been unable to meet the requirements of the intelligence level in the Industry 4.0 mode. To solve these problems, a general autonomous path planning algorithm of Node Control (NC-RRT) is proposed in this paper based on the architecture of the RRT algorithm. Firstly, a method of gradually changing the sampling area is proposed to guide exploration, thereby effectively improving the search speed. In addition, the node control mechanism is introduced to constrain the extended nodes of the tree and thus reduce the extension of invalid nodes and extract boundary nodes (or near-boundary nodes). By changing the value of the node control factor, the random tree is prevented from falling into a so-called “local trap” phenomenon, and boundary nodes are selected as extended nodes. The proposed algorithm is simulated in different environments. Results reveal that the algorithm greatly reduces the invalid exploration in the configuration space and significantly improves planning efficiency. In addition, because this method can efficiently use boundary nodes, it has a stronger applicability to narrow environments compared with existing RRT algorithms and can effectively improve the success rate of exploration.

9 June 2020 in IEEE Access
Verified
Journal Article
Open access
YCYuhan Chen
Yuhan Chen
XLXiao Luo
Xiao Luo
BHBaoling Han
Baoling Han
QLQingsheng Luo
Qingsheng Luo
LQLijun Qiao
Lijun Qiao
The motion control of robot manipulators is a crucial problem concerning automatically controlled robots. In this work, the model predictive control method with an integral compensation (MPC-I), which compensates for the matched uncertainties due to unmodeled dynamics, is proposed to solve the trajectory tracking problem of robot manipulators in joint and task spaces. First, this paper decouples the joint variables of the robot manipulator using a computed torque control method. The MPC-I method is, thereafter, derived to realize the motion control of the robot manipulators in joint space. To realize the motion control of the robot manipulator in task space, the task space is, thereafter, converted into the joint space, in which the MPC-I method is executed, afterward, to control the robot. Furthermore, an MPC-I variation, in which the inverse kinematics is calculated indirectly, is proposed to achieve the motion control in task space. The novelty of this paper is to propose the MPC-I method and the method of converting task space to joint space with indirect inverse kinematics calculation. The former is suitable for the dynamic control of the robot manipulators in the joint space, and the latter can extend the MPC-I method to dynamic control in task space. To evaluate the performance of the proposed control method, motion control simulations are performed in the task and joint spaces, respectively. Simulation results and comparisons verify the effectiveness of the proposed control approach for the dynamic control of the UR5 robot manipulator.

25 November 2018 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YJYan Jia
Yan Jia
XLXiao Luo
Xiao Luo
BHBaoling Han
Baoling Han
GLGuanhao Liang
Guanhao Liang
JZJiaheng Zhao
Jiaheng Zhao
YZYuting Zhao
Yuting Zhao
Dynamic-stability criteria are crucial for robot’s motion planning and balance recovery. Nevertheless, few studies focus on the motion stability of quadruped robots with dynamic gait, none of which have accurately evaluated the robots’ stability. To fill the gaps in this field, this paper presents a new stability criterion for the motion of quadruped robots with dynamic gaits running over irregular terrain. The traditional zero-moment point (ZMP) is improved to analyze the motion on irregular terrain precisely for dynamic gaits. A dynamic-stability criterion and measurement are proposed to determine the stability state of the robot and to evaluate its stability. The simulation results show the limitations of the existing stability criteria for dynamic gaits and indicate that the criterion proposed in this paper can accurately and efficiently evaluate the stability of a quadruped robot using such gaits.

16 October 2019 in Applied Sciences
Verified
Journal Article
Open access
PDF file
WSWang Shanda
Wang Shanda
XLXiao Luo
Xiao Luo
QLQingsheng Luo
Qingsheng Luo
HBHan Baoling
Han Baoling
This study proposes a method for judging the existence of closed-form inverse kinematics solutions based on the Denavit–Hartenberg (DH) model. In this method, serial robots with closed-form solutions are described using three types of sub-problems from the viewpoint of solving algebraic equations. If a serial robot can be described using these three types of sub-problems, i.e., if the inverse kinematics problems can be solved by several basic problems, then there is a closed-form solution. Based on the above method, we design a set of universal closed-form inverse kinematics solving algorithms. Since there is a definite formula solution for the three types of sub-problems, the joint angles can be rapidly determined. In addition, because the DH parameters can directly reflect the linkage of the robot, the judgment of the sub-problems is also quick and accurate. More importantly, the algorithm can be applied to serial robots with low degrees of freedom. This enables the algorithm to not only quickly and accurately solve inverse kinematics problems but also to exhibit high universality. This proposed theory improves the existence conditions for closed-form reverse solutions and further promotes the development of motion control techniques for serial robots.

4 May 2020 in IEEE Access
Verified
Journal Article
Open access
SWShan-Da Wang
Shan-Da Wang
XLXiao Luo
Xiao Luo
SXShi-Jie Xu
Shi-Jie Xu
QLQingsheng Luo
Qingsheng Luo
BHBao-Ling Han
Bao-Ling Han
YJYan Jia
Yan Jia
In this paper, a third-order S-curve is used to model the motion issue. A closed method of solving is derived for the optimal point-to-point(P2P) time issue based on the model. Based on the P2P time-optimal solution, a closed multi-axis synchronization algorithm (MASA) method is proposed. This method considers the kinematic equation of the S-curve based on the inverse function of the multivariate function. Therefore, the inverse function of the execution time is derived via the kinematic equation of the P2P time optimization issue and solving a set of smaller bandwidth parameters is an important attempt in this paper. Otherwise, based on the MASA proposed in this paper, a synchronous computing framework suitable for the planning of robot space poses was designed. This framework can effectively solve problems with robot pose planning. The innovations of this article can be summarized as:(1)Based on the third-order S-curve, this paper deduced a complete method for solving the P2P time-optimal curve.(2) Based on the method for solving the time-optimal curve, this paper further derived three synchronization methods based on time constraints.(3) Based on the MASA proposed in this paper, a synchronous computing framework suitable for the planning of robot space poses was designed. The continuity and smoothness of the robot joint spatial motion can be guaranteed in the Descartes space. Few scholars have studied the closed solution method of multi-axis synchronization. The research in this paper promotes the theoretical research of motion control.

12 December 2019 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YCYuhan Chen
Yuhan Chen
XLXiao Luo
Xiao Luo
BHBaoling Han
Baoling Han
YJYan Jia
Yan Jia
GLGuanhao Liang
Guanhao Liang
XWXinda Wang
Xinda Wang
The inverse kinematics of robot manipulators is a crucial problem with respect to automatically controlling robots. In this work, a Newton-improved cyclic coordinate descent (NICCD) method is proposed, which is suitable for robots with revolute or prismatic joints with degrees of freedom of any arbitrary number. Firstly, the inverse kinematics problem is transformed into the objective function optimization problem, which is based on the least-squares form of the angle error and the position error expressed by the product-of-exponentials formula. Thereafter, the optimization problem is solved by combining Newton’s method with the improved cyclic coordinate descent (ICCD) method. The difference between the proposed ICCD method and the traditional cyclic coordinate descent method is that consecutive prismatic joints and consecutive parallel revolute joints are treated as a whole in the former for the purposes of optimization. The ICCD algorithm has a convenient iterative formula for these two cases. In order to illustrate the performance of the NICCD method, its simulation results are compared with the well-known Newton–Raphson method using six different robot manipulators. The results suggest that, overall, the NICCD method is effective, accurate, robust, and generalizable. Moreover, it has advantages for the inverse kinematics calculations of continuous trajectories.