Algorithmic framework for learned robot navigation in unknown terrains
- 1 June 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 22 (6) , 37-43
- https://doi.org/10.1109/2.30719
Abstract
A framework is presented that uses the same strategy to solve both the learned navigation and terrain model acquisition. It is shown that any abstract graph structure that satisfies a set of four properties suffices as the underlying structure. It is also shown that any graph exploration algorithm can serve as the searching strategy. The methods provide paths that keep the robot as far from the obstacles as possible. In some cases, these methods are preferable to visibility graph methods that require the robot to navigate arbitrarily close to the obstacles, which is hard to implement if the robot motions are not precise.Keywords
This publication has 4 references indexed in Scilit:
- On terrain acquisition by a point robot amidst polyhedral obstaclesIEEE Journal on Robotics and Automation, 1988
- Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle caseIEEE Journal on Robotics and Automation, 1987
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shapeAlgorithmica, 1987
- Robot navigation algorithms using learned spatial graphsRobotica, 1986