Share Email Print

Proceedings Paper

Maintaining knowledge for an adaptive path-planning system
Author(s): Ren C. Luo; Tai-Jee Pan
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, we present a new approach to solve the mobile robot path planning problem with the consideration of the adaptability to task environmental changes due to unexpected obstacles. In order to accommodate these changes, newly discovered obstacles must be represented and included to update obstacle information. We propose a problem representation method to model the path planning problem. In this method, spatial knowledge described in terms of visibility, interference, and target obstacle is used to model the solution process. The knowledge inference process is based on traversability vectors, a mechanism to analyze spatial relation between geometric objects. We assume that an obstacle can be represented by a set of half-planes. Coefficients of the half-planes are stored as the basic world description. Changes on the obstacles can be accommodated by updating the stored coefficients. Thus, the planning system can always utilize the most recently updated obstacle information to plan for the path. This planning procedure is capable of generating the shortest path efficiently. We use a simulation example to show the capability of the proposed work.

Paper Details

Date Published: 1 January 1990
PDF: 11 pages
Proc. SPIE 1293, Applications of Artificial Intelligence VIII, (1 January 1990); doi: 10.1117/12.21090
Show Author Affiliations
Ren C. Luo, North Carolina State Univ. (United States)
Tai-Jee Pan, North Carolina State Univ. (United States)

Published in SPIE Proceedings Vol. 1293:
Applications of Artificial Intelligence VIII
Mohan M. Trivedi, Editor(s)

© SPIE. Terms of Use
Back to Top