#include <sbpl_lattice_planner.h>
Definition at line 24 of file sbpl_lattice_planner.h.
sbpl_lattice_planner::SBPLLatticePlanner::SBPLLatticePlanner |
( |
| ) |
|
sbpl_lattice_planner::SBPLLatticePlanner::SBPLLatticePlanner |
( |
std::string |
name, |
|
|
costmap_2d::Costmap2DROS * |
costmap_ros |
|
) |
| |
virtual sbpl_lattice_planner::SBPLLatticePlanner::~SBPLLatticePlanner |
( |
| ) |
|
|
inlinevirtual |
unsigned char sbpl_lattice_planner::SBPLLatticePlanner::computeCircumscribedCost |
( |
| ) |
|
|
private |
unsigned char sbpl_lattice_planner::SBPLLatticePlanner::costMapCostToSBPLCost |
( |
unsigned char |
newcost | ) |
|
|
private |
bool sbpl_lattice_planner::SBPLLatticePlanner::makePlan |
( |
const geometry_msgs::PoseStamped & |
start, |
|
|
const geometry_msgs::PoseStamped & |
goal, |
|
|
std::vector< geometry_msgs::PoseStamped > & |
plan |
|
) |
| |
|
virtual |
Given a goal pose in the world, compute a plan.
- Parameters
-
start | The start pose |
goal | The goal pose |
plan | The plan... filled by the planner |
- Returns
- True if a valid plan was found, false otherwise
Implements nav_core::BaseGlobalPlanner.
Definition at line 273 of file sbpl_lattice_planner.cpp.
void sbpl_lattice_planner::SBPLLatticePlanner::publishStats |
( |
int |
solution_cost, |
|
|
int |
solution_size, |
|
|
const geometry_msgs::PoseStamped & |
start, |
|
|
const geometry_msgs::PoseStamped & |
goal |
|
) |
| |
|
private |
double sbpl_lattice_planner::SBPLLatticePlanner::allocated_time_ |
|
private |
unsigned char sbpl_lattice_planner::SBPLLatticePlanner::circumscribed_cost_ |
|
private |
std::string sbpl_lattice_planner::SBPLLatticePlanner::cost_map_topic_ |
|
private |
what type of environment in which to plan. choices are 2D and XYThetaLattice.
Definition at line 81 of file sbpl_lattice_planner.h.
unsigned int sbpl_lattice_planner::SBPLLatticePlanner::current_env_height_ |
|
private |
unsigned int sbpl_lattice_planner::SBPLLatticePlanner::current_env_width_ |
|
private |
EnvironmentNAVXYTHETALAT* sbpl_lattice_planner::SBPLLatticePlanner::env_ |
|
private |
std::string sbpl_lattice_planner::SBPLLatticePlanner::environment_type_ |
|
private |
int sbpl_lattice_planner::SBPLLatticePlanner::force_scratch_limit_ |
|
private |
bool sbpl_lattice_planner::SBPLLatticePlanner::forward_search_ |
|
private |
double sbpl_lattice_planner::SBPLLatticePlanner::initial_epsilon_ |
|
private |
bool sbpl_lattice_planner::SBPLLatticePlanner::initialized_ |
|
private |
unsigned char sbpl_lattice_planner::SBPLLatticePlanner::inscribed_inflated_obstacle_ |
|
private |
unsigned char sbpl_lattice_planner::SBPLLatticePlanner::lethal_obstacle_ |
|
private |
the number of cells that have to be changed in the costmap to force the planner to plan from scratch even if its an incremental planner
Definition at line 87 of file sbpl_lattice_planner.h.
std::string sbpl_lattice_planner::SBPLLatticePlanner::name_ |
|
private |
SBPLPlanner* sbpl_lattice_planner::SBPLLatticePlanner::planner_ |
|
private |
std::string sbpl_lattice_planner::SBPLLatticePlanner::planner_type_ |
|
private |
sbpl method to use for planning. choices are ARAPlanner and ADPlanner
Definition at line 75 of file sbpl_lattice_planner.h.
std::string sbpl_lattice_planner::SBPLLatticePlanner::primitive_filename_ |
|
private |
unsigned char sbpl_lattice_planner::SBPLLatticePlanner::sbpl_cost_multiplier_ |
|
private |
ros::Publisher sbpl_lattice_planner::SBPLLatticePlanner::stats_publisher_ |
|
private |
The documentation for this class was generated from the following files: