Research Article
Partition Sampling Strategy for Robot Motion Planning in Narrow Passage Under Uncertainty
@INPROCEEDINGS{10.1007/978-3-031-50580-5_36, author={Binpeng Wang and Zeqiang Li and Lin Sun and Chao Feng}, title={Partition Sampling Strategy for Robot Motion Planning in Narrow Passage Under Uncertainty}, proceedings={Multimedia Technology and Enhanced Learning. 5th EAI International Conference, ICMTEL 2023, Leicester, UK, April 28-29, 2023, Proceedings, Part IV}, proceedings_a={ICMTEL PART 4}, year={2024}, month={2}, keywords={Motion Planning POMDP Uncertainty}, doi={10.1007/978-3-031-50580-5_36} }- Binpeng Wang
Zeqiang Li
Lin Sun
Chao Feng
Year: 2024
Partition Sampling Strategy for Robot Motion Planning in Narrow Passage Under Uncertainty
ICMTEL PART 4
Springer
DOI: 10.1007/978-3-031-50580-5_36
Abstract
To address the perception and motion uncertainty issues for motion planning in narrow passage environments, a Partitioned Sampling Strategy based on Partially Observable Markov Decision Processes (POMDP) is put forward. Combining the partition sampling strategy with the POMDP algorithm improves the success rate of robot motion planning under narrow channel. Firstly, the division sampling strategy is adopted to divide the robot workspace into open area and narrow area, and connecting fewer sampling points to generate the initial trajectory of the robot; After the initial trajectory is generated, we further consider the uncertainty factors to make the path performance better. The POMDP model is used to solve the uncertainty problem; the local optimal solution is obtained by solving the POMDP problem, and the local optimal solution is iterated until the global optimal trajectory is obtained. The belief dynamics uses Extended Kalman Filter updating, and the belief space variables of iterative LQG are used for value iteration. The experimental results show that the appeal scheme can solve the motion planning problem of the robot in the narrow channel and the uncertain condition.
