進化的手法による動的移動ロボット経路計画の最適化
Optimization of dynamic mobile robot path planning based on evolutionary methods
動的障害物環境での移動ロボット経路計画にパターン探索・遺伝的アルゴリズム・粒子群最適化を適用し、PSOが目的関数を最も良く最小化、PSが計算時間で優れることを示した。
著者: Masoud Fetanat, Sajjad Haghzad, Saeed Bagheri Shouraki
分類: cs.RO
原文アブストラクト
This paper presents evolutionary methods for optimization in dynamic mobile robot path planning. In dynamic mobile path planning, the goal is to find an optimal feasible path from starting point to target point with various obstacles, as well as smoothness and safety in the proposed path. Pattern search (PS) algorithm, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are used to find an optimal path for mobile robots to reach to target point with obstacle avoidance. For showing the success of the proposed method, first they are applied to two different paths with a dynamic environment in obstacles. The first results show that the PSO algorithms are converged and minimize the objective function better that the others, while PS has the lower time compared to other algorithms in the initial and modified environment. The second test path is in the z-type environment that we compare the mentioned algorithms on it. Also in this environment, the same result is repeated.
