Parallel algorithms for one or two-vehicle navigation

Abstract

A two vehicle navigator on a discrete space is analyzed. The concept of linking time maps as source to optimal path planning is discussed. The rules for constructing these maps are given in a cellular automata mode. The implementation of these rules on a parallel computer is presented.<>