On-line motion planning: Case of a planar rod

@article{Cox1991OnlineMP,
  title={On-line motion planning: Case of a planar rod},
  author={James Cox and Chee-Keng Yap},
  journal={Annals of Mathematics and Artificial Intelligence},
  year={1991},
  volume={3},
  pages={1-20}
}
In this paper we develop an algorithm for planning the motion of a planar “rod” (a line segment) amidst obstacles bounded by simple, closed polygons. The exact shape, number and location of the obstacles are assumed unknown to the planning algorithm, which can only obtain information about the obstacles by detecting points of contact with the obstacles. The ability to detect contact with obstacles is formalized by move primitives that we callguarded moves. We call ours theon-line motion… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

Similar Papers

Loading similar papers…