Learn More
—This paper proposes a collision avoidance algorithm to solve the problem of (local) path planning for a three-dimensional (3-D) object moving among polyhedral obstacles. The algorithm is based on a generalized potential model of workspace [1] which assumes that the boundary of every 3-D object is uniformly charged. According to the proposed approach , the(More)
  • 1