Open AccessResearch on a Costmap that can Change the Turning Path of Mobile Robot
Author(s) -
Hao Wen,
Jun Yang
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2005/1/012095
Subject(s) - motion planning , obstacle , mobile robot , robot , path (computing) , dijkstra's algorithm , obstacle avoidance , computer science , mobile robot navigation , process (computing) , shortest path problem , artificial intelligence , simulation , robot control , geography , graph , archaeology , theoretical computer science , programming language , operating system
In the field of mobile robots based on ROS (Robot Operating System) platforms, A*, Dijkstra, and BFS (Breadth First Search) are widely used to obtain the shortest path. This approach, however, often results in paths that are close to the obstacles located in corners. In practical applications, cumulative positioning errors in the navigation process are produced by aging components, skidding wheels and so on. In addition, the local path planning of the robot does not completely follow the global path planning, so the robot may easily cross the inflation of the costmap and collide with obstacles when turning. This paper proposes a method to change the turning path of the robot by adding virtual obstacles to the obstacles in map corners. A global path is generated by the path planning algorithm along the virtual obstacle so that the robot can travel along a smooth track that is far from the obstacle when turning. The proposed algorithm ensures that the robot remains far from physical obstacles and avoids collisions.