Delve into the math of motion planning and discover how graph puzzles shape what we can compute.
This nonfiction work surveys how moving pebbles on graphs leads to deep questions about algorithm design and complexity. It explains key problems, bounds, and methods that researchers use to understand coordinated motion in both theoretical and practical settings.
- What the pebble motion problem is and why it matters for planning paths
- How graph structure, like planarity and connectivity, affects algorithmic difficulty
- Polynomial-time results and the role of graph properties in planning
- Connections between combinatorial models and broader topics in algorithms and robotics
Ideal for readers of theoretical computer science, algorithms, and robotics who want a clear, accessible view of motion coordination on graphs.