Path planning for space robot by use of hopfield network
Qi Guo · Ha'erbin gongye daxue xuebao · 2003
A path planning for space robot is presented by using basic Hopfield network, which gives the solu- tion of finding the shortest path for space robot to call on and return every space station. Different connection weighting and energy function can be designed according to every actual problem so as to extend the network a- daptability for solving actual problem. The Hopfield network has many advantages, such as the massively par- allel processing abilities as well as simple in method.