Header menu link for other important links
X
Hardware architecture for finding shortest paths
Published in
2009
Abstract
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. © 2009 IEEE.
About the journal
JournalIEEE Region 10 Annual International Conference, Proceedings/TENCON
Open AccessNo
Concepts (11)
  •  related image
    DIJKSTRA'S ALGORITHM
  •  related image
    DIJKSTRA'S ALGORITHMS
  •  related image
    Hardware architecture
  •  related image
    Shortest path
  •  related image
    Two-point
  •  related image
    XILINX FPGA
  •  related image
    Field programmable gate arrays (fpga)
  •  related image
    Graph theory
  •  related image
    Logic gates
  •  related image
    Wireless sensor networks
  •  related image
    Computational efficiency