CWave: High-performance single-source any-angle path planning on a grid

Author(s):  
Dmitry A. Sinyukov ◽  
Taskin Padir
Robotica ◽  
2019 ◽  
Vol 38 (2) ◽  
pp. 207-234
Author(s):  
Dmitry A. Sinyukov ◽  
Taşkin Padir

SummaryPath planning on a two-dimensional grid is a well-studied problem in robotics. It usually involves searching for a shortest path between two vertices on a grid given that some of the grid cells are impassable (occupied by obstacles). Single-source path planning finds shortest paths from a given source vertex to all other vertices of the grid. Singles-source path planning enhances robot autonomy by calculating multiple possible paths for various navigation scenarios when the destination state is unknown. A high-performance algorithm for single-source any-angle path planning on a grid called CWave is proposed here. Any-angle attribute implies that the algorithm calculates paths which can include line segments at any angle, as opposed to standard A* that runs on an 8-connected graph, which permits turns with 45° increments only. The key idea of CWave is to abandon the graph model and operate directly on the grid geometry using discrete geometric primitives (instead of individual vertices) to represent the wave front. In its most basic form (CWaveInt), CWave requires only integer arithmetics. CWaveInt, however, can accumulate the distance error at turning points. A modified version of CWave (CWaveFpuSrc) with minimal usage of floating-point calculations is also developed to eliminate any accumulative errors, which is proven mathematically and experimentally on several maps. The performance of the algorithm on most of the tested maps is demonstrated to be significantly faster than that of Theta*, Lazy Theta*, Field A*, ANYA, Block A*, and A* adapted for single-source planning (on maps with lower number of isolated obstacles, CWaveFpuSrc is 2−3 times faster than its fastest tested alternative Block A*). An N-threaded implementation (CWaveN) of CWave is presented and tested to demonstrate an improved performance (multithreaded implementation is 1.5−3 times faster than single-threaded CWave). The paper discusses foundations and experimental validation of CWave, and presents future work to address the limitations of the current implementations and obtain further performance enhancements.


Author(s):  
Ho-Hoon Lee

This paper proposes a path planning strategy for high-performance anti-swing control of overhead cranes, where the anti-swing control problem is solved as a kinematic problem. First, two anti-swing control laws, one for hoisting up and the other for hoisting down, are proposed based on the Lyapunov stability theorem. Then a new path-planning strategy is proposed based on the concept of minimum-time control and the proposed anti-swing control laws. The proposed path planning is free from the usual constraints of small load swing, slow hoisting speed, and small hoisting distance. The effectiveness of the proposed path planning is shown by computer simulation with high hoisting speed and hoisting ratio.


2011 ◽  
Vol 328-330 ◽  
pp. 1881-1886
Author(s):  
Cen Zeng ◽  
Qiang Zhang ◽  
Xiao Peng Wei

Genetic algorithm (GA), a kind of global and probabilistic optimization algorithms with high performance, have been paid broad attentions by researchers world wide and plentiful achievements have been made.This paper presents a algorithm to develop the path planning into a given search space using GA in the order of full-area coverage and the obstacle avoiding automatically. Specific genetic operators (such as selection, crossover, mutation) are introduced, and especially the handling of exceptional situations is described in detail. After that, an active genetic algorithm is introduced which allows to overcome the drawbacks of the earlier version of Full-area coverage path planning algorithms.The comparison between some of the well-known algorithms and genetic algorithm is demonstrated in this paper. our path-planning genetic algorithm yields the best performance on the flexibility and the coverage. This meets the needs of polygon obstacles. For full-area coverage path-planning, a genotype that is able to address the more complicated search spaces.


2013 ◽  
Vol 9 (2) ◽  
pp. 620-629 ◽  
Author(s):  
Ciro Attaianese ◽  
Mauro Di Monaco ◽  
Giuseppe Tomasso

2016 ◽  
Vol 6 (1) ◽  
Author(s):  
Ping Fan ◽  
Di Gu ◽  
Guang-Xing Liang ◽  
Jing-Ting Luo ◽  
Ju-Long Chen ◽  
...  

ChemCatChem ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 885-892 ◽  
Author(s):  
Phil Preikschas ◽  
Julia Bauer ◽  
Xing Huang ◽  
Shenglai Yao ◽  
Raoul Naumann d'Alnoncourt ◽  
...  

Sensors ◽  
2021 ◽  
Vol 21 (22) ◽  
pp. 7667
Author(s):  
Javier Maldonado-Romo ◽  
Mario Aldape-Pérez ◽  
Alejandro Rodríguez-Molina

Increasingly, robotic systems require a level of perception of the scenario to interact in real-time, but they also require specialized equipment such as sensors to reach high performance standards adequately. Therefore, it is essential to explore alternatives to reduce the costs for these systems. For example, a common problem attempted by intelligent robotic systems is path planning. This problem contains different subsystems such as perception, location, control, and planning, and demands a quick response time. Consequently, the design of the solutions is limited and requires specialized elements, increasing the cost and time development. Secondly, virtual reality is employed to train and evaluate algorithms, generating virtual data. For this reason, the virtual dataset can be connected with the authentic world through Generative Adversarial Networks (GANs), reducing time development and employing limited samples of the physical world. To describe the performance, metadata information details the properties of the agents in an environment. The metadata approach is tested with an augmented reality system and a micro aerial vehicle (MAV), where both systems are executed in an authentic environment and implemented in embedded devices. This development helps to guide alternatives to reduce resources and costs, but external factors limit these implementations, such as the illumination variation, because the system depends on only a conventional camera.


Sign in / Sign up

Export Citation Format

Share Document