Cui Ni

Cui Ni

Auto-generated profile, based on publicly available information

Cui Ni

Shandong Jiaotong University

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
6 December 2022 in Research Square
Verified
Preprint
Open access
PDF file
HGHui Gong
Hui Gong
PWPeng Wang
Peng Wang
CNCui Ni
Cui Ni
NCNuo Cheng Cheng
Nuo Cheng Cheng
HWHua Wang
Hua Wang
Deep Deterministic Policy Gradient (DDPG) is a deep reinforcement learning algorithm that is widely used in the path planning of mobile robots. It solves the continuous action space problem and can ensure the continuity of mobile robot motion using the Actor-Critic framework, which has great potential in the field of mobile robot path planning. However, because the Critic network always selects the maximum Q value to evaluate the actions of mobile robot, there is the problem of inaccurate Q value estimation. In addition, DDPG adopts a random uniform sampling method, which can’t efficiently use the more important sample data, resulting in slow convergence speed during the training of the path planning model and easily falling into local optimum. In this paper, a dueling network is introduced based on DDPG to improve the estimation accuracy of the Q value, and the reward function is optimized to increase the immediate reward, to direct the mobile robot to move faster toward the target point. To further improve the efficiency of experience replay, a single experience pool is separated into two by comprehensively considering the influence of average reward and TD-error on the importance of samples, and a dynamic adaptive sampling mechanism is adopted to sample the two experience pools separately. Finally, experiments were carried out in the simulation environment created with the ROS system and the Gazebo platform. The results of the experiments show that the proposed path planning algorithm has a fast convergence speed and high stability, and the success rate can reach 100% and 93% in the environment without obstacles and with obstacles, respectively.

24 July 2023 in The Visual Computer
Verified
Journal Article
Closed access
PDF file
WHWeilong Hao
Weilong Hao
PWPeng Wang
Peng Wang
CNCui Ni
Cui Ni
GZGuangyuan Zhang
Guangyuan Zhang
WHWenjun Huangfu
Wenjun Huangfu

9 May 2019 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
PWPeng Wang
Peng Wang
CNCui Ni
Cui Ni
ZLZhe Li
Zhe Li
GZGuangyuan Zhang
Guangyuan Zhang

22 June 2022 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
HSHao Sun
Hao Sun
PWPeng Wang
Peng Wang
CNCui Ni
Cui Ni
LJLi Jinming
Li Jinming

29 June 2024 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
WHWenjun Huangfu
Wenjun Huangfu
CNCui Ni
Cui Ni
PWPeng Wang
Peng Wang
YZYingying Zhang
Yingying Zhang

23 December 2022 in Machines
Verified
Journal Article
Open access
PDF file
JLJinming Li
Jinming Li
PWPeng Wang
Peng Wang
CNCui Ni
Cui Ni
DZDong Zhang
Dong Zhang
WHWeilong Hao
Weilong Hao
Loop closure detection is a crucial part of VSLAM. However, the traditional loop closure detection algorithms are difficult to adapt to complex and changeable scenes. In this paper, we fuse Gist features, semantic features and appearance features of the image to detect the loop closures quickly and accurately. Firstly, we take advantage of the fast extraction speed of the Gist feature by using it to screen the loop closure candidate frames. Then, the current frame and the candidate frame are semantically segmented to obtain the mask blocks of various types of objects, and the semantic nodes are constructed to calculate the semantic similarity between them. Next, the appearance similarity between the images is calculated according to the shape of the mask blocks. Finally, based on Gist similarity, semantic similarity and appearance similarity, the image similarity calculation model can be built as the basis for loop closure detection. Experiments are carried out on both public and self-filmed datasets. The results show that our proposed algorithm can detect the loop closure in the scene quickly and accurately when the illumination, viewpoint and object change.