arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2004.05077cs.AIcs.CVeess.IV
收藏

运动规划中降低数据图像失真的CNN编码器

CNN Encoder to Reduce the Dimensionality of Data Image for Motion Planning

Universidade de Pernambuco(伯南布哥大学);Istituto Italiano di Tecnologia(意大利理工学院)

Janderson Ferreira, Agostinho A. F. Júnior, Yves M. Galvão, Bruno J. T. Fernandes, Pablo Barros

摘要:

许多现实世界的应用需要路径规划算法来解决不同领域的任务,例如社交应用、自动驾驶汽车和跟踪活动。最重要的是运动规划。尽管在大多数运动规划场景中使用路径规划是足够的,但是它们在具有动态变化的大型环境中代表了潜在的瓶颈。为了解决这个问题,可以减少可能的路线的数量,使路径规划算法更容易找到最短路径,以更少的努力。传统的路径规划算法是A* 算法,它使用启发式算法,比其他解决方案更快。在这项工作中,我们提出了一个CNN编码器,能够消除无用的路线运动规划问题,然后我们结合所提出的神经网络输出与A*。为了衡量我们的解决方案的效率,我们提出了一个数据库与不同的情况下的运动规划问题。评估的度量是找到最短路径的迭代次数。A* 与具有A* 的CNN编码器(提案)进行了比较。在所有评估的情况下,我们的解决方案减少了超过60%的迭代次数。

英文摘要:

Many real-world applications need path planning algorithms to solve tasks in different areas, such as social applications, autonomous cars, and tracking activities. And most importantly motion planning. Although the use of path planning is sufficient in most motion planning scenarios, they represent potential bottlenecks in large environments with dynamic changes. To tackle this problem, the number of possible routes could be reduced to make it easier for path planning algorithms to find the shortest path with less efforts. An traditional algorithm for path planning is the A*, it uses an heuristic to work faster than other solutions. In this work, we propose a CNN encoder capable of eliminating useless routes for motion planning problems, then we combine the proposed neural network output with A*. To measure the efficiency of our solution, we propose a database with different scenarios of motion planning problems. The evaluated metric is the number of the iterations to find the shortest path. The A* was compared with the CNN Encoder (proposal) with A*. In all evaluated scenarios, our solution reduced the number of iterations by more than 60\%.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