{'fraction_non_alphanumeric': 0.020497803806734993, 'fraction_numerical': 0.0, 'mean_word_length': 5.275229357798165, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, '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}}
Path planning methods for mobile robots with linear programming

In this paper, the path planning method with two different obstacle avoiding models are proposed to solve the target pursuit and obstacle avoid problem (TPOA). Both of the models are originated from linear programming (LP). One model introduced integer variable to describe the relative position of robot and obstacles, then MILP based obstacle-avoided model is built; the other used a tangent line to define the feasible and infeasible region of robot in obstacle area, thus LP based obstacle-avoided constraints are given. Simulations are demonstrated comparatively to show the effectiveness of the proposed methods.