Application of angle related cost function optimization for dynamic path planning algorithm (Q2331659): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 16:28, 2 February 2024

scientific article
Language Label Description Also known as
English
Application of angle related cost function optimization for dynamic path planning algorithm
scientific article

    Statements

    Application of angle related cost function optimization for dynamic path planning algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 October 2019
    0 references
    Summary: In recent years, Intelligent Transportation Systems (ITS) have developed a lot. More and more sensors and communication technologies (e.g., cloud computing) are being integrated into cars, which opens up a new design space for vehicular-based applications. In this paper, we present the Spatial Optimized Dynamic Path Planning algorithm. Our contributions are, firstly, to enhance the effective of loading mechanism for road maps by dividing the connected sub-net, and building a spatial index; and secondly, to enhance the effect of the dynamic path planning by optimizing the search direction. We use the real road network and real-time traffic flow data of Karamay city to simulate the effect of our algorithm. Experiments show that our Spatial Optimized Dynamic Path Planning algorithm can significantly reduce the time complexity, and is better suited for use as a real-time navigation system. The algorithm can achieve superior real-time performance and obtain the optimal solution in dynamic path planning.
    0 references
    0 references
    0 references
    0 references
    0 references
    intelligent transportation system
    0 references
    advanced driver assistance systems
    0 references
    dynamic path planning
    0 references
    optimization
    0 references