Plan obstacle-free moves for a convex polygon in a 2-D world.
This book describes an efficient motion planning algorithm that ensures a convex polygon can translate and rotate while avoiding polygonal obstacles. It blends ideas from established methods to build a practical, scalable solution.
The approach builds a discrete, recursive representation of the free configuration space. It uses an edge graph to capture how boundary edges of the free space connect, and it extends this representation across orientations to enable full space planning. The result is a graph-based planning process that reduces the continuous problem to a manageable path search, with careful handling of critical orientations where the object touches walls.
What you’ll experience
- A compact, combinatorial view of the free configuration space for a convex polygon.
- A step-by-step description of constructing a boundary-edge graph that encodes connectivity.
- An algorithmic path-planning workflow that moves from graph to continuous motion.
- Practical performance notes, including time bounds and how the method scales with obstacle count.
Ideal for readers of robotics research and applied motion planning who want a concrete, implementable approach to collision-free movement in 2-D environments.