Header menu link for other important links
X
Hardware-efficient schemes for logarithmic approximation and binary search with application to visibility graph construction
Published in
2004
Volume: 51
   
Issue: 6
Pages: 1346 - 1348
Abstract
Visibility graphs constitute a useful data structure for environment representation in the context of robot path planning. A central element in the construction of the basic visibility graph and its variants is tangent determination. This letter presents new schemes and hardware designs for key elements in tangent construction and identification of obstructed tangents. The designs have been synthesized using Synopsys Design Compiler 2001.08-SP1, and results show they are appropriate for development of a cost-effective and efficient visibility graph generation system. © 2004 IEEE.
About the journal
JournalIEEE Transactions on Industrial Electronics
ISSN02780046
Open AccessNo
Concepts (11)
  •  related image
    Approximation theory
  •  related image
    Data structures
  •  related image
    Graph theory
  •  related image
    Mobile robots
  •  related image
    Motion planning
  •  related image
    Optimization
  •  related image
    Table lookup
  •  related image
    BINARY SEARCH
  •  related image
    LOGARITHMIC APPROXIMATION
  •  related image
    Visibility graph
  •  related image
    Robotics