首页 /研究 /Non-Dominated Sorting Genetic Algorithm for smooth path planning in unknown environments
OTHER

Non-Dominated Sorting Genetic Algorithm for smooth path planning in unknown environments

Hussein Hamdy Shehata, Josef Schlattmann

发表年份
2014
引用次数
3

摘要

Autonomous robots have been the focus of attention of most researchers, particularly when it is imputed with terms like intelligence and autonomy. The most important challenge encounters autonomous navigation of a mobile robot is established from large amounts of uncertainties that are coupled with natural environment. This includes hazy and cloudy information of the environment. Moreover, continuous and fast changes of the real environment require a fast response from the robot. Many algorithms have been proposed and amongst these, the potential field algorithm is widely used. This work aims at optimizing some parameters involved in the potential field by the use of Non-Dominated Sorting Genetic Algorithm II (NSGA II). This paper takes into account the safety margin around the obstacle along with the size of the robot which also affects its motion during the optimization process in order to ensure the optimal path.

关键词

Motion planningSortingGenetic algorithmComputer scienceRobotMobile robotPath (computing)Field (mathematics)Process (computing)Obstacle

相关论文

查看 OTHER 分类全部论文