Curvature-Constrained Shortest Paths in a Convex Polygon (2000)
Agarwal, Pankaj K., Biedl, Thérèse, Lazard, Sylvain, Robbins, Steve, Suri, Subhash, Whitesides, Sue
Let $B$ be a point robot moving in the plane, whose path is constrained to have curvature at most $1$, and let $\poly$ be a convex polygon with $n$ vertices. We study the collision-free, optimal path...
Curvature-Constrained Shortest Paths in a Convex Polygon (2000)
Agarwal, Pankaj K., Biedl, Thérèse, Lazard, Sylvain, Robbins, Steve, Suri, Subhash, Whitesides, Sue
Let $B$ be a point robot moving in the plane, whose path is constrained to have curvature at most $1$, and let $\poly$ be a convex polygon with $n$ vertices. We study the collision-free, optimal path...
Curvature-Constrained Shortest Paths in a Convex Polygon (2000)
Agarwal, Pankaj K., Biedl, Thérèse, Lazard, Sylvain, Robbins, Steve, Suri, Subhash, Whitesides, Sue
Let $B$ be a point robot moving in the plane, whose path is constrained to have curvature at most $1$, and let $\poly$ be a convex polygon with $n$ vertices. We study the collision-free, optimal path...