00001 /* 00002 * Copyright (c) 2010, Maxim Likhachev 00003 * All rights reserved. 00004 * 00005 * Redistribution and use in source and binary forms, with or without 00006 * modification, are permitted provided that the following conditions are met: 00007 * 00008 * * Redistributions of source code must retain the above copyright 00009 * notice, this list of conditions and the following disclaimer. 00010 * * Redistributions in binary form must reproduce the above copyright 00011 * notice, this list of conditions and the following disclaimer in the 00012 * documentation and/or other materials provided with the distribution. 00013 * * Neither the name of the University of Pennsylvania nor the names of its 00014 * contributors may be used to endorse or promote products derived from 00015 * this software without specific prior written permission. 00016 * 00017 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 00018 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00019 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00020 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 00021 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 00022 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 00023 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 00024 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 00025 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 00026 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 00027 * POSSIBILITY OF SUCH DAMAGE. 00028 */ 00029 00030 #ifndef _SBPL_PARAMS_H_ 00031 #define _SBPL_PARAMS_H_ 00032 00033 #include <iostream> 00034 #include <string> 00035 #include <vector> 00036 #include <iterator> 00037 #include <ros/ros.h> 00038 #include <angles/angles.h> 00039 #include <sstream> 00040 #include <boost/algorithm/string.hpp> 00041 00042 namespace sbpl_interface { 00043 00044 #define DEG2RAD(d) ((d)*(M_PI/180.0)) 00045 #define RAD2DEG(r) ((r)*(180.0/M_PI)) 00046 typedef std::vector<std::vector<double> > MPrim; 00047 typedef std::vector<int> Coords; 00048 00049 typedef struct 00050 { 00051 char type; 00052 int nsteps; 00053 int id; 00054 int group; 00055 MPrim m; 00056 Coords coord; 00057 } MotionPrimitive; 00058 00059 class SBPLParams 00060 { 00061 public: 00062 00064 SBPLParams(); 00065 00067 ~SBPLArmPlannerParams(){}; 00068 00071 double epsilon_; 00072 00074 bool use_multires_mprims_; 00075 00077 bool use_bfs_heuristic_; 00078 00080 bool use_orientation_solver_; 00081 00083 bool use_ik_; 00084 00086 bool use_6d_pose_goal_; 00087 00089 bool sum_heuristics_; 00090 00093 bool use_uniform_cost_; 00094 00096 bool verbose_; 00097 00099 bool verbose_heuristics_; 00100 00102 bool verbose_collisions_; 00103 00105 int angle_delta_; 00106 00108 std::vector<std::vector<double> > mprims_; 00109 00111 int num_mprims_; 00112 00114 int num_long_dist_mprims_; 00115 00117 int num_short_dist_mprims_; 00118 00121 int short_dist_mprims_thresh_c_; 00122 00125 double short_dist_mprims_thresh_m_; 00126 00127 std::string planner_name_; 00128 00129 std::string environment_type_; // "jointspace" or "cartesian" 00130 00132 int cost_multiplier_; 00133 00134 int range1_cost_; 00135 int range2_cost_; 00136 int range3_cost_; 00137 00139 int cost_per_cell_; 00140 00143 int cost_per_meter_; 00144 00146 int is_goal_function_; 00147 00149 bool two_calls_to_op_; 00150 00152 bool use_research_heuristic_; 00153 00154 double max_mprim_offset_; 00155 00157 double sizeX_; 00158 double sizeY_; 00159 double sizeZ_; 00160 00162 double resolution_; 00163 00165 double originX_; 00166 double originY_; 00167 double originZ_; 00168 00169 int solve_for_ik_thresh_; 00170 double solve_for_ik_thresh_m_; 00171 00172 std::string reference_frame_; 00173 00174 /* For Cartesian Arm Planner */ 00175 std::vector<MotionPrimitive> mp_; 00176 double xyz_resolution_; 00177 double rpy_resolution_; 00178 double fa_resolution_; 00179 00180 int cost_per_second_; 00181 double time_per_cell_; 00182 std::vector<double> joint_vel_; 00183 00184 std::string group_name_; 00185 std::vector<std::string> planning_joints_; 00186 00187 00188 std::string expands_log_; 00189 std::string expands2_log_; 00190 std::string ik_log_; 00191 std::string arm_log_; 00192 std::string cspace_log_; 00193 std::string solution_log_; 00194 std::string expands_log_level_; 00195 std::string expands2_log_level_; 00196 std::string ik_log_level_; 00197 std::string arm_log_level_; 00198 std::string cspace_log_level_; 00199 std::string solution_log_level_; 00200 00201 std::vector<std::string> motion_primitive_type_names_; 00202 }; 00203 00204 } 00205 00206 #endif