首页|Studies from Liaocheng University Yield New Data on Robotics (GAO-RRT*: A path p lanning algorithm for mobile robot with low path cost and fast convergence)
Studies from Liaocheng University Yield New Data on Robotics (GAO-RRT*: A path p lanning algorithm for mobile robot with low path cost and fast convergence)
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
By a News Reporter-Staff News Editor at Robotics & Machine Learning DailyNews – New study results on robotics have been published . According to news reporting from LiaochengUniversity by NewsRx journalists, r esearch stated, “Path planning is an essential research topic in thenavigation of mobile robots. Currently, rapidly-exploring random tree star (RRT*) and its v ariants areknown for their probabilistic completeness and asymptotic optimality , making them effective in findingsolutions for many path planning problems.”
Liaocheng UniversityAlgorithmsEmergi ng TechnologiesMachine LearningRobotRobotics
NETL
NSTL
