Abstract
This paper shows how to compute the nonholonomic distance between a pointwise car-like robot and polygonal obstacles. Geometric constructions to compute the shortest paths from a configuration (given orientation and position in the plane of the robot) to a position (i.e., a configuration with unspecified final orientation) are first presented. The geometric structure of the reachable set (set of points in the plane reachable by paths of given length /spl Lscr/) is then used to compute the shortest paths to straight-line segments. Obstacle distance is defined as the length of such shortest paths. The algorithms are developed for robots that can move both forward and backward (Reeds and Shepp's car) or only forward (Dubins' car). They are based on the convexity analysis of the reachable set.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
