Abstract
SUMMARYThe Autonomous Robot Architecture (AuRA) provides multi-level representation and planning capabilities. This paper addresses the task of navigational path-planning, which provides the robot with a path guaranteed to be free of collisions with any modeled obstacles. Knowledge supporting visual perception can also be embedded, facilitating the actual path traversal by the vehicle.A multi-level representation and architecture to support multi-sensor navigation (predominantly visual) are described. A hybrid vertex-graph free-space representation based upon the decomposition of free space into convex regions capable for use in both indoor and limited outdoor navigation is discussed. This “meadow map” is produced via the recursive decomposition of the initial bounding area of traversability and its associated modeled obstacles. Of particular interest is the ability to handle diverse terrain types (sidewalks, grass, gravel, etc.) “Transition zones” ease the passage of the robot from one terrain type to another.The navigational planner that utilizes the data available in the above representational scheme is described. An A* search algorithm incorporates appropriate cost functions for multi-terrain navigation. Consideration is given to just what constitutes an “optimal” path in this context.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,General Mathematics,Software,Control and Systems Engineering
Reference28 articles.
1. 27. Moravec H. and Elfes A. , “High Resolution Maps from Wide Angle Sonar”, Proc 1985 IEEE Int. Conf. on Robotics and Automation, St. Louis, Mo., 116–121, (1985).
2. 25. Mitchell J. and Keirsey D. , “Planning Slralegic paths through Variable terrain data” SPIE 485, Proc. Applications of Artificial Intelligence, 172–179 (1984).
3. 9. Keirsey D. , Mitchell J. , Payton D. and Preyss E. , “Multilevel Path Planning for Autonomous Vehicles” SPIE 485, Proc. Applications of Artificial Intelligence, 133–137 (1984).
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献