Simulation of Turn Alternation Strategy for Path Search

Abstract

The behavior ‘Turn alternation’ that is seen in pull bug and others is investigated as one of intelligence of natural creatures in this paper. Some numerical simulations are carried out on the square lattice with some obstacles. As the number of obstacles increases, the reachable rate to the goal largely decreases. In order to investigate the effectiveness of this strategy, we compare it with that of random walk, it is clarified that it takes more time to reach the goal as obstacles increases. Moreover that tendency is more remarkable in the larger simulation space size. However under some obstacle allocation, the strategy of turn alternation enables us to move in the wider range. Therefore it has some possibility to be a promising search algorithm if we combine it with other algorithms.