49 /** This class is a multi-threaded mobile robot navigator, implementing an (anytime) PTG-based Rapidly-exploring Random Tree (PRRT) search algorithm.
50 *
51 * <b>Usage:</b><br>
52 * - Create an instance of the CPRRTNavigator class (an object on the heap, i.e. no 'new', is preferred, but just for the convenience of the user).
53 * - Set all the parameters in CPRRTNavigator::params
54 * - Call CPRRTNavigator::initialize. If all the params are OK, true is returned and you can go on.
55 * - Start a navigation by calling CPRRTNavigator::navigate.
56 * - From your application, you must update all the sensory data (from the real robot or a simulator) on a timely-fashion. The navigator will stop the robot if the last sensory data is too old.
57 *
58 * Note that all the public methods are thread-safe.
59 *
60 * <b>About the algorithm:</b><br>
61 *
62 *
63 *
64 *
65 *
66 * <b>Changes history</b>
67 * - 05/JUL/2009: Creation (JLBC). This is an evolution from leassons learnt from the pure reactive navigator based on PTGs.
128double max_v, max_w; //!< Maximum velocities along this path segment.
129doubletrg_v; //!< Desired linear velocity at the target point, ie: the robot should program its velocities such as after this arc the speeds are the given ones.
130 };
131
132typedef std::list<TPathData> TPlannedPath; //!< An ordered list of path poses.
166doubleradius_checkpoints; //!< Radius of each checkpoint in the path, ie: when the robot get closer than this distance, the point is considered as visited and the next one is processed.