Dual dijkstra search for planning multiple paths

Details Dual dijkstra search for planning multiple paths Dual dijkstra search for planning multiple paths

G - Physics

06

F

G06F 17/10 (2006.01) G06Q 10/00 (2006.01)

Patent

CA 2418756

The dual Dijkstra search for planning multiple paths is performed by: (1) calculating a first shortest cost from start to all nodes by utilizing an algorithm known as the Dijkstra algorithm; (2) calculating a second shortest cost from goal to all nodes by utilizing the Dijkstra algorithm; (3) summing up the first shortest cost and the second shortest cost to obtain a summed up shortest cost; and (4a) storing at all nodes the summed up shortest cost as a cost of shortest path from start to goal via respective nodes, or, (4b) obtaining at all nodes a shortest path from start to goal via respective nodes with reference to the summed up shortest cost, thereby searching a path from start to goal.

Affiliated with

Also associated with

Rating

Dual dijkstra search for planning multiple paths does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dual dijkstra search for planning multiple paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dual dijkstra search for planning multiple paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1639853