期刊
MATHEMATICS
卷 9, 期 19, 页码 -出版社
MDPI
DOI: 10.3390/math9192358
关键词
abstract simplicial complex; barycentric subdivision; contiguity of simplicial maps; motion planning; randomized algorithm; homotopic distance
类别
资金
- Secretaria de Investigacion y Posgrado, Instituto Politecnico Nacional [SIP20211847]
The algorithm described and implemented in this paper produces an explicit system of piecewise linear motion planners for an automated guided vehicle by inputting a polyhedron. The cardinality of the output is probabilistically close to the minimal possible cardinality, providing an automated solution for robust robot motion planning. The implementation includes discretizing the homotopic distance concept and computer estimations of other invariants, such as the Lusternik-Schnirelmann category of polyhedra.
We describe and implement a randomized algorithm that inputs a polyhedron, thought of as the space of states of some automated guided vehicle R, and outputs an explicit system of piecewise linear motion planners for R. The algorithm is designed in such a way that the cardinality of the output is probabilistically close (with parameters chosen by the user) to the minimal possible cardinality.This yields the first automated solution for robust-to-noise robot motion planning in terms of simplicial complexity (SC) techniques, a discretization of Farber's topological complexity TC. Besides its relevance toward technological applications, our work reveals that, unlike other discrete approaches to TC, the SC model can recast Farber's invariant without having to introduce costly subdivisions. We develop and implement our algorithm by actually discretizing Macias-Virgos and Mosquera-Lois' notion of homotopic distance, thus encompassing computer estimations of other sectional category invariants as well, such as the Lusternik-Schnirelmann category of polyhedra.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据