Share Email Print

Proceedings Paper

Adaptive pyramidal clustering for shortest path determination
Author(s): Keith Olson; Scott A. Speigle
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper will present a unique concept implemented in a software design that determines near optimal paths between hundreds of randomly connected nodes of interest in a faster time than current near optimal path determining algorithms. The adaptive pyramidal clustering (APC) approach to determining near optimal paths between numerous nodes uses an adaptive neural network along with classical heuristic search techniques. This combination is represented by a nearest neighbor clustering up function (performed by the neural network) and a trickle down pruning function (performed by the heuristic search). The function of the adaptive neural network is a significant reason why the APC algorithm is superior to several well known approaches. The APC algorithm has already been applied to autonomous route planning for unmanned ground vehicles. The intersections represent navigational waypoints that can be selected as source and destination locations. The APC algorithm then determines a near optimal path to navigate between the selected waypoints.

Paper Details

Date Published: 27 May 1996
PDF: 12 pages
Proc. SPIE 2738, Navigation and Control Technologies for Unmanned Systems, (27 May 1996);
Show Author Affiliations
Keith Olson, Nichols Research Corp. (United States)
Scott A. Speigle, U.S. Army Missile Command (United States)

Published in SPIE Proceedings Vol. 2738:
Navigation and Control Technologies for Unmanned Systems
Scott A. Speigle, 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?