Weimin Zhang

Prof. Weimin Zhang

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
16 September 2020 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
YYYingying Yu
Yingying Yu
ZCZhiqiang Cao
Zhiqiang Cao
ZLZhicheng Liu
Zhicheng Liu
WGWenjie Geng
Wenjie Geng
Junzhi YuJunzhi Yu
Junzhi Yu
Weimin ZhangWeimin Zhang
Weimin Zhang
The manipulating robots receive much attention by offering better services, where object grasping is still challenging especially under background interferences. In this article, a novel two-stream grasping convolutional neural network (CNN) with simultaneous detection and segmentation is proposed. The proposed method is cascaded by an improved simultaneous detection and segmentation network BlitzNet and a two-stream grasping CNN TsGNet. The improved BlitzNet introduces the channel-based attention mechanism, and achieves an improvement of detection accuracy and segmentation accuracy with the combination of the learning of multitask loss weightings and background suppression. Based on the obtained bounding box and the segmentation mask of the target object, the target object is separated from the background, and the corresponding depth map and grayscale map are sent to TsGNet. By adopting depthwise separable convolution and designed global deconvolution network, TsGNet achieves the best grasp detection with only a small amount of network parameters. This best grasp in the pixel coordinate system is converted to a desired 6-D pose for the robot, which drives the manipulator to execute grasping. The proposed method combines a grasping CNN with simultaneous detection and segmentation to achieve the best grasp with a good adaptability to background. With the Cornell grasping dataset, the image-wise accuracy and object-wise accuracy of the proposed TsGNet are 93.13% and 92.99%, respectively. The effectiveness of the proposed method is verified by the experiments.

28 December 2018 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
Zhangguo YuZhangguo Yu
Zhangguo Yu
QZQinqin Zhou
Qinqin Zhou
XCXuechao Chen
Xuechao Chen
QLQingqing Li
Qingqing Li
LMLibo Meng
Libo Meng
QHQiang Huang
Qiang Huang
For real-world applications, a biped robot should maintain stable walking when subjected to sudden external disturbances. Typically, unexpected changes to body acceleration indicate that a robot is experiencing an external disturbance. This paper presents a biped walking controller for rapid response to large external disturbances. First, a novel adjustment algorithm for foot placement is proposed. Here, Zero-Moment-Point (ZMP) variations are mapped onto the new foothold based on calculations from changes in body acceleration. Second, a novel impact reduction control for foot landing is presented based on abating body vibrations. To avoid false detection triggers and excessive foothold adjustment, a rapid disturbance detection method is established using the body acceleration derivative. Finally, the effectiveness of the proposed methods is validated under simulations and in experiments with an actual biped robot.

22 October 2018 in Sensors
Verified
Journal Article
Open access
PDF file
YSYongliang Shi
Yongliang Shi
Weimin ZhangWeimin Zhang
Weimin Zhang
ZYZhuo Yao
Zhuo Yao
MLMingzhu Li
Mingzhu Li
ZLZhenshuo Liang
Zhenshuo Liang
QHQiang Huang
Qiang Huang
In the case of a single scene feature, the positioning of an indoor service robot takes a long time, and localization errors are likely to occur. A new method for a hybrid indoor localization system according to multi-sensor fusion is proposed to solve these problems. The localization process is divided in two stages: rough positioning and precise positioning. By virtue of the K nearest neighbors based on possibility (KNNBP) algorithm first created in the present study, the rough position of a robot is determined according to the received signal strength indicator (RSSI) of Wi-Fi. Then, the hybrid particle filter localization (HPFL) algorithm improved on the basis of adaptive Monte Carlo localization (AMCL) is adopted to get the precise localization, which integrates various information, including the rough position and information from Lidar, a compass, an occupancy grid map, and encoders. The experiments indicated that the positioning error was 0.05 m; the success rate of localization was 96% with even 3000 particles, and the global positioning time was 1.9 s. However, under the same conditions, the success rate of AMCL was approximately 40%, the required time was approximately 25.6 s, and the positioning accuracy was the same. This indicates that the hybrid indoor location system is efficient and accurate.

