1.6.14 Motion Planning

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A polygonal-shaped robot in a given starting position in a room containing polygonal obstacles, with a desired ending position t .

Problem: Find the shortest path in the room taking to t without going through any of the obstacles.

Implementations

  • Joseph O'Rourke's Computational Geometry (C) (rating 3)

    Related Problems

  • Intersection Detection
  • Minkowski Sum
  • Shortest Path

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .