In order to effectively reduce the uncertainty error of mobile robot localization with a single sensor and improve the accuracy and robustness of robot localization and mapping,a mobile robot localization algorithm ba...In order to effectively reduce the uncertainty error of mobile robot localization with a single sensor and improve the accuracy and robustness of robot localization and mapping,a mobile robot localization algorithm based on multi-sensor information fusion(MSIF)was proposed.In this paper,simultaneous localization and mapping(SLAM)was realized on the basis of laser Rao-Blackwellized particle filter(RBPF)-SLAM algorithm and graph-based optimization theory was used to constrain and optimize the pose estimation results of Monte Carlo localization.The feature point extraction and quadrilateral closed loop matching algorithm based on oriented FAST and rotated BRIEF(ORB)were improved aiming at the problems of generous calculation and low tracking accuracy in visual information processing by means of the three-dimensional(3D)point feature in binocular visual reconstruction environment.Factor graph model was used for the information fusion under the maximum posterior probability criterion for laser RBPF-SLAM localization and binocular visual localization.The results of simulation and experiment indicate that localization accuracy of the above-mentioned method is higher than that of traditional RBPF-SLAM algorithm and general improved algorithms,and the effectiveness and usefulness of the proposed method are verified.展开更多
In order to solve the problem of path planning of mobile robots in a dynamic environment,an improved rapidly-exploring random tree^(*)(RRT^(*))algorithm is proposed in this paper.First,the target bias sampling is intr...In order to solve the problem of path planning of mobile robots in a dynamic environment,an improved rapidly-exploring random tree^(*)(RRT^(*))algorithm is proposed in this paper.First,the target bias sampling is introduced to reduce the randomness of the RRT^(*)algorithm,and then the initial path planning is carried out in a static environment.Secondly,apply the path in a dynamic environment,and use the initially planned path as the path cache.When a new obstacle appears in the path,the invalid path is clipped and the path is replanned.At this time,there is a certain probability to select the point in the path cache as the new node,so that the new path maintains the trend of the original path to a greater extent.Finally,MATLAB is used to carry out simulation experiments for the initial planning and replanning algorithms,respectively.More specifically,compared with the original RRT^(*)algorithm,the simulation results show that the number of nodes used by the new improved algorithm is reduced by 43.19%on average.展开更多
基金Natural Science Foundation of Shaanxi Province(No.2019JQ-004)Scientific Research Plan Projects of Shaanxi Education Department(No.18JK0438)Youth Talent Promotion Project of Shaanxi Province(No.20180112)。
文摘In order to effectively reduce the uncertainty error of mobile robot localization with a single sensor and improve the accuracy and robustness of robot localization and mapping,a mobile robot localization algorithm based on multi-sensor information fusion(MSIF)was proposed.In this paper,simultaneous localization and mapping(SLAM)was realized on the basis of laser Rao-Blackwellized particle filter(RBPF)-SLAM algorithm and graph-based optimization theory was used to constrain and optimize the pose estimation results of Monte Carlo localization.The feature point extraction and quadrilateral closed loop matching algorithm based on oriented FAST and rotated BRIEF(ORB)were improved aiming at the problems of generous calculation and low tracking accuracy in visual information processing by means of the three-dimensional(3D)point feature in binocular visual reconstruction environment.Factor graph model was used for the information fusion under the maximum posterior probability criterion for laser RBPF-SLAM localization and binocular visual localization.The results of simulation and experiment indicate that localization accuracy of the above-mentioned method is higher than that of traditional RBPF-SLAM algorithm and general improved algorithms,and the effectiveness and usefulness of the proposed method are verified.
基金National Natural Science Foundation of China(No.61903291)。
文摘In order to solve the problem of path planning of mobile robots in a dynamic environment,an improved rapidly-exploring random tree^(*)(RRT^(*))algorithm is proposed in this paper.First,the target bias sampling is introduced to reduce the randomness of the RRT^(*)algorithm,and then the initial path planning is carried out in a static environment.Secondly,apply the path in a dynamic environment,and use the initially planned path as the path cache.When a new obstacle appears in the path,the invalid path is clipped and the path is replanned.At this time,there is a certain probability to select the point in the path cache as the new node,so that the new path maintains the trend of the original path to a greater extent.Finally,MATLAB is used to carry out simulation experiments for the initial planning and replanning algorithms,respectively.More specifically,compared with the original RRT^(*)algorithm,the simulation results show that the number of nodes used by the new improved algorithm is reduced by 43.19%on average.
