Showing papers on "Any-angle path planning published in 1963"
01 May 1963
TL;DR: In this article, an algebraic topological approach to finding all paths in a given graph under various conditions is presented, and a direct method for finding a minimum path is also given.
Abstract: : An algebraic topological approach to finding all paths in a given graph under various conditions is presented. If a path with any particular characteristics is desired, such as: minimum dis tance, least cost, most reliable, etc., it can be extracted from the list of all paths. A direct method for finding a minimum path is also given. Both techniques are straight-forward and can easily be performed by a computer.
1 citations