Efficient Two-phase 3D Motion Planning for Small Fixed-wing UAVs

Author(s):  
Myung Hwangbo ◽  
James Kuffner ◽  
Takeo Kanade
Keyword(s):  
Author(s):  
Matthias Fischer ◽  
Hendrik Renken ◽  
Christoph Laroque ◽  
Guido Schaumann ◽  
Wilhelm Dangelmaier

Author(s):  
Pal Liljeback ◽  
Kristin Y. Pettersen ◽  
Oyvind Stavdahl ◽  
Jan Tommy Gravdahl

Author(s):  
Kai Zhang ◽  
Yi Yang ◽  
Mengyin Fu ◽  
Meiling Wang

This paper presents a search-based global motion planning method, called the two-phase A*, with an adaptive heuristic weight. This method is suitable for planning a global path in real time for a car-like vehicle in both indoor and outdoor environments. In each planning cycle, the method first estimates a proper heuristic weight based on the hardness of the planning query. Then, it finds a nearly optimal path subject to the non-holonomic constraints using an improved A* with a weighted heuristic function. By estimating the heuristic weight dynamically, the two-phase A* is able to adjust the optimality level of its path based on the hardness of the planning query. Therefore, the two-phase A* sacrifices little planning optimality, and its computation time is acceptable in most situations. The two-phase A* has been implemented and tested in the simulations and real-world experiments over various task environments. The results show that the two-phase A* can generate a nearly optimal global path dynamically, which satisfies the non-holonomic constraints of a car-like vehicle and reduces the total navigation time.


2021 ◽  
pp. 027836492199278
Author(s):  
Luke Shimanuki ◽  
Brian Axelrod

We consider the problem of motion planning in the presence of uncertain obstacles, modeled as polytopes with Gaussian-distributed faces (PGDFs). A number of practical algorithms exist for motion planning in the presence of known obstacles by constructing a graph in configuration space, then efficiently searching the graph to find a collision-free path. We show that such an exact algorithm is unlikely to be practical in the domain with uncertain obstacles. In particular, we show that safe 2D motion planning among PGDF obstacles is [Formula: see text]-hard with respect to the number of obstacles, and remains [Formula: see text]-hard after being restricted to a graph. Our reduction is based on a path encoding of MAXQHORNSAT and uses the risk of collision with an obstacle to encode variable assignments and literal satisfactions. This implies that, unlike in the known case, planning under uncertainty is hard, even when given a graph containing the solution. We further show by reduction from [Formula: see text]-SAT that both safe 3D motion planning among PGDF obstacles and the related minimum constraint removal problem remain [Formula: see text]-hard even when restricted to cases where each obstacle overlaps with at most a constant number of other obstacles.


Author(s):  
Yan-Jiang Zhao ◽  
Bardia Konh ◽  
Mohammad Honarvar ◽  
Felix Orlando Maria Joseph ◽  
Tarun K. Podder ◽  
...  

Author(s):  
Fang Liao ◽  
Shupeng Lai ◽  
Yuchao Hu ◽  
Jinqiang Cui ◽  
Jian Liang Wang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document