{'fraction_non_alphanumeric': 0.019953952417498082, 'fraction_numerical': 0.0, 'mean_word_length': 4.927272727272728, '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}}
Time-optimal trajectories with bounded curvature in anisotropic media

This paper characterizes time-optimal trajectories in anisotropic (direction-dependent) environments where path curvatures are bounded by the inverse of the minimum-turning radius of a mobile agent. Such problems are often faced in the navigation of aerial, ground and naval vehicles when a mobile agent cannot instantaneously change its heading angle. The work presented is a generalization of the Dubins car problem, which considers the fastest paths with bounded curvature while assuming constant speed and minimum-turning radius. We relax this assumption and discuss fastest-path finding problems for the generalized direction-dependent speed and minimum-turning radius functions, to account for the effects of waves, winds and slope of the terrain on the agent’s motions. We establish that there exists an optimal path such that it is a portion of a path of the type CSCSC where C denotes a sharpest-turn curve and S a straight-line segment. We further analyze a special case wherein the speed polar plot is convex, and show that in that case there exists an optimal path with the same structure as for the Dubins problem: CCC or CSC . An algorithm that implements our results for the convex speed polar plot is also presented.