journal article·2022-06-13Open access

Improved Analytic Expansions in Hybrid A-Star Path Planning for Non-Holonomic Robots

Chien Van Dang, Heungju Ahn, Doo Seok Lee, Sang C. Lee

Applied Sciences· Volume 12· Issue 12

Abstract

In this study, we concisely investigate two phases in the hybrid A-star algorithm for non-holonomic robots: the forward search phase and analytic expansion phase. The forward search phase considers the kinematics of the robot model in order to plan continuous motion of the robot in discrete grid maps. Reeds-Shepp (RS) curve in the analytic expansion phase augments the accuracy and the speed of the algorithm. However, RS curves are often produced close to obstacles, especially at corners. Consequently, the robot may collide with obstacles through the process of movement at these corners because of the measurement errors or errors of motor controllers. Therefore, we propose an improved RS method to eventually improve the hybrid A-star algorithm’s performance in terms of safety for robots to move in indoor environments. The advantage of the proposed method is that the non-holonomic robot has multiple options of curvature or turning radius to move safer on pathways. To select a safer route among multiple routes to a goal configuration, we introduce a cost function to evaluate the cost of risk of robot collision, and the cost of movement of the robot along the route. In addition, generated paths by the forward search phase always consist of unnecessary turning points. To overcome this issue, we present a fine-tuning of motion primitive in the forward search phase to make the route smoother without using complex path smoothing techniques. In the end, the effectiveness of the improved method is verified via its performance in simulations using benchmark maps where cost of risk of collision and number of turning points are reduced by up to around 20%.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Robotic Path Planning Algorithms · Control and Dynamics of Mobile Robots · Autonomous Vehicle Technology and Safety

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Division of Intelligent Robot, Convergence Research Institute, DGIST, Daegu 42988, Korea

College of Transdisciplinary Studies, DGIST, Daegu 42988, Korea

Funding

DGIST R&D program · Ministry of Science and ICT · DGIST Education Innovation Grant

References (29)

