Share Email Print

Proceedings Paper

Path Planning On The Warp Computer: Using A Linear Systolic Array In Dynamic Programming
Author(s): F. Bitz; H. T. Kung
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Given a map in which each position is associated with a traversability cost, the path planning problem is to find a minimum-cost path from a source position to every other position in the map. The paper proposes a dynamic programming algorithm to solve the problem, and analyzes the exact number of operations that the algorithm takes. The algorithm accesses the map in a highly regular way, so it is suitable for parallel implementation. The paper describes two general methods of mapping the dynamic programming algorithm onto the linear systolic array in the Warp machine developed by Carnegie Mellon. Both methods have led to efficient implementations on Warp. It is concluded that a linear systolic array of powerful cells like the one in Warp is effective in implementing the dynamic programming algorithm for solving the path planning problem.

Paper Details

Date Published: 21 January 1988
PDF: 8 pages
Proc. SPIE 0826, Advanced Algorithms and Architectures for Signal Processing II, (21 January 1988); doi: 10.1117/12.942035
Show Author Affiliations
F. Bitz, Carnegie Mellon University (United States)
H. T. Kung, Carnegie Mellon University (United States)

Published in SPIE Proceedings Vol. 0826:
Advanced Algorithms and Architectures for Signal Processing II
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?