|
double | calc_astar_cost (dpNode *potential_parent) |
| Compute the A-star cost at the node (optional). More...
|
|
double | calc_cost () |
| Compute the local cost at the node. More...
|
|
int | create_child_nodes (dpNode **&nodes) |
| Create (potential) child nodes. More...
|
|
dpScheduleNode * | find_available_parent (int target_depth, int &child_id) |
|
dpScheduleNode * | find_available_parent_sub (dpScheduleNode *cur, int target_depth, dpNode *cur_leaf, int &child_id) |
|
int | is_goal () |
| Check if the state is goal. More...
|
|
int | list_all_internal_joints_rev (Joint *cur, joint_list &all_internal) |
|
int | list_all_internal_joints_sub (Joint *cur, joint_list &all_internal) |
|
int | same_state (dpNode *refnode) |
| Check if the node's state is the same as refnode . (to remove duplicates) More...
|
|
int | set_outer_joints (pJoint *last_pjoint, const p_joint_list &org_outer_joints, p_joint_list &new_outer_joints) |
|
int | split_internal_joints (Joint *_last_joint, const joint_list &org_internal_joints, joint_list &_internal_joints_0, joint_list &_internal_joints_1) |
|
void | add_child (dpNode *n) |
|
virtual void | dump (ostream &ost) |
|
void | dump_all (ostream &ost) |
|
void | dump_trajectory (ostream &ost) |
|
dpNode * | next_breadth (dpNode *refnode) |
|
dpNode * | next_depth (dpNode *first_child=0) |
|
int | open (int _max_nodes, int _max_goals) |
|
void | remove () |
|
void | remove_single () |
|
|
double | add_to_child_side (Joint *cur, joint_list &added_joints, int *n_outer_parent_side, int *n_outer_child_side) |
|
double | add_to_parent_side (Joint *cur, joint_list &added_joints, int *n_outer_parent_side, int *n_outer_child_side) |
|
double | calc_min_subchain_cost (const p_joint_list &_outer_joints, joint_list &added_joints) |
|
double | calc_min_subchain_cost_sub (Joint *cur, const p_joint_list &_outer_joints, int *n_outer_parent_side, int *n_outer_child_side, joint_list &added_joints) |
|
double | calc_single_joint_cost (int n_dof, int n_outer) |
|
Definition at line 35 of file schedule.cpp.
◆ dpScheduleNode()
◆ ~dpScheduleNode()
dpScheduleNode::~dpScheduleNode |
( |
| ) |
|
|
inline |
◆ add_to_child_side()
double dpScheduleNode::add_to_child_side |
( |
Joint * |
cur, |
|
|
joint_list & |
added_joints, |
|
|
int * |
n_outer_parent_side, |
|
|
int * |
n_outer_child_side |
|
) |
| |
|
private |
◆ add_to_parent_side()
double dpScheduleNode::add_to_parent_side |
( |
Joint * |
cur, |
|
|
joint_list & |
added_joints, |
|
|
int * |
n_outer_parent_side, |
|
|
int * |
n_outer_child_side |
|
) |
| |
|
private |
◆ calc_astar_cost()
double dpScheduleNode::calc_astar_cost |
( |
dpNode * |
potential_parent | ) |
|
|
inlineprotectedvirtual |
Compute the A-star cost at the node (optional).
Reimplemented from dpNode.
Definition at line 279 of file schedule.cpp.
◆ calc_cost()
double dpScheduleNode::calc_cost |
( |
| ) |
|
|
inlineprotectedvirtual |
◆ calc_min_subchain_cost()
◆ calc_min_subchain_cost_sub()
◆ calc_single_joint_cost()
double dpScheduleNode::calc_single_joint_cost |
( |
int |
n_dof, |
|
|
int |
n_outer |
|
) |
| |
|
inlineprivate |
◆ create_child_nodes()
int dpScheduleNode::create_child_nodes |
( |
dpNode **& |
nodes | ) |
|
|
inlineprotectedvirtual |
Create (potential) child nodes.
Create (potential) child nodes.
- Parameters
-
[out] | nodes | array of pointers to the child nodes |
Implements dpNode.
Definition at line 150 of file schedule.cpp.
◆ find_available_parent()
◆ find_available_parent_sub()
◆ FirstProc()
int dpScheduleNode::FirstProc |
( |
| ) |
|
|
inline |
◆ is_goal()
int dpScheduleNode::is_goal |
( |
| ) |
|
|
inlineprotectedvirtual |
◆ LastJoint()
Joint* dpScheduleNode::LastJoint |
( |
| ) |
|
|
inline |
◆ LastProc()
int dpScheduleNode::LastProc |
( |
| ) |
|
|
inline |
◆ list_all_internal_joints_rev()
int dpScheduleNode::list_all_internal_joints_rev |
( |
Joint * |
cur, |
|
|
joint_list & |
all_internal |
|
) |
| |
|
protected |
◆ list_all_internal_joints_sub()
int dpScheduleNode::list_all_internal_joints_sub |
( |
Joint * |
cur, |
|
|
joint_list & |
all_internal |
|
) |
| |
|
protected |
◆ ListAllInternalJoints()
int dpScheduleNode::ListAllInternalJoints |
( |
joint_list & |
all_internal | ) |
|
◆ ProcCosts()
fVec& dpScheduleNode::ProcCosts |
( |
| ) |
|
|
inline |
◆ same_state()
int dpScheduleNode::same_state |
( |
dpNode * |
refnode | ) |
|
|
inlineprotectedvirtual |
Check if the node's state is the same as refnode
. (to remove duplicates)
Implements dpNode.
Definition at line 334 of file schedule.cpp.
◆ ScheduleDepth()
int dpScheduleNode::ScheduleDepth |
( |
| ) |
|
|
inline |
◆ set_outer_joints()
◆ split_internal_joints()
◆ first_proc
int dpScheduleNode::first_proc |
|
private |
◆ internal_joints
◆ last_joint
Joint* dpScheduleNode::last_joint |
|
private |
◆ last_pjoints
pJoint* dpScheduleNode::last_pjoints[2] |
|
private |
◆ last_proc
int dpScheduleNode::last_proc |
|
private |
◆ mycost
double dpScheduleNode::mycost |
|
private |
◆ outer_joints
◆ proc_costs
fVec dpScheduleNode::proc_costs |
|
private |
◆ schedule_depth
int dpScheduleNode::schedule_depth |
|
private |
◆ schedule_parent
◆ single_joint_cost
double dpScheduleNode::single_joint_cost |
|
private |
The documentation for this class was generated from the following file: