Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Equivalent Environments and Covering Spaces for Robots (2402.18323v1)

Published 28 Feb 2024 in cs.RO, math.DS, math.GN, and math.GT

Abstract: This paper formally defines a robot system, including its sensing and actuation components, as a general, topological dynamical system. The focus is on determining general conditions under which various environments in which the robot can be placed are indistinguishable. A key result is that, under very general conditions, covering maps witness such indistinguishability. This formalizes the intuition behind the well studied loop closure problem in robotics. An important special case is where the sensor mapping reports an invariant of the local topological (metric) structure of an environment because such structure is preserved by (metric) covering maps. Whereas coverings provide a sufficient condition for the equivalence of environments, we also give a necessary condition using bisimulation. The overall framework is applied to unify previously identified phenomena in robotics and related fields, in which moving agents with sensors must make inferences about their environments based on limited data. Many open problems are identified.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (36)
  1. V. Braitenberg. Vehicles: Experiments in synthetic psychology. MIT Press, 1984.
  2. C. Chen and H. Wang. Appearance-based topological bayesian inference for loop-closing detection in a cross-country environment. The International Journal of Robotics Research, 25(10):953–983, October 2006.
  3. Topological (bi-)simulation. Electronic Notes in Theoretical Computer Science, 100:49–64, October 2004.
  4. J. M. Davoren. Topologies, continuity and bisimulations. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, 33(4-5):357–381, 1999.
  5. “Where” and “what” in the whisker sensorimotor system. Nature Reviews Neuroscience, 9(8):601–612, August 2008.
  6. A solution to the simultaneous localisation and map building (SLAM) problem. IEEE Transactions on Robotics & Automation, 17(3):229–241, 2001.
  7. Deep pose graph-matching-based loop closure detection for semantic visual slam. Sustainability, 14(19):11864, September 2022.
  8. Direct sparse odometry. IEEE Transactions on Pattern Analysis and Machine Intelligence, 40(3):611–625, 2018.
  9. Why flying insects gather at artificial light. Nature Communications, 15(1), January 2024.
  10. Bisimulation metrics for continuous markov decision processes. SIAM Journal on Computing, 40(6):1662–1714, 2011.
  11. S. Gao. Invariant Descriptive Set Theory. Chapman and Hall/CRC, September 2008.
  12. Ldso: Direct sparse odometry with loop closure. In 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 2198–2204, 2018.
  13. Vision meets robotics: The kitti dataset. The International Journal of Robotics Research, 32(11):1231–1237, August 2013.
  14. J.-S. Gutmann and K. Konolige. Incremental mapping of large cyclic environments. In Proceedings 1999 IEEE International Symposium on Computational Intelligence in Robotics and Automation. CIRA’99 (Cat. No.99EX375), pages 318–325, 1999.
  15. A highly efficient FastSLAM algorithm for generating cyclic maps of large-scale environments from raw laser range measurements. In Proceedings IEEE/RSJ International Conference on Intelligent Robots and Systems, 2003.
  16. A. Hatcher. Algebraic topology. Cambridge University Press (CUP), 2002.
  17. What’s decidable about hybrid automata? In Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, pages 373–382, 1995.
  18. Mapping and pursuit-evasion strategies for a simple wall-following robot. IEEE Transactions on Robotics, 27(1):113–128, February 2011.
  19. A. S. Kechris. Classical Descriptive Set Theory. Springer New York, 1995.
  20. B. Kuipers and Y.-T. Byun. A robust, qualitative method for robot spatial learning. In AAAI Conference on Artificial Intelligence, 1988.
  21. S. M. LaValle. Planning Algorithms. Cambridge University Press, May 2006.
  22. Orb-slam: A versatile and accurate monocular slam system. IEEE Transactions on Robotics, 31(5):1147–1163, 2015.
  23. A mathematical characterization of minimally sufficient robot brains. The International Journal of Robotics Research, September 2023.
  24. S. Sotthibandhu and R. R. Baker. Celestial orientation by the large yellow underwing moth, noctua pronuba l. Animal Behaviour, 27:786–800, August 1979.
  25. Redirected Walking in Mixed Reality Training Applications, page 319–331. Springer New York, 2013.
  26. K. Taylor and S. M. LaValle. Intensity-based navigation with global guarantees. Autonomous Robots, 36(4):349–364, August 2013.
  27. S. Thrun. Learning metric-topological maps for indoor mobile robot navigation. Artificial Intelligence, 99(1):21–71, February 1998.
  28. Sensor Beams, Obstacles, and Possible Paths, page 317–332. Springer Berlin Heidelberg, 2009.
  29. Locally-optimal navigation in multiply-connected environments without geometric maps. In Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453), volume 4, pages 3491–3497 vol.3, 2003.
  30. Distance-optimal navigation in an unknown environment without sensing distances. IEEE Transactions on Robotics, 23(3):506–518, 2007.
  31. Information spaces for mobile robots. In Proceedings of the Fifth International Workshop on Robot Motion and Control, 2005. RoMoCo ’05. IEEE, 2005.
  32. The Revisiting Problem in Simultaneous Localization and Mapping, page 1–33. Springer International Publishing, 2022.
  33. J. van Benthem. Modal Logic for Open Minds. CSLI Publications. Center for the Study of Language and Information, 2010.
  34. An enactivist-inspired mathematical model of cognition. Frontiers in Neurorobotics, 16, September 2022.
  35. An image-to-map loop closing method for monocular slam. In 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, pages 2053–2059, 2008.
  36. Sufficient Conditions for the Existence of Resolution Complete Planning Algorithms, page 303–320. Springer Berlin Heidelberg, 2010.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now