|
bitrl & cuberl Documentation
Simulation engine for reinforcement learning agents
|
A container that represents a collection of way points linked together via a LinkType The LinkType defines how smooth the trajectory will look like. More...
#include <waypoint_trajectory.h>
Public Types | |
| typedef LinkType | link_type |
| typedef link_type::w_point_type | w_point_type |
| typedef std::vector< link_type >::iterator | link_iterator |
| point iteration | |
| typedef std::vector< link_type >::const_iterator | const_link_iterator |
Public Member Functions | |
| WaypointTrajectory () | |
| Constructor. | |
| WaypointTrajectory (uint_t n) | |
| Constructor. | |
| std::pair< real_t, link_type > | distance (const w_point_type &p) const |
| Computes the minimum distance of the given point from the trajectory. | |
| uint_t | size () const |
| How many waypoints the pah has. | |
| void | reserve (uint_t n) |
| Reserve space for waypoints. | |
| void | clear () |
| clear the memory allocated for points and edges | |
| bool | empty () const |
| Returns true if the trajectory is empty. | |
| void | push (const link_type &link) |
| Push a new link. | |
| link_type & | operator[] (uint_t i) |
| Returns a read/write reference of the i-th link. | |
| const link_type & | operator[] (uint_t i) const |
| Returns a read reference of the i-th link. | |
| void | resize (uint_t n) |
| Resize the underlying links. | |
| link_iterator | begin () |
| Raw node iteration. | |
| link_iterator | end () |
| const_link_iterator | begin () const |
| Raw node iteration. | |
| const_link_iterator | end () const |
A container that represents a collection of way points linked together via a LinkType The LinkType defines how smooth the trajectory will look like.
| typedef std::vector<link_type>::const_iterator bitrl::utils::trajectory::WaypointTrajectory< LinkType >::const_link_iterator |
| typedef std::vector<link_type>::iterator bitrl::utils::trajectory::WaypointTrajectory< LinkType >::link_iterator |
point iteration
| typedef LinkType bitrl::utils::trajectory::WaypointTrajectory< LinkType >::link_type |
| typedef link_type::w_point_type bitrl::utils::trajectory::WaypointTrajectory< LinkType >::w_point_type |
| bitrl::utils::trajectory::WaypointTrajectory< LinkType >::WaypointTrajectory | ( | ) |
Constructor.
|
explicit |
Constructor.
|
inline |
Raw node iteration.
|
inline |
Raw node iteration.
|
inline |
clear the memory allocated for points and edges
| std::pair< real_t, typename WaypointTrajectory< LinkType >::link_type > bitrl::utils::trajectory::WaypointTrajectory< LinkType >::distance | ( | const w_point_type & | p | ) | const |
Computes the minimum distance of the given point from the trajectory.
|
inline |
Returns true if the trajectory is empty.
|
inline |
|
inline |
|
inline |
Returns a read/write reference of the i-th link.
|
inline |
Returns a read reference of the i-th link.
|
inline |
Push a new link.
|
inline |
Reserve space for waypoints.
|
inline |
Resize the underlying links.
|
inline |
How many waypoints the pah has.