摘要
研究了机器人避障最短路径和最短时间路径的问题,在一个平面场景图中存在12个不同形状的障碍物,通过建立线圆结构,以及最优化模型求得最短路径;并通过建立目标函数来计算最短时间路径。
The paper studies the problems of the shortest path and the shortest time path that the robot avoids obstacles. The research mainly talked about the 12 different shapes of the obstacles on the flat surface, through which the robot was required to walk the shortest path.
出处
《萍乡学院学报》
2014年第6期5-8,共4页
Journal of Pingxiang University
关键词
最短路径
最优化模型
目标函数
避障路径
the shortest path
optimization model
objective function
dodge obstacle path
