路径优化滑轮
Path Optimization Sheaves
摘要:
出于将层纳入网络的努力,我们试图重新解释寻路算法的细胞层,使用Dijkstra的算法作为一个例子。我们在一个有区别的源顶点和汇顶点的图上构造层,其中路径用截面表示。第一层是一个非常通用的结构,可以应用于其他算法,而第二层是专门为捕捉Dijkstra算法的决策而创建的。在这两种情况下,Dijkstra算法可以被描述为将局部部分扩展到全局部分的系统过程。我们讨论了这两个层之间的关系,并总结了其他寻路算法可以以类似的方式解释。虽然这里提出的层地址路径和寻路算法,我们建议未来的工作可以探索从图论和其他网络算法的其他概念的连接。这项工作在2020年夏天得到了NASA实习项目和SCaN实习项目的支持。
英文摘要:
Motivated by efforts to incorporate sheaves into networking, we seek to reinterpret pathfinding algorithms in terms of cellular sheaves, using Dijkstra's algorithm as an example. We construct sheaves on a graph with distinguished source and sink vertices, in which paths are represented by sections. The first sheaf is a very general construction that can be applied to other algorithms, while the second is created specifically to capture the decision making of Dijkstra's algorithm. In both cases, Dijkstra's algorithm can be described as a systematic process of extending local sections to global sections. We discuss the relationship between the two sheaves and summarize how other pathfinding algorithms can be interpreted in a similar way. While the sheaves presented here address paths and pathfinding algorithms, we suggest that future work could explore connections to other concepts from graph theory and other networking algorithms. This work was supported by the NASA Internship Project and SCaN Internship Project during the summer of 2020.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。