One-Shot Multi-Path Planning Using Fully Convolutional Networks in a Comparison to Other Algorithms

Frontiers in Neurorobotics

Minija Tamosiunaite¹  Timo Lüddecke²  Florentin Wörgötter²  Sebastian Herzog²  Tomas Kulvicius² 

[1] Faculty of Computer Science, Vytautas Mangnus University, Kaunas, Lithuania;Third Institute of Physics - Biophysics, Department for Computational Neuroscience, University of Göttingen, Göttingen, Germany;

关键词: multi-source single-target path planning;    multi-agent systems;    robotics;    neural path planning;    mazes;   

DOI  :  10.3389/fnbot.2020.600984

来源: DOAJ

【 摘 要 】

Path planning plays a crucial role in many applications in robotics for example for planning an arm movement or for navigation. Most of the existing approaches to solve this problem are iterative, where a path is generated by prediction of the next state from the current state. Moreover, in case of multi-agent systems, paths are usually planned for each agent separately (decentralized approach). In case of centralized approaches, paths are computed for each agent simultaneously by solving a complex optimization problem, which does not scale well when the number of agents increases. In contrast to this, we propose a novel method, using a homogeneous, convolutional neural network, which allows generation of complete paths, even for more than one agent, in one-shot, i.e., with a single prediction step. First we consider single path planning in 2D and 3D mazes. Here, we show that our method is able to successfully generate optimal or close to optimal (in most of the cases <10% longer) paths in more than 99.5% of the cases. Next we analyze multi-paths either from a single source to multiple end-points or vice versa. Although the model has never been trained on multiple paths, it is also able to generate optimal or near-optimal (<22% longer) paths in 96.4 and 83.9% of the cases when generating two and three paths, respectively. Performance is then also compared to several state of the art algorithms.

【 授权许可】

Unknown