The Design of a Hardware Accelerator for Real-Time Complete Visibility Graph Construction and Efficient FPGA Implementation
Sridharan, K.; Priya, T.K.
Industrial Electronics, IEEE Transactions on
Volume 52, Issue 4, Aug. 2005 Page(s): 1185 - 1187
Digital Object Identifier   10.1109/TIE.2005.851591
Summary: A valuable geometric structure in mobile robot path planning is the complete visibility graph. This letter proposes new parallel algorithms that can be mapped to reconfigurable hardware for construction of the complete visibility graph in an environment with: 1) multiple convex polygonal objects and 2) multiple nonconvex polygonal objects. Results of implementation in a Xilinx Virtex field-programmable gate array demonstrate that the proposed approach is area–time efficient: the design for an environment with roughly 60 vertices fits on one XCV3200E device and operates at close to 60 MHz.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.