Mobile robot for map generation and its operating method

Map-generating robot that determines the next exploration point by comparing boundary point groups

This technology is a map generation algorithm that optimizes exploration efficiency by segmenting a generated 2D map, grouping boundary points between scanned and unscanned areas, and assigning movement priorities within the current segment.

Existing mobile robots often suffer from inefficiencies, such as repeatedly traversing the same areas or unnecessarily increasing travel distance, because they dynamically adjust their paths based solely on nearby boundary points.

This technology applies a positioning logic that divides a 2D map into segments and groups boundary points, prioritizing the exploration of boundary point groups within the current segment and only setting a path to another segment when no boundary points remain in the current area.

‍

‍

Key Features:

• A scanning unit that scans the surrounding space from a first position, and a map generation unit that creates a 2D map of the surrounding space based on the scan results.
• A map segmentation unit that divides the generated 2D map into a plurality of segment areas.
• A boundary point detection unit that detects and groups boundary points between scanned and unscanned areas to generate a plurality of boundary point groups.
• A movement positioning unit that compares boundary point groups to determine a second position for the mobile robot to move to.

‍