arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2208.04153cs.AI
收藏

[复制报告]使用神经A* 搜索的路径规划

[Reproducibility Report] Path Planning using Neural A* Search

Shreya Bhatt, Aayush Jain, Parv Maheshwari, Animesh Jha, Debashish Chakravarty

摘要:

以下论文是ICML2 2021上发表的“使用神经A* 搜索的路径规划”的再现性报告,作为ML再现性挑战2021的一部分。最初的论文提出了神经A* 规划器,并声称它在减少节点扩展和路径准确性之间实现了最佳平衡。我们通过在不同的框架中重新实现模型来验证这一说法,并重现了原始论文中发表的数据。我们还提供了一个代码流图,以帮助理解代码结构。作为对原始论文的扩展,我们探索了以下因素的影响:(1)通过在混洗数据集上训练模型来推广模型,(2)引入dropout,(3)将经验选择的超参数作为模型中的可训练参数,(4)将网络模型更改为生成对抗网络(GANs)以引入随机性,(5)将编码器从Unet修改为Unet++,(6)将从神经A* 模块获得的成本图并入A* 搜索的其他变型中。

英文摘要:

The following paper is a reproducibility report for "Path Planning using Neural A* Search" published in ICML2 2021 as part of the ML Reproducibility Challenge 2021. The original paper proposes the Neural A* planner, and claims it achieves an optimal balance between the reduction of node expansions and path accuracy. We verify this claim by reimplementing the model in a different framework and reproduce the data published in the original paper. We have also provided a code-flow diagram to aid comprehension of the code structure. As extensions to the original paper, we explore the effects of (1) generalizing the model by training it on a shuffled dataset, (2) introducing dropout, (3) implementing empirically chosen hyperparameters as trainable parameters in the model, (4) altering the network model to Generative Adversarial Networks (GANs) to introduce stochasticity, (5) modifying the encoder from Unet to Unet++, (6) incorporating cost maps obtained from the Neural A* module in other variations of A* search.

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

↑