hpp-core
4.11.0
Implement basic classes for canonical path planning for kinematic chains.
|
Go to the documentation of this file.
19 #ifndef HPP_CORE_NEAREST_NEIGHBOR_HH
20 # define HPP_CORE_NEAREST_NEIGHBOR_HH
23 # include <hpp/util/serialization-fwd.hh>
31 virtual void clear () = 0;
101 #endif // HPP_CORE_NEAREST_NEIGHBOR_HH
pinocchio::Configuration_t Configuration_t
Definition: fwd.hh:96
virtual NodePtr_t search(const Configuration_t &configuration, const ConnectedComponentPtr_t &connectedComponent, value_type &distance, bool reverse=false)=0
search Return the closest node of the given configuration
Optimization of the nearest neighbor search.
Definition: nearest-neighbor.hh:28
virtual Nodes_t KnearestSearch(const Configuration_t &configuration, const ConnectedComponentPtr_t &connectedComponent, const std::size_t K, value_type &distance)=0
std::list< NodePtr_t > Nodes_t
Definition: fwd.hh:164
shared_ptr< Distance > DistancePtr_t
Definition: fwd.hh:122
std::vector< NodePtr_t > NodeVector_t
Definition: fwd.hh:165
shared_ptr< ConnectedComponent > ConnectedComponentPtr_t
Definition: fwd.hh:107
virtual DistancePtr_t distance() const =0
shared_ptr< Roadmap > RoadmapPtr_t
Definition: fwd.hh:182
Definition: bi-rrt-planner.hh:24
virtual void addNode(const NodePtr_t &node)=0
virtual NodeVector_t withinBall(const Configuration_t &configuration, const ConnectedComponentPtr_t &cc, value_type maxDistance)=0
virtual ~NearestNeighbor()
Definition: nearest-neighbor.hh:93
pinocchio::value_type value_type
Definition: fwd.hh:157
virtual void merge(ConnectedComponentPtr_t cc1, ConnectedComponentPtr_t cc2)=0