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

用多项式时间求静态系统和动态系统的最优路径

Find an Optimal Path in Static System and Dynamical System within Polynomial Runtime

Yong Tan

摘要:

我们研究了一个古老的问题,在静态或动态系统中,寻求最优路径,上下文总是意味着在极端条件下。实际上,通过对这一主题的讨论,我们建立了一个通用的本质计算模型来服务于这些复杂系统。同时利用样本空间对系统进行了特征化。本文的研究内容涉及几何、概率、图论等几个主要方面,并给出了一些解决此类问题的基本方法,最终形成了求解此类问题的精细线性算法。随着研究的深入,我们的讨论将展示出更普遍的意义和更健壮的特性,为我们在更流行的复杂系统中的具体应用提供清晰的思路或概念。

英文摘要:

We study an ancient problem that in a static or dynamical system, sought an optimal path, which the context always means within an extremal condition. In fact, through those discussions about this theme, we established a universal essential calculated model to serve for these complex systems. Meanwhile we utilize the sample space to character the system. These contents in this paper would involve in several major areas including the geometry, probability, graph algorithms and some prior approaches, which stands the ultimately subtle linear algorithm to solve this class problem. Along with our progress, our discussion would demonstrate more general meaning and robust character, which provides clear ideas or notion to support our concrete applications, who work in a more popular complex system.

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

↑