PATH SEARCHING METHOD
PROBLEM TO BE SOLVED: To shorten a processing time when a path having the least progress burden value (cost) is searched by executing at least a processing object setting procedure, a cumulative progress burden value calculation procedure and a path decision procedure. SOLUTION: The nodes Nd1 to Nd6...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Patent |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | PROBLEM TO BE SOLVED: To shorten a processing time when a path having the least progress burden value (cost) is searched by executing at least a processing object setting procedure, a cumulative progress burden value calculation procedure and a path decision procedure. SOLUTION: The nodes Nd1 to Nd6 are existent, and the nodes Nd1 and Nd4 are defined as the start and goal nodes respectively in a path searching process. In a processing object setting procedure, an inter-node processing object is set based on an adjacent node table where all adjacent nodes and their progress burden value are described. In a cumulative progress burden value calculation procedure, the cumulative progress burden value is calculated for the processing object nodes including the starting node through the goal node. Then in a path decision procedure, a path having the least progress burden value is discriminated based on the available calculation result data when the processing is over among the necessary nodes in the cumulative progress burden value calculation procedure. |
---|