{'fraction_non_alphanumeric': 0.017482517482517484, 'fraction_numerical': 0.0011655011655011655, 'mean_word_length': 4.924137931034482, '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 of nonholonomic flying robots using a new virtual obstacle method

This paper presents a method for planning near-optimal collision-free path between two pre-specified points with given orientations for nonholonomic flying robots or UAVs navigating in a 3D space amid obstacles. The proposed method is based on the Fast Marching Method (FMM), which uses a first order numerical approximation of the Eikonal equation. The FMM is combined with average filter, B-spline functions and a new tool called Virtual Obstacle to guarantee smoothness of the produced path. The Virtual Obstacle is in the form of a torus to adjust the path with orientation of the flying robot at the start and goal points. Experimental results showed that the proposed method can find near-optimal paths with maximum curvatures less than the robot's minimum flying radius.