【24h】

STRING TOPOLOGICAL ROBOTICS

机译:字符串拓扑机器人

获取原文
获取原文并翻译 | 示例
           

摘要

We claim here to link two well known theories; namely the string topology (founded by Chas and Sullivan in [3]) and the topological robotics (founded by Farber some few years later, in [7]). For our purpose, we consider G a compact Lie group acting transitively on a path connected n-manifold X. On the set M~(LP)(X) of the so-called loop motion planning algorithms, we define and discuss the notion of transversality. Firstly, we define an intersection loop motion planning product at level of chains of M~(LP)(X). Secondly, we define a boundary operator on the chains of M~(LP)(X) and extend this intersection product at level of homology to a string loop motion planning product. Finally, we show that this string product induces on the shifted string loop motion planning homology H*(M~(LP) (X)):= H_(*+2n)(M~(LP)(X)) a structure of an associative and commutative graded algebra (acga). By the end, we ask how one may extend this acga-structure to a structure of Gerstenhaber algebra or that of a Batalin-Vilkovisky algebra. Some ideas will be suggested.
机译:我们在这里声称将两种众所周知的理论联系起来。即字符串拓扑(由Chas和Sullivan在[3]中创建)和拓扑机器人技术(由Farber在几年后,在[7]中创建)。出于我们的目的,我们将G视为一个紧凑的Lie群,该群在与n个流形X相连的路径上传递性地起作用。横向性。首先,我们在M〜(LP)(X)的链层次上定义了一个相交环运动规划产品。其次,我们在M〜(LP)(X)的链上定义了一个边界算子,并将这个相交产物在同一个层次上扩展为一个字符串循环运动计划产物。最后,我们证明了该弦积在移位的弦环运动规划同源性上引起了H *(M〜(LP)(X)):= H _(* + 2n)(M〜(LP)(X))的结构关联和可交换的渐变代数(acga)。最后,我们问一个人如何将这种acga结构扩展为Gerstenhaber代数或Batalin-Vilkovisky代数的结构。将提出一些想法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号