Time is a critical factor in several path planning problems such as flood emergency rescue operations, escape planning from fires and chemical warfare agents dispersed in large buildings, evacuation from urban areas during natural disasters such as earthquakes, and military personnel movement. We propose a hierarchical path planning algorithm (HIPLA) for real time path planning problems where the computational time is of critical significance. The main idea of HIPLA is to significantly reduce the search space for path computation by searching in a high-level abstraction graph, whose nodes are associated with precomputed risk estimates. The cumulative risk associated with all nodes along a path determines the quality of a path. We present a detailed experimental analysis of HIPLA by comparing it with two well-known approaches viz., shortest path algorithm (SPAH) [1] and Dijkstra's algorithm with pruning [2] for large node-weighted graphs.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Hierarchical path computation approach for large graphs


    Contributors:
    Rajagopalan, R. (author) / Mehrotra, K. (author) / Mohan, C. (author) / Varshney, P. (author)


    Publication date :

    2008-04-01


    Size :

    2180349 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Hierarchical Path Computation Approach for Large Graphs

    Rajagopalan, R. | Online Contents | 2008


    Route computation in large road networks: a hierarchical approach

    Jagadeesh, G.R. / Srikanthan, T. | IET | 2008


    Mobile Path Planning: A Hierarchical Approach

    Johnson, C. M. / Gray, J. O. / IFAC | British Library Conference Proceedings | 1993


    Intelligent Path Planning with Evolutionary Computation

    Parry, Adam / Ordóñez, Raúl | AIAA | 2010


    EXTRACTING PATH GRAPHS FROM VEHICLE TRAJECTORIES

    Ulbrich, Fritz / Rotter, Simon / Goehring, Daniel et al. | British Library Conference Proceedings | 2016