Protected Online Path Planning for UAVs over Congested Areas Within Convex Regions of Obstacle-Free Space

Author(s):  
Markus Ortlieb ◽  
Florian-Michael Adolf ◽  
Florian Holzapfel
2019 ◽  
Vol 16 (6) ◽  
pp. 172988141988674
Author(s):  
Jonghoek Kim

This article introduces time-efficient path planning algorithms handling both path length and safety within a reasonable computational time. The path is planned considering the robot’s size so that as the robot traverses the constructed path, it doesn’t collide with an obstacle boundary. This article introduces two virtual robots deploying virtual nodes which discretize the obstacle-free space into a topological map. Using the topological map, the planner generates a safe and near-optimal path within a reasonable computational time. It is proved that our planner finds a safe path to the goal in finite time. Using MATLAB simulations, we verify the effectiveness of our path planning algorithms by comparing it with the rapidly-exploring random tree (RRT)-star algorithm in three-dimensional environments.


Electronics ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 201 ◽  
Author(s):  
Hadi Jahanshahi ◽  
Mohsen Jafarzadeh ◽  
Naeimeh Najafizadeh Sari ◽  
Viet-Thanh Pham ◽  
Van Van Huynh ◽  
...  

This paper discusses the real-time optimal path planning of autonomous humanoid robots in unknown environments regarding the absence and presence of the danger space. The danger is defined as an environment which is not an obstacle nor free space and robot are permitted to cross when no free space options are available. In other words, the danger can be defined as the potentially risky areas of the map. For example, mud pits in a wooded area and greasy floor in a factory can be considered as a danger. The synthetic potential field, linguistic method, and Markov decision processes are methods which have been reviewed for path planning in a free-danger unknown environment. The modified Markov decision processes based on the Takagi–Sugeno fuzzy inference system is implemented to reach the target in the presence and absence of the danger space. In the proposed method, the reward function has been calculated without the exact estimation of the distance and shape of the obstacles. Unlike other existing path planning algorithms, the proposed methods can work with noisy data. Additionally, the entire motion planning procedure is fully autonomous. This feature makes the robot able to work in a real situation. The discussed methods ensure the collision avoidance and convergence to the target in an optimal and safe path. An Aldebaran humanoid robot, NAO H25, has been selected to verify the presented methods. The proposed methods require only vision data which can be obtained by only one camera. The experimental results demonstrate the efficiency of the proposed methods.


2013 ◽  
Vol 385-386 ◽  
pp. 1835-1838
Author(s):  
Xi Jun Wu ◽  
Kai Yan Li ◽  
Hai Long Liu

The layout of parts is vital for a prototype, its rationality can be analyzed by generating maintenance path of removable parts. Based on the coordinate-oriented algorithm, a path-planning method for removable parts in a prototype was presented. Firstly, The entire product environment was classified into two parts of the free space and limited space. Secondly, software about maintenance path generation was produced. Lastly, the feasibility of the algorithm and software was confirmed by application in a prototype.


2020 ◽  
Vol 17 (1) ◽  
pp. 172988141989478 ◽  
Author(s):  
Zhaoying Li ◽  
Zhao Zhang ◽  
Hao Liu ◽  
Liang Yang

Free space algorithms are kind of graphics-based methods for path planning. With previously known map information, graphics-based methods have high computational efficiency in providing a feasible path. However, the existing free space algorithms do not guarantee the global optimality because they always search in one connected domain but not all the possible connected domains. To overcome this drawback, this article presents an improved free space algorithm based on map decomposition with multiple connected domains and artificial bee colony algorithm. First, a decomposition algorithm of single-connected concave polygon is introduced based on the principle of concave polygon convex decomposition. Any map without obstacle is taken as single-connected concave polygon (the convex polygon map can be seen as already decomposed and will not be discussed here). Single concave polygon can be decomposed into convex polygons by connecting concave points with their visible vertex. Second, decomposition algorithm for multi-connected concave polygon (any map with obstacles) is designed. It can be converted into single-connected concave polygon by excluding obstacles using virtual links. The map can be decomposed into several convex polygons which form multiple connected domains. Third, artificial bee colony algorithm is used to search the optimal path in all the connected domains so as to avoid falling into the local minimum. Numerical simulations and comparisons with existing free space algorithm and rapidly exploring random tree star algorithm are carried out to evaluate the performance of the proposed method. The results show that this method is able to find the optimal path with high computational efficiency and accuracy. It has advantages especially for complex maps. Furthermore, parameter sensitivity analysis is provided and the suggested values for parameters are given.


1990 ◽  
Author(s):  
Kenneth F. Hughes ◽  
Alade Tokuta

Sign in / Sign up

Export Citation Format

Share Document