To solve path planning problem

artificial bees colony（ABC） algorithm is introduced.But there are two difficulties for using it

path node is not fixed and neighborhood-building is difficult.This work overcomes them by fixing start-node and end-node and setting the maximum number of path planning nodes.The algorithm is tested by a classic problem and compared with other algorithm.The results show that it has some advantages on handling these optimization problems such as avoiding pre-maturity and advancing constringency.It can find the global optimum and it is an effective algorithm for solving path planning.