Parasol Planning Library (PPL)
|
#include <boost/preprocessor/seq.hpp>
#include "MPLibrary/Connectors/CCsConnector.h"
#include "MPLibrary/Connectors/NeighborhoodConnector.h"
#include "MPLibrary/Connectors/RewireConnector.h"
#include "MPLibrary/DistanceMetrics/BinaryLPSweptDistance.h"
#include "MPLibrary/DistanceMetrics/LPSweptDistance.h"
#include "MPLibrary/DistanceMetrics/MinkowskiDistance.h"
#include "MPLibrary/DistanceMetrics/EuclideanDistance.h"
#include "MPLibrary/DistanceMetrics/WeightedEuclideanDistance.h"
#include "MPLibrary/DistanceMetrics/ManhattanDistance.h"
#include "MPLibrary/DistanceMetrics/RMSDDistance.h"
#include "MPLibrary/DistanceMetrics/TopologicalDistance.h"
#include "MPLibrary/DistanceMetrics/WorkspaceTranslationDistance.h"
#include "MPLibrary/EdgeValidityCheckers/IntermediatesEdgeValidityChecker.h"
#include "MPLibrary/Extenders/BasicExtender.h"
#include "MPLibrary/Extenders/RotationThenTranslation.h"
#include "MPLibrary/LocalPlanners/StraightLine.h"
#include "MPLibrary/LocalPlanners/HierarchicalLP.h"
#include "MPLibrary/MapEvaluators/CBSQuery.h"
#include "MPLibrary/MapEvaluators/ClearanceQuery.h"
#include "MPLibrary/MapEvaluators/ConditionalEvaluator.h"
#include "MPLibrary/MapEvaluators/CollisionEvaluator.h"
#include "MPLibrary/MapEvaluators/ComposeEvaluator.h"
#include "MPLibrary/MapEvaluators/GroupQuery.h"
#include "MPLibrary/MapEvaluators/LazyQuery.h"
#include "MPLibrary/MapEvaluators/MinimumDistanceEvaluator.h"
#include "MPLibrary/MapEvaluators/NegateEvaluator.h"
#include "MPLibrary/MapEvaluators/PathEvaluator.h"
#include "MPLibrary/MapEvaluators/PrintMapEvaluation.h"
#include "MPLibrary/MapEvaluators/QueryMethod.h"
#include "MPLibrary/MapEvaluators/SIPPMethod.h"
#include "MPLibrary/MapEvaluators/TimeEvaluator.h"
#include "MPLibrary/Metrics/NumNodesMetric.h"
#include "MPLibrary/Metrics/NumEdgesMetric.h"
#include "MPLibrary/Metrics/TimeMetric.h"
#include "MPLibrary/MPStrategies/AdaptiveRRT.h"
#include "MPLibrary/MPStrategies/BasicPRM.h"
#include "MPLibrary/MPStrategies/BasicRRTStrategy.h"
#include "MPLibrary/MPStrategies/DynamicDomainRRT.h"
#include "MPLibrary/MPStrategies/DynamicRegionRRT.h"
#include "MPLibrary/MPStrategies/DynamicRegionsPRM.h"
#include "MPLibrary/MPStrategies/EET.h"
#include "MPLibrary/MPStrategies/GroupDecoupledStrategy.h"
#include "MPLibrary/MPStrategies/GroupPRM.h"
#include "MPLibrary/MPStrategies/ModifyPath.h"
#include "MPLibrary/MPStrategies/Syclop.h"
#include "MPLibrary/MPStrategies/TogglePRMStrategy.h"
#include "MPLibrary/MPStrategies/WrenchAccessibilityStrategy.h"
#include "MPLibrary/NeighborhoodFinders/BruteForceNF.h"
#include "MPLibrary/NeighborhoodFinders/KdTreeNF.h"
#include "MPLibrary/NeighborhoodFinders/RadiusNF.h"
#include "MPLibrary/NeighborhoodFinders/RandomNF.h"
#include "MPLibrary/PathModifiers/ShortcuttingPathModifier.h"
#include "MPLibrary/Samplers/BridgeTestSampler.h"
#include "MPLibrary/Samplers/GaussianSampler.h"
#include "MPLibrary/Samplers/MixSampler.h"
#include "MPLibrary/Samplers/ObstacleBasedSampler.h"
#include "MPLibrary/Samplers/UniformRandomSampler.h"
#include "MPLibrary/ValidityCheckers/CollisionDetectionValidity.h"
#include "MPLibrary/ValidityCheckers/AlwaysTrueValidity.h"
#include "MPLibrary/ValidityCheckers/ComposeCollision.h"
#include "MPLibrary/ValidityCheckers/ComposeValidity.h"
#include "MPLibrary/ValidityCheckers/NodeClearanceValidity.h"
#include "MPLibrary/ValidityCheckers/ObstacleClearanceValidity.h"
#include "MPLibrary/ValidityCheckers/TerrainValidityChecker.h"
#include "MPLibrary/ValidityCheckers/TopologicalMapValidity.h"
Go to the source code of this file.
Data Structures | |
struct | MPUniverse |
Defines available methods in the Motion Planning Universe. More... | |
#define ADAPTIVE_RRT_AVAILABLE 1 |
#define ADD_CLASS_IF_AVAILABLE | ( | r, | |
data, | |||
elem | |||
) |
#define ALWAYS_TRUE_AVAILABLE 1 |
#define BASIC_EXTENDER_AVAILABLE 1 |
#define BASIC_PRM_AVAILABLE 1 |
#define BASIC_RRT_AVAILABLE 1 |
#define BIN_LP_SWEPT_AVAILABLE 1 |
#define BOOST_PP_SEQ_ENUM_0 |
#define BRIDGE_TEST_AVAILABLE 1 |
#define BRUTE_FORCE_NF_AVAILABLE 1 |
#define CBS_QUERY_AVAILABLE 1 |
#define CCS_CONNECTOR_AVAILABLE 1 |
#define CLEARANCE_QUERY_AVAILABLE 1 |
#define COLLISION_EVAL_AVAILABLE 1 |
#define COMPOSE_CD_AVAILABLE 1 |
#define COMPOSE_EVAL_AVAILABLE 1 |
#define COMPOSE_VC_AVAILABLE 1 |
#define CONDITIONAL_EVAL_AVAILABLE 1 |
#define CONN_SEQ BOOST_PP_SEQ_FOR_EACH(ADD_CLASS_IF_AVAILABLE, _, CONNECTOR_CLASSES) |
#define CONNECTOR_CLASSES |
#define DM_CLASSES |
#define DM_SEQ BOOST_PP_SEQ_FOR_EACH(ADD_CLASS_IF_AVAILABLE, _, DM_CLASSES) |
#define DYNAMIC_DOMAIN_RRT_AVAILABLE 1 |
#define DYNAMIC_REGION_PRM_AVAILABLE 1 |
#define DYNAMIC_REGION_RRT_AVAILABLE 1 |
#define EET_AVAILABLE 1 |
#define EUCLIDEAN_AVAILABLE 1 |
#define EVC_CLASSES ((IntermediatesEdgeValidityChecker, INTERMEDIATES_EVC_AVAILABLE)) |
#define EVC_SEQ BOOST_PP_SEQ_FOR_EACH(ADD_CLASS_IF_AVAILABLE, _, EVC_CLASSES) |
#define EXT_CLASSES |
#define EXT_SEQ BOOST_PP_SEQ_FOR_EACH(ADD_CLASS_IF_AVAILABLE, _, EXT_CLASSES) |
#define GAUSSIAN_AVAILABLE 1 |
#define GROUP_DECOUPLED_STRAT_AVAILABLE 1 |
#define GROUP_PRM_AVAILABLE 1 |
#define GROUP_QUERY_AVAILABLE 1 |
#define HIERARCHICAL_LP_AVAILABLE 1 |
#define INTERMEDIATES_EVC_AVAILABLE 1 |
#define KDTREE_NF_AVAILABLE 1 |
#define LAZY_QUERY_AVAILABLE 1 |
#define LP_CLASSES |
#define LP_SEQ BOOST_PP_SEQ_FOR_EACH(ADD_CLASS_IF_AVAILABLE, _, LP_CLASSES) |
#define LP_SWEPT_AVAILABLE 1 |
#define MANHATTAN_AVAILABLE 1 |
#define ME_CLASSES |
#define ME_SEQ BOOST_PP_SEQ_FOR_EACH(ADD_CLASS_IF_AVAILABLE, _, ME_CLASSES) |
#define METRIC_CLASSES |
#define METRIC_SEQ BOOST_PP_SEQ_FOR_EACH(ADD_CLASS_IF_AVAILABLE, _, METRIC_CLASSES) |
#define MIN_DIST_EVAL_AVAILABLE 1 |
#define MINKOWSKI_AVAILABLE 1 |
#define MIX_SAMPLER_AVAILABLE 1 |
#define MODIFY_PATH_AVAILABLE 1 |
#define MPSTRATEGY_CLASSES |
#define MPSTRATEGY_SEQ BOOST_PP_SEQ_FOR_EACH(ADD_CLASS_IF_AVAILABLE, _, MPSTRATEGY_CLASSES) |
#define NEGATE_EVAL_AVAILABLE 1 |
#define NEIGHBOR_CONNECTOR_AVAILABLE 1 |
#define NF_CLASSES |
#define NF_SEQ BOOST_PP_SEQ_FOR_EACH(ADD_CLASS_IF_AVAILABLE, _, NF_CLASSES) |
#define NODE_CLEARANCE_VC_AVAILABLE 1 |
#define NUM_EDGES_AVAILABLE 1 |
#define NUM_NODES_AVAILABLE 1 |
#define OBSTACLE_BASED_SAMPLER_AVAILABLE 1 |
#define OBSTACLE_CLEARANCE_VC_AVAILABLE 1 |
#define PATH_EVAL_AVAILABLE 1 |
#define PATH_STRATEGY_AVAILABLE 0 |
#define PM_CLASSES ((ShortcuttingPathModifier, SHORTCUTTING_AVAILABLE)) |
#define PM_SEQ BOOST_PP_SEQ_FOR_EACH(ADD_CLASS_IF_AVAILABLE, _, PM_CLASSES) |
#define PRINT_MAP_AVAILABLE 1 |
#define QUERY_METHOD_AVAILABLE 1 |
#define RADIUS_NF_AVAILABLE 1 |
#define RANDOM_NF_AVAILABLE 1 |
#define REWIRE_CONNECTOR_AVAILABLE 1 |
#define RMSD_AVAILABLE 1 |
#define ROTATION_THEN_TRANSLATION_AVAILABLE 1 |
#define SAMPLER_CLASSES |
#define SAMPLER_SEQ BOOST_PP_SEQ_FOR_EACH(ADD_CLASS_IF_AVAILABLE, _, SAMPLER_CLASSES) |
#define SCALED_EUCLIDEAN_AVAILABLE 0 |
#define SHORTCUTTING_AVAILABLE 1 |
#define SIPP_METHOD_AVAILABLE 1 |
#define STRAIGHT_LINE_AVAILABLE 1 |
#define SYCLOP_AVAILABLE 1 |
#define TERRAIN_VC_AVAILABLE 1 |
#define TIME_EVAL_AVAILABLE 1 |
#define TIME_METRIC_AVAILABLE 1 |
#define TOGGLE_PRM_AVAILABLE 1 |
#define TOPOLOGICAL_DISTANCE_AVAILABLE 1 |
#define TOPOLOGICAL_MAP_VC_AVAILABLE 1 |
#define UNIFORM_OBSTACLE_AVAILABLE 0 |
#define UNIFORM_RANDOM_AVAILABLE 1 |
#define VC_CLASSES |
#define VC_SEQ BOOST_PP_SEQ_FOR_EACH(ADD_CLASS_IF_AVAILABLE, _, VC_CLASSES) |
#define WEIGHTED_EUCLIDEAN_AVAILABLE 1 |
#define WORKSPACE_TRANSLATION_AVAILABLE 1 |
#define WRENCH_ACCESS_STRAT_AVAILABLE 1 |