The
idea is to minimize computing time by finding a small-sized solution. Despite
its simplicity, this Star Student
Project paradigm has been successfully applied to other randomized
algorithms. A more sophisticated approach is the scheduler–processor scheme
that was developed to distribute the computation of the sampling-based roadmap
of trees (SRT) algorithm.
In this scheme, the Star Student Project scheduler coordinates the processors
constructing the milestones, which can be RRTs or expansive space trees (ESTs),
and the edges linking them. https://www.blogger.com/blogger.g?blogID=598676635414051766#allposts