Review Article
Survey of Robot 3D Path Planning Algorithms
| Name of each sub-PRM | Criteria of corresponding algorithm |
| -PRM | Meaning each step choose nearest neighbors to be the states which are under consideration. |
| -PRM | The expected states are to be chosen within a ball (or circle) region, for all states included in the radius will be chosen to connect to the vertex. |
| --PRM | A combination of above two, where for a given radius the upper bound of the vertices to be chosen is . |
|
|