Abstract
Abstract
The mobile robotics is growing rapidly and is being used in a variety of applications, greatly improving productivity. Path planning is a central part of autonomous navigation for mobile robots. However, most paths generated by these methods have sharp turns, which are unacceptable for mobile robots due to their own motion limitations or specific task scenarios. Smoother paths are therefore needed to improve the reliability and efficiency of the robot while adapting to realistic scenarios. This paper summarizes the classical curve smoothing algorithms and relate new research results presented in recent years, and divide them into six categories: polynomial interpolation, non-uniformly interpolated curves, Beizer curves, B spline curves, Reeds-Shepp curves, geometric algorithms, etc. Besides, a brief mathematical description is given along with the algorithms, and some of the algorithms are also given as examples for reference. In the future, better curve smoothing algorithms to satisfy the kinematic laws of different vehicles (robots/ships/UAVs) in multiple environments and non-simple interpolation smoothing algorithms will be proposed.
Subject
Computer Science Applications,History,Education
Reference24 articles.
1. Analysis and observations from the first amazon picking challenge;Nikolaus;IEEE Transactions on Automation Science and Engineering,2016
2. A comprehensive study for robot navigation techniques;Faiza;Cogent Engineering,2019
3. Path smoothing techniques in robot navigation: State-of-the-art, current and future challenges;Abhijeet;Sensors,2018
4. Robot path planning based on A* algorithm;Yajie;Electronic Science and Technology,2017