Proximal motion planning algorithms
Makaleler > Tam Makale · 2025
Yazarlar: Melih İS, İsmet KARACA
APPLIED GENERAL TOPOLOGY, SCI Expanded İndekslerine Giren Dergi, Uluslararası, Scopus, 2025, cilt 26, ss 131-162
Özet
In this paper, we transfer the problem of measuring navigational complexity in topological spaces to the nearness theory. We investigate the most important component of this problem, the topological complexity number (denoted by TC), with its different versions including relative and higher TC, on the proximal Schwarz genus as well as the proximal (higher) homotopic distance. We outline the fundamental properties of some concepts related to the proximal (or descriptive proximal) TC numbers. In addition, we provide some instances of (descriptive) proximity spaces, specifically on basic robot vacuum cleaners, to illustrate the results given on proximal and descriptive proximal TC.