Abstract
The authors consider the problem of learned navigation of a circular robot R, of radius delta (>or=0), through a terrain whose model is not a priori known. The authors consider two-dimensional finite-sized terrains populated by an unknown (but finite) number of simple polygonal obstacles. The number and locations of the vertices of each obstacle are unknown to R; R is equipped with a sensor system that detects all vertices and edges that are visible from its present location. The authors deal with two problems: the visit problem and the terrain model acquisition problem. In the visit problem, the robot is required to visit a sequence of destination points, and in the terrain model acquisition problem, the robot is required to acquire the complete model of the terrain. The authors present an algorithmic network framework for solving these two problems based on a retraction of the free space onto the Voronoi diagram of the terrain.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
