Hardware architecture for finding shortest paths

The computation of shortest path for a mobile automaton between two points in the plane is considered in this paper. An architecturally-efficient solution based on Dijkstra's algorithm is presented for this problem. Results of implementation in Xilinx FPGA are encouraging: the solution operates at approximately 46 MHz and the implementation for a graph with 64 nodes and 88 edges fits in one XCV3200E-FG1156 device.

[1]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[2]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[3]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[4]  Víctor Blanco,et al.  Design of Embedded DSP-Based Fuzzy Controllers for Autonomous Mobile Robots , 2008, IEEE Transactions on Industrial Electronics.

[5]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[6]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[7]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[9]  Rrio Op-amps.  FEATURES , 2008 .

[10]  Kouhei Ohnishi,et al.  Improvement of Performances in Bilateral Teleoperation by Using FPGA , 2007, IEEE Transactions on Industrial Electronics.

[11]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[12]  Eric Monmasson,et al.  FPGA Design Methodology for Industrial Control Systems—A Review , 2007, IEEE Transactions on Industrial Electronics.

[13]  María José Moure,et al.  Features, Design Tools, and Application Domains of FPGAs , 2007, IEEE Transactions on Industrial Electronics.