Yayınlanmış 1 Ocak 2025 | Sürüm v1
Dergi makalesi Açık

Proximal motion planning algorithms

  • 1. Ege Univ, Dept Math, Izmir, Turkiye

Açıklama

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.

Dosyalar

bib-9279daf2-facb-42ee-9370-337c9050d00e.txt

Dosyalar (110 Bytes)

Ad Boyut Hepisini indir
md5:85522936feed2b2b7f4fa67f846f6097
110 Bytes Ön İzleme İndir