抄録
In this paper, we propose an autonomous decentralized optimization method for route planning of multiple mobile robots. The proposed method has a characteristic that each mobile robot searches its route individually by repeating the data exchange among the robots and local optimization at each robot. The effectiveness of the proposed method is demonstrated by numerical study.
