首页 /研究 /Planning multiple paths with evolutionary speciation
MANIPULATION

Planning multiple paths with evolutionary speciation

C. Hocaoglu, Arthur C. Sanderson

发表年份
2001
引用次数
108

摘要

This paper demonstrates a new approach to multidimensional path planning that is based on multiresolution path representation, where explicit configuration space computation is not required, and incorporates an evolutionary algorithm for solving the multimodal optimization problem, generating multiple alternative paths simultaneously. The multiresolution path representation reduces the expected search length for the path-planning problem and accordingly reduces the overall computational complexity. Resolution independent constraints due to obstacle proximity and path length are introduced into the evaluation function. The system can be applied for planning paths for mobile robots, assembly, and articulated manipulators. The resulting path-planning system has been evaluated on problems of two, three, four, and six degrees of freedom. The resulting paths are practical, consistent, and have acceptable execution times. The multipath algorithm is demonstrated on a number of 2D path-planning problems.

关键词

Motion planningAny-angle path planningComputer sciencePath (computing)Representation (politics)Mathematical optimizationEvolutionary algorithmEvolutionary computationPath lengthObstacle

相关论文

查看 MANIPULATION 分类全部论文