jeff-rmit wrote:
you know A* only give the shortest route,
i am looking for a route by available top speed +difficulty on maneuverability +trafficability
any hints on that?
From what I remember, the A* VIs can be used with either an occupancy grid or a directed graph. The costs on an occupancy grid are simply the distances between neighboring nodes, so it only allows you to find the shortest path. If you use a directed graph as the map, you can have more control by specifying multidimensional coordinates for each node. This is still a "shortest path" calculation, but you may be able to manipulate the coordinates to reflect other parameters.