Example #1
0
 def __init__(self, id_dds, dds, ds, collapse_threshold, min_visibility=0.5,
              debug_it=1000, max_it=1000):
     '''
     
     :param id_dds:
     :param dds:
     :param ds:
     :param collapse_threshold: info distance for two plans to be the same node 
     :param debug_it: Number of iterations for drawing debug graph.
     '''
     WithInternalLog.__init__(self)
     self.collapse_threshold = collapse_threshold
     self.dds = dds
     self.ds = ds
     self.id_dds = id_dds
     self.debug_graph_iterations = debug_it
     self.max_it = max_it
     self.min_visibility = min_visibility
     from geometry import formatm
     self.info('Min_visibility: %s' % min_visibility)
     self.info('collapse_threshold: %s' % collapse_threshold)
     self.info(formatm('samew', self.ds.samew,
                         'oppow', self.ds.oppositew,
                         'swapw', self.ds.swappablew))
     
     GenericGraphSearch.__init__(self)
 def __init__(self, id_dds, dds, plan_reducer, max_depth=1000, max_iterations=1000000):
     self.id_dds = id_dds
     self.dds = dds
     self.plan_reducer = plan_reducer
     self.max_iterations = max_iterations
     self.max_depth = max_depth
     self.min_visibility = 0
     Memoized.__init__(self)
     GenericGraphSearch.__init__(self)
     WithInternalLog.__init__(self)
Example #3
0
 def __init__(self, tree1, tree2, metric, threshold, min_visibility):
     '''
     :param tree1: First graph
     :param tree2: Second graph        
     :param metric: a metric on values
     :param threshold: threshold for matching
     :param min_vibility: A threshold for the visibility of the joint plan.
     '''
     self.tree1 = tree1
     self.tree2 = tree2
     self.metric = metric
     self.threshold = threshold
     self.min_visibility = min_visibility
     
     WithInternalLog.__init__(self)
     Memoized.__init__(self)
Example #4
0
 def __init__(self):
     WithInternalLog.__init__(self)