An implementation of the vertex and edge components in the graph. More...
#include <smp/planners/rrtstar.h>#include <smp/common/region.h>#include <smp/components/model_checkers/base.h>#include <smp/components/cost_evaluators/base.h>Go to the source code of this file.
Classes | |
| class | smp::minimum_time_reachability_vertex_data |
| Vertex data for minimum-time reachability. More... | |
| class | smp::minimum_time_reachability_edge_data |
| Edge data for minimum-time reachability. More... | |
| class | smp::minimum_time_reachability< typeparams, NUM_DIMENSIONS > |
| A combination of the minimum-time cost evaluator and the reachability model checker. More... | |
Namespaces | |
| namespace | smp |
Sampling-based Motion Planning (SMP) Library. | |
An implementation of the vertex and edge components in the graph.
Provides an implementation of the vertex and edge components in the graph. Both classes are defined as templates that take the types of the state, input, and the data stored in the vertices as well as the type of the data that is stored in the edges as an argument.