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."synopsis" may belong to another edition of this title.
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780331753578
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780331753578
Quantity: 15 available