Abstract
This paper deals with distance computation between a forward moving car-like robot and polygonal obstacles. We propose efficient geometric algorithms to compute the shortest paths to obstacles. We then derive the visibility domain in the presence of obstacles, i.e. the set of positions reachable from a starting configuration, by a collision-free shortest path unaffected by the presence of the obstacles.
Sign-in/Register to access full text options 
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.
