Header menu link for other important links
X
A hardware accelerator and FPGA realization for reduced visibility graph construction using efficient bit representations
Published in
2007
Volume: 54
   
Issue: 3
Pages: 1800 - 1804
Abstract
The reduced visibility graph (RVG) is an important structure for computation of shortest paths for mobile robots. An efficient bit representation is proposed to construct segments that are part of the RVG. Based on the bit representation, a hardware-efficient scheme is presented whose computational complexity is O(k2 log(n/k)), where k is the number of objects and n is the total number of vertices. An architecture that accomplishes the construction of the RVG without division or explicit intersection point calculations is proposed. An efficient field-programmable gate array implementation using block random access memory on an XCV3200E device is presented. © 2007 IEEE.
About the journal
JournalIEEE Transactions on Industrial Electronics
ISSN02780046
Open AccessNo
Concepts (15)
  •  related image
    FIELD-PROGRAMMABLE GATE ARRAY IMPLEMENTATIONS
  •  related image
    HARDWARE ACCELERATORS
  •  related image
    INTERSECTION POINTS
  •  related image
    RANDOM ACCESS MEMORIES
  •  related image
    REDUCED VISIBILITY
  •  related image
    REDUCED VISIBILITY GRAPH (RVG)
  •  related image
    Shortest path
  •  related image
    Computational complexity
  •  related image
    Logic gates
  •  related image
    Random access storage
  •  related image
    Robotics
  •  related image
    Robots
  •  related image
    Unmanned aerial vehicles (uav)
  •  related image
    Visibility
  •  related image
    Field programmable gate arrays (fpga)