| タイトル | Robot path planning using a genetic algorithm |
| 本文（外部サイト） | http://hdl.handle.net/2060/19890010498 |
| 著者（英） | Cleghorn, Timothy F.; Baffes, Paul T.; Wang, Liu |
| 著者所属（英） | NASA Johnson Space Center |
| 発行日 | 1988-11-01 |
| 言語 | eng |
| 内容記述 | Robot path planning can refer either to a mobile vehicle such as a Mars Rover, or to an end effector on an arm moving through a cluttered workspace. In both instances there may exist many solutions, some of which are better than others, either in terms of distance traversed, energy expended, or joint angle or reach capabilities. A path planning program has been developed based upon a genetic algorithm. This program assumes global knowledge of the terrain or workspace, and provides a family of good paths between the initial and final points. Initially, a set of valid random paths are constructed. Successive generations of valid paths are obtained using one of several possible reproduction strategies similar to those found in biological communities. A fitness function is defined to describe the goodness of the path, in this case including length, slope, and obstacle avoidance considerations. It was found that with some reproduction strategies, the average value of the fitness function improved for successive generations, and that by saving the best paths of each generation, one could quite rapidly obtain a collection of good candidate solutions. |
| NASA分類 | COMPUTER PROGRAMMING AND SOFTWARE |
| レポートNO | 89N19869 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/142955 |
|
