Comparative study

In this section a comparative study on a set of deterministic-sampling based dynamic trajectory planners is carried out to analyze the performance of the DFM algorithm. A*, FM, FM*, D* Lite and DFM algorithms are tested using the simulation testbed described in the previous section. The graph of figure 6 depicts the performance of the five trajectory planning algorithms over a range of replanning computations (runs).

Runs

Fig. 6. Performance of A*, FM, FM*, D* Lite and DFM algorithms as a function of the number of runs. Each graph represents the evolution of the cumulated computation time of each algorithm over the runs.

Runs

Fig. 6. Performance of A*, FM, FM*, D* Lite and DFM algorithms as a function of the number of runs. Each graph represents the evolution of the cumulated computation time of each algorithm over the runs.

One can see in figure 6 that FM* is the fastest static algorithm. However, from run 11, dynamic replanning algorithms (D* Lite and DFM) give better performance than static planning algorithms (A*, FM and FM*). This is explained by the greater efficiency of dynamic replanning algorithms when changes in the cost function happen close to the goal configuration.

Was this article helpful?

0 0
Learn Photoshop Now

Learn Photoshop Now

This first volume will guide you through the basics of Photoshop. Well start at the beginning and slowly be working our way through to the more advanced stuff but dont worry its all aimed at the total newbie.

Get My Free Ebook


Post a comment