Minimum-time navigation of an unmanned mobile robot in a 2-1/2D world with obstacles

Abstract

In a 2-1/D world an isolines-based world representation is employed. An algorithm of navigation is proposed based upon polygonization of the isolines, and use of the vertices of the polygon as nodes in the graph search. Quanitative recommendations are given concerning the required density of isolines and the error of polygonization. When a physical model of mechanical motion is applied, this algorithm of navigation provides minimum-time trajectories of motion. The results of navigation are illustrated using a simulation system developed for an Intelligent Mobile Autonomous System (unmanned robot).