摘要
机器人路径规划就是在复杂的结构空间中,找到一条由起点到目标点的可行路径.基于最大-最小蚂蚁算法,结合机器人路径规划的典型问题,给出了一种新的规划方法.实验结果表明,该方法能以较大的概率得到机器人路径规划问题的优化解.
The Robot＇s path planning problem is to find a feasible path from a beginning to a goal in configuration space. Based on the max-rain ant algorithm, combined with the typical problem of Robot＇s path planning, the planning arrived a new approach. The experimental indicate that method can give the optimal solution of robot＇s path planning with a high probability.
出处
《武汉工程大学学报》
CAS
2009年第5期76-79,共4页
Journal of Wuhan Institute of Technology
