class sblMilestone |
A sblMilestone represents the data structure for storing a free sample. The SBL sblPlanner grows two trees (one from the start and one form the goal) consisting of these collision-free 'sblMilestones' as nodes. Each sblMilestone stores in itself links to its parent node and children nodes.
|
| edgeFromFather link to the father of the node |
| sblMilestone () | |
| sblMilestone (int inx, const mpkConfig& qq, double tim=0) | |
| setIndex (const int& index) | |
| setConfig (mpkConfig& q_n) | |
| isFatherOf (sblMilestone& child) | |
| setFather (int from, int to) | |
| addChild (const sblMilestone& m) | |
| getConfig () | |
| getIndex () const | |
| getFather () | |
| getsblEdge () | |
| getNrSons () const | |
| getChild (int k) | |
| markSafe () | |
| isEqual (const sblMilestone& m) | |
| print () | |
| printChilds () | |
| distance (const sblMilestone& m) const | |
| L_inf (const sblMilestone& m) const |
|
| i an index to identify the nodes |
|
| q Configuration |
|
| t time associated to the configuration |
|
| children to store who are the children of the node |
A sblMilestone represents the data structure for storing a free sample. The SBL sblPlanner grows two trees (one from the start and one form the goal) consisting of these collision-free 'sblMilestones' as nodes. Each sblMilestone stores in itself links to its parent node and children nodes.
Alphabetic index HTML hierarchy of classes or Java