Yu, H.Liang, L.Shi, P.Jiang, Q.2021-09-102021-09-102021Journal of Intelligent and Robotic Systems: theory and applications, 2021; 101(1):3-1-3-140921-02961573-0409http://hdl.handle.net/2440/131953Published online: 8 December 2020Roadmap is important in typical robotic applications and it is not a trivial task to obtain in unknown space. In this paper, we propose a novel approach to calculate the roadmap that is robust against noisy environmental contours and the movement of the robot. In order to obtain full visibility to space, we design a direct space partitioning approach to produce the roadmap. It uses readings from rangefinders to establish sequential polygons in time, and as the robot moves, intersections among polygons are iteratively obtained. After iterations of updates, we obtain a number of polygons with stable forms. Based on the connections among the polygons, we obtain a roadmap and propose a routing algorithm to calculate paths between points in space. Simulation examples are provided to demonstrate the performance of the proposed approach.en© Springer Nature B.V. 2020Space partitioning; Roadmap; Routing algorithm; Environmental contoursJournal article100003858810.1007/s10846-020-01271-42-s2.0-85097265250570701Shi, P. [0000-0001-6295-0405] [0000-0001-8218-586X] [0000-0002-0864-552X] [0000-0002-1358-2367] [0000-0002-5312-5435]