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.
HIERARCHICAL MULTI-OBJECTIVE OPTIMIZATION IN VEHICLE PATH PLANNING TREE SEARCH
2025-01-02
Patent
Electronic Resource
English
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
European Patent Office | 2025
|