The basic idea of our approach is to highlight differences
between software and hardware implementations of path
generation from a Start Point to a Goal Point, path that will be
followed by mobile robots. At the same time we show that the
hardware approach provides significant time gain and also
easy and fast switching between multiple algorithms. We
started using the Breadth-First (BF) algorithm to obtain the
path generated in a given static discrete environment.
Implementations are made both in software and in hardware.
The paper is structured as follows: section 2 deals with the
overall description of BF used algorithm and its software
implementation and results. Section 3 explains the hardware
implementation chosen for the algorithm and presents the tests
and experimental validation. Section 4 reports the comparative
results obtained by the two implementations, and shows
conclusions and ideas for future work