{'fraction_non_alphanumeric': 0.028293545534924844, 'fraction_numerical': 0.022988505747126436, 'mean_word_length': 5.21978021978022, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 1, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Navigation of a mobile robot formulated in terms of discrete optimization problems

The problem of navigation of an autonomous mobile robot has a great variety of solutions, depending on the premise conditions regarding the properties of the robot, the surrounding environment, and the user specifications. In support of a navigation scheme that can cope flexibly with this variety, this paper proposes a method that formulates the problem in terms of discrete optimization problems. In the proposed method, the problem of robot position/posture estimation from map and sensor data and the problem of deciding the action at each instant are formulated as separate discrete optimization problems. In the former, our approach is an approximation of the Markov localization algorithm. The proposed method is then applied to a navigation problem in a known environment with fixed obstacles, and the effectiveness and feasibility of the method are verified by simulation results. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(6): 59–68, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10439