Department of Computer Science Deutsche Version
ETH Zürich /Computer Science /Publications
Search

Exact Cell Decomposition of Arrangements used for Path Planning in Robotics

Technical Report 329

Nora H. Sleumer and Nadine Tschichold-G\"urman, Institute of Theoretical Computer Science, ETH Zürich

Keywords: line arrangement, path planning, robotics, exact cell decomposition
Language: English
Pages: 14
Available
Files:
abstract
plain Postscript
gnu-compressed PS
Abstract: We present a practical algorithm for the automatic generation of a map that describes the operation environment of an indoor mobile service robot. The input is a CAD description of a building consisting of line segments that represent the walls. The algorithm is based on the exact cell decomposition obtained when these segments are extended to infinite lines, resulting in a line arrangement. The cells are represented by nodes in a connectivity graph. The map consists of the connectivity graph and additional environmental information that is calculated for each cell. The method takes into account both the path planning and position verification requirements of the robot and has been implemented.

Sep . 1999

ETH Zürich