if (this->orig_path().size() == 0)
return this->orig_path();
else
- this->orig_path_cost(cc(*this->orig_path().back()));
+ this->orig_path_cost(this->orig_path().back()->cc);
}
class DijkstraNode : public RRTNode {
public:
|| n->t(RRTNodeType::connected)
) {
dn.push_back(DijkstraNode(*n));
- dn.back().cc = cc(*n);
+ dn.back().cc = n->cc;
dn.back().s = &dn.back();
dn.back().n = n;
dn.back().i = dncnt++;
}
}
dn.push_back(DijkstraNode(*this->orig_path().back()));
- dn.back().cc = cc(*this->orig_path().back());
+ dn.back().cc = this->orig_path().back()->cc;
dn.back().s = &dn.back();
dn.back().n = this->orig_path().back();
dn.back().i = dncnt++;
|| n->t(RRTNodeType::connected)
) {
dn.push_back(DijkstraNode(*n));
- dn.back().cc = cc(*n);
+ dn.back().cc = n->cc;
dn.back().s = &dn.back();
dn.back().n = n;
dn.back().i = dncnt++;
}
}
dn.push_back(DijkstraNode(*this->orig_path().back()));
- dn.back().cc = cc(*this->orig_path().back());
+ dn.back().cc = this->orig_path().back()->cc;
dn.back().s = &dn.back();
dn.back().n = this->orig_path().back();
dn.back().i = dncnt++;
this->first_optimized_path_ = this->first_path_optimization();
if (this->first_optimized_path_.size() > 0)
this->first_optimized_path_cost(
- cc(*this->first_optimized_path_.back())
+ this->first_optimized_path_.back()->cc
);
else
return this->orig_path();