MAX-VALUE-FIRST SEARCH FOR TARGET VALUE PROBLEMS
The present application relates to systems and methods for determining at least one target path from a start vertex to a goal vertex within a directed acyclic graph. The systems and methods use a target value search (MFTVS) of a directed acyclic graph. The MFTVS includes beginning with a start verte...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Patent |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The present application relates to systems and methods for determining at least one target path from a start vertex to a goal vertex within a directed acyclic graph. The systems and methods use a target value search (MFTVS) of a directed acyclic graph. The MFTVS includes beginning with a start vertex as a current prefix and progressing through selected prefixes. The MFTVS further includes determining a selected prefix from successor prefixes of the current prefix according to a selection rule. The selection rule is one of selecting the successor prefix having a highest path value and selecting the successor prefix having a lowest path value. The MFTVS further includes setting the current prefix to the selected prefix until a frontier of a blind spot is encountered. The frontier of the blind spot is defined by an evaluation function. |
---|