Dual dijkstra search for planning multiple paths
CA 2418756 A1 · Owner: Fujita, Yusuke · Inventors: Fujita, Yusuke; Nakamura, Yoshihiko
Overview
Its claims, description and drawings are in the Canadian Patents Database.
Open the CIPO recordAbstract From the Canadian patent
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 …
Read the whole patent
Listed from its CIPO record in Patent Yard's archive of Canadian patents past their term. Its claims, description and drawings are in the CIPO record and on Google Patents, and the Claude kit works from them.
Why it's free to use
- Filed February 12, 2003. No grant is recorded for it in Canada; had it been granted, its 20-year term would have ended February 12, 2023.
- A certificate of supplementary protection adds at most two years for a drug, so even that would have ended by February 12, 2025.
- We check Canadian rights only. A patent in its family in another country could still be in force: check its family on Google Patents.
Timeline
Timeline From CIPO dates
Sources & verification
Official CIPO records
Everything on this page comes from the CIPO record linked above. Contains information licensed under the Open Government Licence – Canada.