- Test script.
- `nn4` use Euclidean distance while independently on RRT framework cost used.
+### Removed
+- `opt_part` procedure (unused).
+
### Fixed
- Dijkstra path optimization only if goal found.
- Workaround used for optimizing part of path. There is a bug that causes
}
return this->goal()->ccost();
}
-
-bool T2::opt_part(RRTNode *init, RRTNode *goal)
-{
- std::vector<RRTNode *> steered;
- steered = this->steer(init, goal);
- unsigned int ss = steered.size();
- for (unsigned int i = 0; i < ss - 1; i++) {
- steered[i]->add_child(
- steered[i + 1],
- this->cost(
- steered[0], // FIXME
- steered[ss - 1])); // FIXME
- }
- if (this->collide(steered[0], steered[ss - 1])) {
- for (auto n: steered)
- delete n;
- return false;
- }
- RRTNode *op;
- op = init->parent();
- if (!op)
- op = init;
- op->add_child(steered[0], this->cost(op, steered[0]));
- steered[ss - 1]->add_child(goal, this->cost(steered[ss - 1], goal));
- return true;
-}