Show source-provided references
1. A Review of Global Path Planning Methods for Occupancy Grid Maps Regardless of Obstacle Density10.1007/s10846-016-0362-z ↗
2. A Survey of Path Planning Algorithms for Mobile Robots10.3390/vehicles3030027 ↗
3. Sánchez-Ibáñez, J.R., Pérez-Del-Pulgar, C.J., and García-Cerezo, A. (2021). Path Planning for Autonomous Mobile Robots: A Review. Sensors, 21.10.3390/s21237898 ↗
4. Fadzli, S.A., Abdulkadir, S.I., Makhtar, M., and Jamal, A.A. (2015, January 14–16). Robotic Indoor Path Planning Using Dijkstra’s Algorithm with Multi-Layer Dictionaries. Proceedings of the International Conference on Information Science and Security (ICISS), Seoul, Korea.10.1109/ICISSEC.2015.7371031 ↗
5. Yang, F., and Chakraborty, N. (2020–31, January 31). Chance Constrained Simultaneous Path Planning and Task Assignment for Multiple Robots with Stochastic Path Costs. Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Paris, France.10.1109/ICRA40945.2020.9197354 ↗
6. Kim, K., Chen, L.H., Cera, B., Daly, M., Zhu, E., Despois, J., Agogino, A.K., SunSpiral, V., and Agogino, A.M. (2016, January 9–14). Hopping and rolling locomotion with spherical tensegrity robots. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Daejeon, Korea.10.1109/IROS.2016.7759643 ↗
7. Zhang, J., Wang, W., Qi, X., and Liao, Z. (2020). Social and Robust Navigation for Indoor Robots Based on Object Semantic Grid and Topological Map. Appl. Sci., 10.10.3390/app10248991 ↗
8. Wei, J., and Liu, J. (2009, January 10–15). Mobile robot path planning with η3-splines using spatial-fitness-sharing variable-length genetic algorithm. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, St. Louis, MO, USA.10.1109/IROS.2009.5354829 ↗
9. Solak, S., Yakut, Ö., and Bolat, E.D. (2020). Design and Implementation of Web-Based Virtual Mobile Robot Laboratory for Engineering Education. Symmetry, 12.10.3390/sym12060906 ↗
10. Molina-Leal, A., Gómez-Espinosa, A., Cabello, J.A.E., Cuan-Urquizo, E., and Cruz-Ramírez, S.R. (2021). Trajectory Planning for a Mobile Robot in a Dynamic Environment Using an LSTM Neural Network. Appl. Sci., 11.10.3390/app112210689 ↗
11. Luan, P.G., and Thinh, N.T. (2020). Real-Time Hybrid Navigation System-Based Path Planning and Obstacle Avoidance for Mobile Robots. Appl. Sci., 10.10.3390/app10103355 ↗
12. Motion planning approach for car-like robots in unstructured scenario10.1177/0142331221994393 ↗
13. Ravankar, A., Ravankar, A.A., Kobayashi, Y., Hoshino, Y., and Peng, C.C. (2018). Path Smoothing Techniques in Robot Navigation: State-of-the-Art, Current and Future Challenges. Sensors, 18.10.3390/s18093170 ↗
14. Mazzalai, A., Biral, F., Lio, M.D., Darin, M., and D’Orazio, L. (2015, January 15–18). Automated Crossing of Intersections Controlled by Traffic Lights. Proceedings of the IEEE 18th International Conference on Intelligent Transportation Systems, Gran Canaria, Spain.10.1109/ITSC.2015.312 ↗
15. Zhan, W., Chen, J., Chan, C.-Y., Liu, C., and Tomizuka, M. (2017, January 11–14). Spatially-partitioned environmental representation and planning architecture for on-road autonomous driving. Proceedings of the IEEE Intelligent Vehicles Symposium (IV), Los Angeles, CA, USA.10.1109/IVS.2017.7995789 ↗
16. Lateral Vehicle Trajectory Optimization Using Constrained Linear Time-Varying MPC
17. Zhou, X., Zhu, J., Zhou, H., Xu, C., and Gao, F. (June, January 30). EGO-Swarm: A Fully Autonomous and Decentralized Quadrotor Swarm System in Cluttered Environments. Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Xi’an, China.
18. Genetic Algorithm Approach for Obstacle Avoidance and Path Optimization of Mobile Robot10.1007/978-981-13-1513-8_66 ↗
19. Buehler, M., Iagnemma, K., and Singh, S. (2009). Junior: The Stanford Entry in the Urban Challenge. The DARPA Urban Challenge, Springer.10.1007/978-3-642-03991-1 ↗
20. Petereit, J., Emter, T., Frey, C.W., Kopfstedt, T., and Beutel, A. (2012, January 21–22). Application of Hybrid A* to an Autonomous Mobile Robot for Path Planning in Unstructured Outdoor Environments. Proceedings of the ROBOTIK 2012; 7th German Conference on Robotics, Munich, Germany.
21. Sedighi, S., Nguyen, D.V., and Kuhnert, K.D. (2019, January 19–22). Guided Hybrid A-star Path Planning Algorithm for Valet Parking Applications. Proceedings of the International Conference on Control, Automation and Robotics (ICCAR), Beijing, China.10.1109/ICCAR.2019.8813752 ↗
22. Path Planning Based on Improved Hybrid A-star Algorithm10.20965/jaciii.2021.p0064 ↗
23. Practical search techniques in path planning for autonomous driving
24. Path planning for autonomous vehicles in unknown semi-structured environments10.1177/0278364909359210 ↗
25. (2022, June 02). Heuristic. Available online: http://theory.stanford.edu/~amitp/GameProgramming/Heuristics.html.
26. (2022, June 02). A-Star Search Algorithm. Available online: https://isaaccomputerscience.org/concepts/dsa_search_a_star?examBoard=all&stage=all.
27. LaValle, S.M. (2006). Planning Algorithms, Cambridge University Press.10.1017/CBO9780511546877 ↗
28. (2022, April 25). 2D Pathfinding Benchmarks. Available online: https://www.movingai.com/benchmarks/grids.html.
29. (2022, April 25). PathBench: Benchmarking Platform for Classic and Learned Path Planning Algorithms. Available online: https://github.com/perfectly-balanced/PathBench.