Research on Path Planning Problem of Smart Car Considering Kinematic Constraints
DOI:
https://doi.org/10.54097/hset.v46i.7809Keywords:
Intelligent trolley, Path planning, Kinematic constraints.Abstract
With the development of artificial intelligence, intelligent cars have gradually appeared in people's lives and brought many conveniences to people's lives and work. On the street, we can see many busy figures of unmanned delivery cars; In some factories, smart cars shuttle back and forth between product production processes for material distribution; In some hospitals, we can also find that some smart cars replace medical staff to undertake the task of sending medicines and tests. For intelligent cars, autonomous collision-free path planning and trajectory tracking of the planned path are the most basic and core tasks of intelligent vehicles. The existing path planning algorithms are mainly divided into search-based algorithms (Dijkstra, A*, etc.) and sample-based algorithms (PRM, RRT, etc.), and different types of algorithms have good performance in their respective applicable scenarios. However, these path planning algorithms all use the same simplification assumption, that is, the intelligent car is regarded as a freely moving point or sphere in the path planning task, and the driving experience in life tells us that the movement of the wheel-driven intelligent car is constrained by the turning radius of the vehicle, so the path planned by the simplified intelligent car for a point is often not suitable for the driving of the intelligent car in reality. Considering this constraint, this project models the kinematics of the intelligent trolley with four-wheel steering, and adds kinematic constraints to the path planning, so as to plan the path that conforms to the kinematics model of the intelligent trolley. The path planning algorithm proposed in this topic will be tested in ROS and Gazebo simulation environments, and compared with the traditional search-based A* algorithm, the results of multiple scenarios verify the effectiveness of the algorithm. Finally, this project summarizes and looks forward to this research, which has completed the construction of low-cost physical intelligent vehicles, and plans to complete the verification of the real vehicle function by combining the designed path planning algorithm with the real-time mapping and positioning system of the car in the future.
Downloads
References
Xiaojian Lv. Research on path planning technology of vehicle navigation system. Master's thesis, Shanghai Jiaotong University, 2011.
Yarong Shi, Di Wan, Shuangyan Li, Zhenyu Lv. Research on logistics distribution route planning based on GIS. Systems Engineering-Theory & Practice, 29(10): 76–84, 2009.
Yi Jian, Bin Gao, Yue Zhang. Research on a full-traversal path planning method for indoor sweeping robot. Transducers and Microsystems, 37(1): 32–34, 2018.
Qi Song, Yinghui Wu, Peng Lin, Luna Xin Dong, and Hui Sun. Mining summaries for knowledge graph search. IEEE Transactions on Knowledge and Data Engineering, 30(10): 1887–1900, 2018.
Huijuan Wang, Yuan Yu, and Quanbo Yuan. Application of dijkstra algorithm in robot path-planning. In 2011 second international conference on mechanic automation and control engineering, pages 1067–1069. IEEE, 2011.
František Duchoň, Andrej Babinec, Martin Kajan, Peter Beňo, Martin Florek, Tomáš Fico, and Ladislav Jurišica. Path planning with modified a star algorithm for a mobile robot. Procedia Engineering, 96: 59–69, 2014.
David Hsu, Jean-Claude Latombe, and Hanna Kurniawati. On the probabilistic foundations of probabilistic roadmap planning. The International Journal of Robotics Research, 25(7): 627–643, 2006.
Steven M LaValle and James J Kuffner. Rapidly-exploring random trees: Progress and prospects: Steven m. lavalle, iowa state university, a james j. kuffner, jr., university of tokyo, tokyo, japan. Algorithmic and Computational Robotics, pages 303–307, 2001.
Anis Koubâa et al. Robot Operating System (ROS)., volume 1. Springer, 2017.
Nathan Koenig and Andrew Howard. Design and use paradigms for gazebo, an open-source multi-robot simulator. In 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No. 04CH37566), volume 3, pages 2149–2154. IEEE, 2004.
Deepak Sinwar and Rahul Kaushik. Study of euclidean and manhattan distance metrics using simple k-means clustering. Int. J. Res. Appl. Sci. Eng. Technol, 2(5): 270–274, 2014.
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.







