Hadi Hassanzada, Hamid Torabi, Hanieh Mirebrahimi, Ameneh Babaee
{"title":"离散运动规划的离散拓扑复杂性","authors":"Hadi Hassanzada, Hamid Torabi, Hanieh Mirebrahimi, Ameneh Babaee","doi":"10.1016/j.topol.2025.109634","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we present a framework for discrete motion planning tailored for robots that operate in a discrete manner. Furthermore, we extend the concept of <em>r</em>-discrete homotopy as discrete <span><math><mo>(</mo><mi>s</mi><mo>,</mo><mi>r</mi><mo>)</mo></math></span>-homotopy. Utilizing this framework, we investigate the notion of discrete topological complexity, which is defined as the least number of motion planning algorithms necessary for discrete movement. We establish several properties related to discrete topological complexity; for example, we demonstrate that discrete motion planning within a metric space <em>X</em> is feasible if and only if <em>X</em> is a discrete contractible space. Additionally, we show that the discrete topological complexity is solely determined by the strictly discrete homotopy type of the spaces involved.</div></div>","PeriodicalId":51201,"journal":{"name":"Topology and its Applications","volume":"377 ","pages":"Article 109634"},"PeriodicalIF":0.5000,"publicationDate":"2025-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A discrete topological complexity of discrete motion planning\",\"authors\":\"Hadi Hassanzada, Hamid Torabi, Hanieh Mirebrahimi, Ameneh Babaee\",\"doi\":\"10.1016/j.topol.2025.109634\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In this paper, we present a framework for discrete motion planning tailored for robots that operate in a discrete manner. Furthermore, we extend the concept of <em>r</em>-discrete homotopy as discrete <span><math><mo>(</mo><mi>s</mi><mo>,</mo><mi>r</mi><mo>)</mo></math></span>-homotopy. Utilizing this framework, we investigate the notion of discrete topological complexity, which is defined as the least number of motion planning algorithms necessary for discrete movement. We establish several properties related to discrete topological complexity; for example, we demonstrate that discrete motion planning within a metric space <em>X</em> is feasible if and only if <em>X</em> is a discrete contractible space. Additionally, we show that the discrete topological complexity is solely determined by the strictly discrete homotopy type of the spaces involved.</div></div>\",\"PeriodicalId\":51201,\"journal\":{\"name\":\"Topology and its Applications\",\"volume\":\"377 \",\"pages\":\"Article 109634\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2025-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Topology and its Applications\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0166864125004328\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Topology and its Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166864125004328","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
A discrete topological complexity of discrete motion planning
In this paper, we present a framework for discrete motion planning tailored for robots that operate in a discrete manner. Furthermore, we extend the concept of r-discrete homotopy as discrete -homotopy. Utilizing this framework, we investigate the notion of discrete topological complexity, which is defined as the least number of motion planning algorithms necessary for discrete movement. We establish several properties related to discrete topological complexity; for example, we demonstrate that discrete motion planning within a metric space X is feasible if and only if X is a discrete contractible space. Additionally, we show that the discrete topological complexity is solely determined by the strictly discrete homotopy type of the spaces involved.
期刊介绍:
Topology and its Applications is primarily concerned with publishing original research papers of moderate length. However, a limited number of carefully selected survey or expository papers are also included. The mathematical focus of the journal is that suggested by the title: Research in Topology. It is felt that it is inadvisable to attempt a definitive description of topology as understood for this journal. Certainly the subject includes the algebraic, general, geometric, and set-theoretic facets of topology as well as areas of interactions between topology and other mathematical disciplines, e.g. topological algebra, topological dynamics, functional analysis, category theory. Since the roles of various aspects of topology continue to change, the non-specific delineation of topics serves to reflect the current state of research in topology.
At regular intervals, the journal publishes a section entitled Open Problems in Topology, edited by J. van Mill and G.M. Reed. This is a status report on the 1100 problems listed in the book of the same name published by North-Holland in 1990, edited by van Mill and Reed.