class mpkSimpleSegmentChecker |
Simple lazy segment checker that discretizes a segment up to a certain resolution in c-space and checks the generated intermediate configurations for collisions using the mpkConfigChecker class.
int | num_bv_tests |
int | num_tri_tests |
int | num_points_tested |
double | min_interval_sz |
double | coll_t |
mpkSimpleSegmentChecker (mpkConfigChecker* ccheck, const mpkConfig* q0, const mpkConfig* q1, double epsilon, cspace_metric metric=EUCLID) | |
double | prio () |
bool | collision () |
enum | collcheck_mode |
The checker can be embedded with other checkers in a priority queue for testing entire paths (sequences of segments). To this end, the checker offers performing single iteration steps and a function that returns, after each iteration, the priority of further examining the segment.Each iteration step of the checker examines a number of 2^curr_bisection_depth equally spaced points on the segment. The points are chosen such that they fall between all the points that were checked before at previous iteration steps with smaller bisection depths. The point for depth 0 is thus located at t=0.5, for depth 1 the points are located at t=0.25 and t=0.75, for depth 2 at t=0.125, t=0.375, t=0.625 and t=0.875 and so on. The time required by this function thus increases exponentially with each call.
The priority of examining the segment is proportional to the (c-space) length of the untested subsegments between the intermediate tested points.
Alphabetic index HTML hierarchy of classes or Java