vix.ing · top · new · best · stats · spec

On the Targeted Complexity of a Map

2022/09/14 by Seyed Abolfazl Aghili, Aghili, Seyed Abolfazl, Hanıeh Mırebrahımı +3 · 1 citation
Computer Science · Mathematics · #Advanced Topology and Set Theory #Algebraic Topology (math.AT) #FOS: Mathematics #Homotopy and Cohomology in Algebraic Topology #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.2209.06494

openalex publication_date 2022/09/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study the topological complexity of work maps with respect to some subspaces of the configuration space and a workspace considered as the target set of the motion of robots. The motivation is to optimize and reduce the number of motion planners for work maps. In this regard, we focus on the useful set of works. We check some basic properties of the targeted complexity of maps, such as homotopical invariance, reduction, the product of maps, and so on. Then we compare these targeted complexities, and we find some inequalities in reducing the number of motion planners. We show that the relative topological complexity of pair of spaces defined by Short is a special case of the targeted complexity of work maps.

Cited by

Related