Self-organizing map for determination of goal candidates in mobile robot exploration


This paper addresses a problem of determining goal candidates in the frontier-based mobile robot exploration. The proposed solution is based on self-organizing map for the traveling salesman problem with neighborhoods and it allows to study the exploration formulated as a problem of repeated coverage of the current frontiers where the minimal number of goal… (More)


3 Figures and Tables

Slides referencing similar topics