Three-dimensional minimum-cost path planning using cellular automata architectures

Panagiotis G. Tzionas; Phillippos G. Tsalides; Adonios Thanailakis

doi:10.1117/12.143799

4 May 1993 Three-dimensional minimum-cost path planning using cellular automata architectures

Panagiotis G. Tzionas, Phillippos G. Tsalides, Adonios Thanailakis

Author Affiliations +

Proceedings Volume 1831, Mobile Robots VII; (1993) https://doi.org/10.1117/12.143799
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States

Abstract

A new algorithm for the estimation of the minimum cost path between a pair of points in the 3-D space and it''s proposed VLSI implementation using a 3-D Cellular Automata (CA) architecture, are being presented in this paper. The proposed algorithm guarantees to find the minimum cost path in 3-D space, if such a path exists. The proposed algorithm is especially suitable for real-time 3-D applications, such as 3-D automated navigation, target tracking in 3- D, 3-D path planning, etc.

Citation Download Citation

Panagiotis G. Tzionas, Phillippos G. Tsalides, and Adonios Thanailakis "Three-dimensional minimum-cost path planning using cellular automata architectures", Proc. SPIE 1831, Mobile Robots VII, (4 May 1993); https://doi.org/10.1117/12.143799

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE