Simulation of Turn Alternation Strategy for Path Search
Authors:
Open Access
- 1 January 2023
- journal article
- research article
- Published by Japan Society for Simulation Technology in Journal of Advanced Simulation in Science and Engineering
- Vol. 10 (1) , 198-205
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.Keywords
This publication has 6 references indexed in Scilit:
- Worst-Case Analysis of a New Heuristic for the Travelling Salesman ProblemOperations Research Forum, 2022
- Ant Colony OptimizationIEEE Computational Intelligence Magazine, 2006
- Turn Alternation of the Pill Bug Armadillidium vulgare and Its Adaptive Significance.Japanese Journal of Applied Entomology and Zoology, 2006
- Maze-solving by an amoeboid organismNature, 2000
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973