非凸空间中抽样与规划的肇事逃逸问题
Hit-and-Run for Sampling and Planning in Non-Convex Spaces
摘要:
我们提出了打了就跑算法的规划和抽样问题在非凸空间。对于采样,我们展示了在非凸空间中的打了就跑算法的第一次分析,并表明只要满足某些平滑条件,它就可以快速混合。特别是,我们的分析揭示了一个有趣的快速混合之间的联系和存在的光滑保测映射从凸空间到非凸空间。对于规划,我们展示了打了就跑的优势相比,国家的最先进的规划方法,如快速探索随机树。
英文摘要:
We propose the Hit-and-Run algorithm for planning and sampling problems in non-convex spaces. For sampling, we show the first analysis of the Hit-and-Run algorithm in non-convex spaces and show that it mixes fast as long as certain smoothness conditions are satisfied. In particular, our analysis reveals an intriguing connection between fast mixing and the existence of smooth measure-preserving mappings from a convex space to the non-convex space. For planning, we show advantages of Hit-and-Run compared to state-of-the-art planning methods such as Rapidly-Exploring Random Trees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。