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

基于层次聚类的机器人协调导航

Coordinated Robot Navigation via Hierarchical Clustering

University of Pennsylvania(宾夕法尼亚大学)

Omur Arslan, Dan P. Guralnik, Daniel E. Koditschek

摘要:

我们介绍了使用层次聚类轻松,确定性的协调和控制多个机器人。传统的无监督学习方法,层次聚类提供了一种形式主义的识别和表示空间内聚和隔离的机器人组在不同的分辨率,通过相关的配置的连续空间的组合空间的树。我们形式化和利用这种关系,开发计算有效的反应式算法,通过组合空间导航与几何实现的层次聚类方法的特定选择。这些结构产生计算有效的矢量场规划的层次不变,以及过渡导航的配置空间。我们将这些方法应用于集中式协调和控制的$n$完美地感测和致动的欧几里德领域中的$d$维的环境空间(任意$n$和$d$)。给定一个所需的配置,支持所需的层次结构,我们构造了一个混合控制器,这是二次的$n$和代数的$d$,并证明其执行带来的所有措施,但零集的初始配置所需的目标,保证沿途没有冲突。

英文摘要:

We introduce the use of hierarchical clustering for relaxed, deterministic coordination and control of multiple robots. Traditionally an unsupervised learning method, hierarchical clustering offers a formalism for identifying and representing spatially cohesive and segregated robot groups at different resolutions by relating the continuous space of configurations to the combinatorial space of trees. We formalize and exploit this relation, developing computationally effective reactive algorithms for navigating through the combinatorial space in concert with geometric realizations for a particular choice of hierarchical clustering method. These constructions yield computationally effective vector field planners for both hierarchically invariant as well as transitional navigation in the configuration space. We apply these methods to the centralized coordination and control of $n$ perfectly sensed and actuated Euclidean spheres in a $d$-dimensional ambient space (for arbitrary $n$ and $d$). Given a desired configuration supporting a desired hierarchy, we construct a hybrid controller which is quadratic in $n$ and algebraic in $d$ and prove that its execution brings all but a measure zero set of initial configurations to the desired goal with the guarantee of no collisions along the way.

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

↑