Abstract
SUMMARY
The search space of the path planning problem can greatly affect the running time and memory consumption, for example, the concave obstacle in grid-based map usually leads to the invalid search space. In this paper, the filling container algorithm is proposed to alleviate the concave area problem in 2D map space, which is inspired from the scenario of pouring water into a cup. With this method, concave areas can be largely excluded by scanning the map repeatedly. And the effectiveness has been proved in our experiments.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,General Mathematics,Software,Control and Systems Engineering
Reference29 articles.
1. Reinforcement learning path planning algorithm based on obstacle area expansion strategy
2. A Self-Heuristic Ant-Based Method for Path Planning of Unmanned Aerial Vehicle in Complex 3-D Space With Dense U-Type Obstacles
3. 26. Lee, M. C. and Park, M. G. , “Artificial Potential Field Based Path Planning for Mobile Robots Using a Virtual Obstacle Concept,” Proceedings 2003 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2003). 2, 735–740 (2003).
4. 10. Chan, R. H. T. , Tam, P. K. S. and Leung, D. N. K. , “Robot Navigation in Unknown Terrains via Multi-resolution Grid Maps,” 1991 International Conference on Industrial Electronics, Control and Instrumentation (1991) pp. 1138–1143.
5. Exact robot navigation using artificial potential functions
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献