namosim.algorithms package

Submodules

namosim.algorithms.graph_search module

namosim.algorithms.kd_tree module

class namosim.algorithms.kd_tree.KDNode(object: T, point: List[float], axis: int)[source]: Bases: Generic[T]

class namosim.algorithms.kd_tree.KDTree(dimensions: int, point_getter: ~typing.Callable[[~namosim.algorithms.kd_tree.T], ~typing.Iterable[float]], distance_func: ~typing.Callable[[~typing.Iterable[float], ~typing.Iterable[float]], float] = <function default_distance_func>)[source]

Bases: Generic[T]

add(object: T) → None[source]: Add an object to the KDTree.

query(point: Iterable[float], k: int = 1) → List[T][source]: Find k nearest neighbor objects to the query point.

query_radius(point: Iterable[float], radius: float) → List[T][source]: Renvoie tous les objets dont la distance euclidienne au ‘point’ est ≤ radius.

namosim.algorithms.kd_tree.default_distance_func(A: Iterable[float], B: Iterable[float])[source]

namosim.algorithms.new_local_opening_check module

namosim.algorithms.rrt_node module

class namosim.algorithms.rrt_node.RRTNode(pose: namosim.data_models.Pose2D, parent: ForwardRef('RRTNode') | None = None, cost: float = 0.0)[source]

Bases: object

cost: float = 0.0

parent: RRTNode | None = None

pose: Pose2D