A hierarchical tree search may determine different costs associated with a same candidate action for different levels of the hierarchy, each of which may be associated with different cost function(s) and respective objective(s), such as safety, progress, comfort, and the like. At each level, the hierarchical tree search may determine an upper and lower bound cost for the candidate action that may be based on the cost function(s) for that level. The hierarchical tree search may mask out for subsequent level(s) any candidate actions at a level of the tree that exceed the lowest upper or lower bound cost of any candidate action at that level by more than a slack amount.


    Access

    Download


    Export, share and cite



    Title :

    HIERARCHICAL MULTI-OBJECTIVE OPTIMIZATION IN VEHICLE PATH PLANNING TREE SEARCH


    Contributors:

    Publication date :

    2025-01-02


    Type of media :

    Patent


    Type of material :

    Electronic Resource


    Language :

    English


    Classification :

    IPC:    B60W CONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION , Gemeinsame Steuerung oder Regelung von Fahrzeug-Unteraggregaten verschiedenen Typs oder verschiedener Funktion



    HIERARCHICAL MULTI-OBJECTIVE OPTIMIZATION IN VEHICLE PATH PLANNING TREE SEARCH

    LORENZETTI JOSEPH / CALDWELL TIMOTHY / SUN KE et al. | European Patent Office | 2025

    Free access

    A hierarchical global path planning approach for mobile robots based on multi-objective particle swarm optimization

    Thi Thoa Mac / Copot, Cosmin / Tran, Duc Trung et al. | BASE | 2017

    Free access


    Pareto-Optimal Transit Route Planning With Multi-Objective Monte-Carlo Tree Search

    Weng, Di / Chen, Ran / Zhang, Jianhui et al. | IEEE | 2021


    Multi-Agent Assisted Shortest Path Planning using Monte Carlo Tree Search

    Bhadoriya, Abhay Singh / Darbha, Swaroop / Rathinam, Sivakumar et al. | AIAA | 2023