多目的粒子群最適化による複数ロボット協調箱押し問題の解法
Multi-robot Cooperative Box-pushing problem using Multi-objective Particle Swarm Optimization Technique
複数ロボットで箱を回転・並進させながら目標位置へ運ぶ問題を多目的最適化として定式化し、改良型多目的粒子群最適化で時間とエネルギーを最小化する手法を提案した。NSGA-IIより良い結果が得られた。
著者: Arnab Ghosh, Avishek Ghosh, Arkabandhu Chowdhury, Amit Konar, R. Janarthanan
分類: cs.RO, cs.NE
原文アブストラクト
The present work provides a new approach to solve the well-known multi-robot co-operative box pushing problem as a multi objective optimization problem using modified Multi-objective Particle Swarm Optimization. The method proposed here allows both turning and translation of the box, during shift to a desired goal position. We have employed local planning scheme to determine the magnitude of the forces applied by the two mobile robots perpendicularly at specific locations on the box to align and translate it in each distinct step of motion of the box, for minimization of both time and energy. Finally the results are compared with the results obtained by solving the same problem using Non-dominated Sorting Genetic Algorithm-II (NSGA-II). The proposed scheme is found to give better results compared to NSGA-II.
