Navigating the Labyrinth: The Mixed Chinese Postman Problem and Its SLAM Algorithm Application

Abstract

Autonomous mobile systems exploring unknown environments face the challenge of optimizing their routes to minimize time and distance traveled. This paper explores integrating SLAM algorithms with optimized routing techniques to address the Mixed Chinese Postman Problem (MCPP). The MCPP arises when a robot aims to efficiently explore an area by determining the most optimal path that covers all edges of a graph while minimizing traversal distances. A key contribution of this paper is introducing an easy-to-implement solution for the MCPP in the context of autonomous mobile systems. We discuss the integration of this solution within the SLAM framework, highlighting its compatibility and effectiveness in real-world scenarios.