An optimization method for urban autonomous vehicle path planning from the perspective of internet of vehicles
X.C. Hu
Pages: 83-96
Abstract:
With the rapid development of autonomous vehicle technology, optimizing path planning has become crucial for improving urban traffic efficiency and safety. However, traditional path planning methods for urban autonomous vehicles often suffer from high path deviation, elevated collision risk probability, and extended optimization time. To address these challenges, this study proposes an innovative optimization method for urban autonomous vehicle path planning from the perspective of the Internet of Vehicles. Firstly, a kinematic model for autonomous vehicles is constructed, which is then integrated with Internet of Vehicles technology to comprehensively perceive urban road environment information. Subsequently, a grid map is generated based on the automotive kinematic model and the acquired road environment data. A potential field ant colony algorithm is devised by enhancing pheromone update strategies and heuristic functions. Through iterative searches within the grid map, this algorithm effectively identifies the optimal path, thereby realizing the optimization of urban autonomous vehicle path planning. Experimental results demonstrate that the proposed method achieves a remarkable minimum path deviation of 0.04 and a minimal collision risk probability of 0.06. Moreover, the optimization time for urban autonomous vehicle path planning is confined between 0.25s and 0.72s. These outcomes signify that the proposed method not only enhances the accuracy and safety of autonomous vehicle path planning but also substantially reduces the computational burden and time consumption. This makes it highly promising for practical applications in urban autonomous driving scenarios, potentially revolutionizing the future of urban transportation.
Keywords: internet of vehicles; urban; autonomous vehicles; path planning optimization; potential field ant colony algorithm
2025 ISSUES
2024 ISSUES
LXII - April 2024LXIII - July 2024LXIV - November 2024Special 2024 Vol1Special 2024 Vol2Special 2024 Vol3Special 2024 Vol4
2023 ISSUES
LIX - April 2023LX - July 2023LXI - November 2023Special Issue 2023 Vol1Special Issue 2023 Vol2Special Issue 2023 Vol3
2022 ISSUES
LVI - April 2022LVII - July 2022LVIII - November 2022Special Issue 2022 Vol1Special Issue 2022 Vol2Special Issue 2022 Vol3Special Issue 2022 Vol4
2021 ISSUES
LIII - April 2021LIV - July 2021LV - November 2021Special Issue 2021 Vol1Special Issue 2021 Vol2Special Issue 2021 Vol3
2020 ISSUES
2019 ISSUES
Special Issue 2019 Vol1Special Issue 2019 Vol2Special Issue 2019 Vol3XLIX - November 2019XLVII - April 2019XLVIII - July 2019
2018 ISSUES
Special Issue 2018 Vol1Special Issue 2018 Vol2Special Issue 2018 Vol3XLIV - April 2018XLV - July 2018XLVI - November 2018
2017 ISSUES
Special Issue 2017 Vol1Special Issue 2017 Vol2Special Issue 2017 Vol3XLI - April 2017XLII - July 2017XLIII - November 2017
2016 ISSUES
Special Issue 2016 Vol1Special Issue 2016 Vol2Special Issue 2016 Vol3XL - November 2016XXXIX - July 2016XXXVIII - April 2016
2015 ISSUES
Special Issue 2015 Vol1Special Issue 2015 Vol2XXXV - April 2015XXXVI - July 2015XXXVII - November 2015
2014 ISSUES
Special Issue 2014 Vol1Special Issue 2014 Vol2Special Issue 2014 Vol3XXXII - April 2014XXXIII - July 2014XXXIV - November 2014
2013 ISSUES
2012 ISSUES
2011 ISSUES
2010 ISSUES
2009 ISSUES
2008 ISSUES
2007 ISSUES
2006 ISSUES
2005 ISSUES
2004 ISSUES
2003 ISSUES