{'fraction_non_alphanumeric': 0.018593371059013743, 'fraction_numerical': 0.0, 'mean_word_length': 5.447916666666667, '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}}
Approximate continuous-time optimal control in obstacle by time/space discretization of non-convex constraints

This paper addresses an approximate version of the optimal control problem with non-convex state constraints via discretization of time and space, where the specific application pursued is the obstacle avoidance problem. First, it is pointed out that the standard continuous-time cost function with the final state fixed is not suitable to the optimal control problem under the non-convex state constraints, and then a new cost function including intermediate target states is proposed. Next, for the optimal control problem with this cost function, where the non-convex state constraints are discretized with respect to time axis and state space, an optimal continuous-time control is given in an explicit form, including the intermediate target states obtained by solving a discrete optimization problem. Efficient algorithms such as the breadth first search algorithm can be applied to this discrete problem. Thus the continuous-time trajectory as well as the discretized state at each discrete time is simultaneously optimized. Finally, we illustrate the effectiveness of the proposed approach with numerical simulations.