Abstract
In the paper, we study a digital topological complexity of a digital map and its properties. Firstly, we discuss a strong digital homotopy which allows iterative algorithms based on our previous work. As a generalization of the topological complexity in terms of the strong digital homotopy (we call it strong digital topological complexity), we next study the strong digital f-sectional category of a strong digital fibration. Then we investigate estimates of the upper and lower bounds for the strong digital topological complexity of digital maps. We also reveal the difference between the strong digital topological complexity and the ordinary digital ones. It has shown that the strong digital topological complexity is more similar to the classical continuous case than the ordinary digital ones. Moreover, arising from practical considerations in robotics, we consider the naive digital topological complexity of digital maps.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
