scholarly journals Regarding Jump Point Search and Subgoal Graphs

Author(s):  
Daniel D. Harabor ◽  
Tansel Uras ◽  
Peter J. Stuckey ◽  
Sven Koenig

In this paper, we define Jump Point Graphs (JP), a preprocessing-based path-planning technique similar to Subgoal Graphs (SG). JP allows for the first time the combination of Jump Point Search style pruning in the context of abstraction-based speedup techniques, such as Contraction Hierarchies. We compare JP with SG and its variants and report new state-of-the-art results for grid-based pathfinding.

2020 ◽  
Author(s):  
Tauã Cabreira ◽  
Lisane Brisolara ◽  
Paulo Ferreira Jr.

Coverage Path Planning (CPP) problem is a motion planning subtopic in robotics, where it is necessary to build a path for a robot to explore every location in a given scenario. Unmanned Aerial Vehicles (UAV) have been employed in several applications related to the CPP problem. However, one of the significant limitations of UAVs is endurance, especially in multi-rotors. Minimizing energy consumption is pivotal to prolong and guarantee coverage. Thus, this work proposes energy-aware coverage path planning solutions for regular and irregular-shaped areas containing full and partial information. We consider aspects such as distance, time, turning maneuvers, and optimal speed in the UAV’s energy consumption. We propose an energy-aware spiral algorithm called E-Spiral to perform missions over regular-shaped areas. Next, we explore an energy-aware grid-based solution called EG-CPP for mapping missions over irregular-shaped areas containing no-fly zones. Finally, we present an energy-aware pheromone-based solution for patrolling missions called NC-Drone. The three novel approaches successfully address different coverage path planning scenarios, advancing the state-of-the-art in this area.


2021 ◽  
Vol 70 ◽  
pp. 631-681
Author(s):  
Yue Hu ◽  
Daniel Harabor ◽  
Long Qin ◽  
Quanjun Yin

Jump Point Search (JPS) is a well known symmetry-breaking algorithm that can substantially improve performance for grid-based optimal pathfinding. When the input grid is static further speedups can be obtained by combining JPS with goal bounding techniques such as Geometric Containers (instantiated as Bounding Boxes) and Compressed Path Databases. Two such methods, JPS+BB and Two-Oracle Path PlannING (Topping), are currently among the fastest known approaches for computing shortest paths on grids. The principal drawback for these algorithms is the overhead costs: each one requires an all-pairs precomputation step, the running time and subsequent storage costs of which can be prohibitive. In this work we consider an alternative approach where we precompute and store goal bounding data only for grid cells which are also jump points. Since the number of jump points is usually much smaller than the total number of grid cells, we can save up to orders of magnitude in preprocessing time and space. Considerable precomputation savings do not necessarily mean performance degradation. For a second contribution we show how canonical orderings, partial expansion strategies and enhanced intermediate pruning can be leveraged to improve online query performance despite a reduction in preprocessed data. The combination of faster preprocessing and stronger online reasoning leads to three new and highly performant algorithms: JPS+BB+ and Two-Oracle Pathfinding Search (TOPS) based on search, and Topping+ based on path extraction. We give a theoretical analysis showing that each method is complete and optimal. We also report convincing gains in a comprehensive empirical evaluation that includes almost all current and cutting-edge algorithms for grid-based pathfinding.


2021 ◽  
Author(s):  
Yunliang Wang ◽  
Sai Zhang ◽  
Yanjuan Wu ◽  
Yiwen Zhao ◽  
Jian Wang

2021 ◽  
Author(s):  
Yucong Tong ◽  
Huaiyu Wu ◽  
Xiujuan Zheng ◽  
Yang Chen ◽  
Zhihuan Chen

Sign in / Sign up

Export Citation Format

Share Document