10 November 2021 in IEEE/ASME Transactions on Mechatronics
Verified
Journal Article
Closed access
FNFuyu Nie
Fuyu Nie
Weimin ZhangWeimin Zhang
Weimin Zhang
YWYang Wang
Yang Wang
YSYongliang Shi
Yongliang Shi
QHQiang Huang
Qiang Huang
Currently, there are many simultaneous localization and mapping (SLAM) algorithms for 3-D light detection and ranging (lidar) relying on features such as planes and edges. However, if a robot needs to work in a rubber forest, these simple features can be unstable due to the complexity of the environment. To address this problem, in this article, we propose the first SLAM system to make a deep adaptive adjustment for the particularity of the rubber-tapping robot and the rubber forest environment. In our article, tree trunks are used to construct a set of sparse maps called trunk atlas, which contain environmental information for localization and trunk position for rubber tapping. To ensure the quality of feature extraction, density field correction and multicriteria trunk detection are proposed. Due to the sparsity and stability of the trunk atlas, our SLAM system can ensure real-time performance. Experiments show that our lidar-only SLAM system can achieve nearly the same performance as state-of-the-art inertial-measurement-unit-aided algorithms in terms of runtime and localization accuracy. In addition, our trunk atlas also takes up less memory for storage than other algorithms. More specifically, it takes less than 50 kB to store a map of an area of approximately 5000 m $^2$ .

21 January 2020 in IEEE Access
Verified
Journal Article
Open access
FNFuyu Nie
Fuyu Nie
Weimin ZhangWeimin Zhang
Weimin Zhang
ZYZhuo Yao
Zhuo Yao
YSYongliang Shi
Yongliang Shi
FLFangxing Li
Fangxing Li
QHQiang Huang
Qiang Huang
A globally consistent map is the basis of indoor robot localization and navigation. However, map built by Rao-Blackwellized Particle Filter (RBPF) doesn’t have high global consistency which is not suitable for long-term application in large scene. To address the problem, we present an improved RBPF Lidar SLAM system with loop detection and correction named LCPF. The efficiency and accuracy of loop detection depend on the segmentation of submaps. Instead of dividing the submap at fixed number of laser scan like existing method, Dynamic Submap Segmentation is proposed in LCPF. This segmentation algorithm decreases the error inside the submap by splitting the submap where there is high scan match error and later rectifies the error by an improved pose graph optimization between submaps. In order to segment the submap at appropriate point, when to create a new submap is determined by both the accumulation of scan match error and the particle distribution. Furthermore, LCPF uses branch and bound algorithm as basic detector for loop detection and multiple criteria to judge the reliability of a loop. In the criteria, a novel parameter called usable ratio was proposed to measure the useful information that a laser scan containing. Finally, comparisons to existing 2D-Lidar mapping algorithm are performed with a series of open dataset simulations and real robot experiments to demonstrate the effectiveness of LCPF.

23 May 2019 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
ZYZhuo Yao
Zhuo Yao
Weimin ZhangWeimin Zhang
Weimin Zhang
YSYongliang Shi
Yongliang Shi
MLMingzhu Li
Mingzhu Li
ZLZhenshuo Liang
Zhenshuo Liang
QHQiang Huang
Qiang Huang
Path planning under two-dimensional (2D) maps is a fundamental problem in mobile robotics and other real-world applications (unmanned vehicles, navigation apps for mobile phones, and so forth). However, traditional algorithms (graph searching, artificial potential field, genetic, and so forth) rely on grid-by-grid searching. Thus, these methods generally do not find the global optimal path, and as the map scale increases, their time cost sharply increases, except artificial potential field. A few algorithms that do not rely on grid-by-grid searching (RRT, visibility graph, and tangent graph) have special requirements for maps. Considering that the shortest path is often composed of tangents between obstacles, in this paper, we propose a method called ReinforcedRimJump (RRJ) that does not rely on point-by-point traversal but rather obtains the shortest path by finding the tangent multiple times between obstacles. The first improvement of this method is the precomputation of tangents, which causes the method to have a lower time cost than traditional methods. The second improvement of RRJ is edge segmentation, which allows RRJ to be used when the target is in the depression of the obstacle. To verify the theoretical advantages of RRJ, some comparative experiments under various maps are performed. The experimental results show that RRJ can always find the shortest path in the shortest time. Furthermore, the time cost of RRJ is insensitive compared to other methods. The experimental results presented herein demonstrate that RRJ meets the theoretical expectations.