Motion planning in a dynamic domain

  title={Motion planning in a dynamic domain},
  author={Kikuo Fujimura and Hanan Samet},
Motion planning is studied in a time-varying environment. Each obstacle is a convex polygon that moves in a fixed direction at a constant speed. The robot is a convex polygon that is subject to a speed bound. A method is presented to determine whether or not there is a translational collision-free motion for a polygonal robot from an initial position to a final position, and to plan such a motion, if it exists. Our method makes use of the concepts of configuration spaces and accessibility. An… CONTINUE READING
Highly Cited
This paper has 67 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.

67 Citations

Citations per Year
Semantic Scholar estimates that this publication has 67 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-9 of 9 references

Motion Planning in Dynamic Domains,

K. Fujimura
Ph.D. dissertation, TR-2377, • 1989

New lower bound techniques for robot motion planning problems

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) • 1987

On Multiple Moving Objects , Algorithmica 9 ( 4 ) , [ FujiSDa ] K . Fujimura , “ Motion Planning in Dynamic Domains

T. Lozanno-Perez
Time - Minimal Paths Among Moving Obstacles , Proceedings of I E E E International Conference o n Robotics and Automat ion 2 An Output Sensitive Algorithm for Computing Visibility Graphs : Proceedings of the 2 sth Annual I E E E Sympos ium o n Foundations of Computer Science • 1987

Toward Efficient Planning: The Path-Velocity Decomposition,

K. Kant, S. W. Zucker
International Journal of Robotics Research • 1986

Computational Geometry and Motion Planning, Computational Geometry (Ed

S. H. Whitesides