Planning a time-minimal motion among moving obstacles

This publication has 13 references indexed in Scilit:

• Accessibility: a new approach to path planning among moving obstacles
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
  Published by Association for Computing Machinery (ACM) ,1988
• On multiple moving objects
  Algorithmica, 1987
• New lower bound techniques for robot motion planning problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• An output sensitive algorithm for computing visibility graphs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• Visibility of disjoint polygons
  Algorithmica, 1986
• Toward Efficient Trajectory Planning: The Path-Velocity Decomposition
  The International Journal of Robotics Research, 1986
• Computational Geometry
  Published by Springer Nature ,1985
• Computational Geometry and Motion Planning
  Published by Elsevier ,1985
• An algorithm for planning collision-free paths among polyhedral obstacles
  Communications of the ACM, 1979