$search

FootstepPlannerEnvironment.h

Go to the documentation of this file.

// SVN $HeadURL: http://alufr-ros-pkg.googlecode.com/svn/trunk/humanoid_stacks/humanoid_navigation/footstep_planner/include/footstep_planner/FootstepPlannerEnvironment.h $
// SVN $Id: FootstepPlannerEnvironment.h 3979 2013-02-26 14:13:46Z garimort@informatik.uni-freiburg.de $

/*
 * A footstep planner for humanoid robots
 *
 * Copyright 2010-2011 Johannes Garimort, Armin Hornung, University of Freiburg
 * http://www.ros.org/wiki/footstep_planner
 *
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, version 3.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

#ifndef FOOTSTEP_PLANNER_FOOTSTEPPLANNERENVIRONMENT_H_
#define FOOTSTEP_PLANNER_FOOTSTEPPLANNERENVIRONMENT_H_

#include <footstep_planner/helper.h>
#include <footstep_planner/PathCostHeuristic.h>
#include <footstep_planner/Heuristic.h>
#include <footstep_planner/Footstep.h>
#include <footstep_planner/PlanningState.h>
#include <footstep_planner/State.h>
#include <humanoid_nav_msgs/ClipFootstep.h>
#include <sbpl/headers.h>

#include <math.h>
#include <vector>
#include <tr1/unordered_set>
#include <tr1/hashtable.h>


namespace footstep_planner
{
struct environment_params
{
  std::vector<Footstep> footstep_set;
  boost::shared_ptr<Heuristic> heuristic;
  std::vector<std::pair<int, int> > step_range;
  double footsize_x, footsize_y, footsize_z;
  double foot_origin_shift_x, foot_origin_shift_y;
  double max_footstep_x, max_footstep_y, max_footstep_theta;
  double max_inverse_footstep_x, max_inverse_footstep_y,
         max_inverse_footstep_theta;
  double step_cost;
  int    collision_check_accuracy;
  int    hash_table_size;
  double cell_size;
  int    num_angle_bins;
  bool   forward_search;
  double max_step_width;
  int    num_random_nodes;
  double random_node_distance;
  double heuristic_scale;
};


class FootstepPlannerEnvironment : public DiscreteSpaceInformation
{
public:
  // specialization of hash<int,int>, similar to standard boost::hash on pairs?
  struct IntPairHash{
  public:
    size_t operator()(std::pair<int, int> x) const throw() {
      size_t seed = std::tr1::hash<int>()(x.first);
      return std::tr1::hash<int>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
  };

  typedef std::vector<int> exp_states_t;
  typedef exp_states_t::const_iterator exp_states_iter_t;
  typedef std::tr1::unordered_set<std::pair<int,int>, IntPairHash > exp_states_2d_t;
  typedef exp_states_2d_t::const_iterator exp_states_2d_iter_t;

  FootstepPlannerEnvironment(const environment_params& params);

  virtual ~FootstepPlannerEnvironment();

  void updateGoal(const State& foot_left, const State& foot_right);

  void updateStart(const State& foot_left, const State& right_right);

  void updateMap(gridmap_2d::GridMap2DPtr map);

  bool occupied(const State& s);

  bool getState(unsigned int id, State* s);

  void reset();

  int getNumExpandedStates() { return ivNumExpandedStates; };

  exp_states_2d_iter_t getExpandedStatesStart()
  {
    return ivExpandedStates.begin();
  };

  exp_states_2d_iter_t getExpandedStatesEnd()
  {
    return ivExpandedStates.end();
  };

  exp_states_iter_t getRandomStatesStart()
  {
    return ivRandomStates.begin();
  };

  exp_states_iter_t getRandomStatesEnd()
  {
    return ivRandomStates.end();
  };

  int GetFromToHeuristic(int FromStateID, int ToStateID);

  int GetGoalHeuristic(int stateID);

  int GetStartHeuristic(int stateID);

  void GetSuccs(int SourceStateID, std::vector<int> *SuccIDV,
                std::vector<int> *CostV);

  void GetPreds(int TargetStateID, std::vector<int> *PredIDV,
                std::vector<int> *CostV);

  virtual void GetRandomSuccsatDistance(int SourceStateID,
                                        std::vector<int>* SuccIDV,
                                        std::vector<int>* CLowV);

  virtual void GetRandomPredsatDistance(int TargetStateID,
                                        std::vector<int>* PredIDV,
                                        std::vector<int>* CLowV);

  void GetSuccsTo(int SourceStateID, int goalStateID,
                  std::vector<int> *SuccIDV, std::vector<int> *CostV);

  bool AreEquivalent(int StateID1, int StateID2);

  bool InitializeEnv(const char *sEnvFile);

  bool InitializeMDPCfg(MDPConfig *MDPCfg);

  void PrintEnv_Config(FILE *fOut);

  void PrintState(int stateID, bool bVerbose, FILE *fOut);

  void SetAllActionsandAllOutcomes(CMDPSTATE *state);

  void SetAllPreds(CMDPSTATE *state);

  int SizeofCreatedEnv();

  bool reachable(const PlanningState& from, const PlanningState& to);

  void getPredsOfGridCells(const std::vector<State>& changed_states,
                           std::vector<int>* pred_ids);

  void getSuccsOfGridCells(const std::vector<State>& changed_states,
                           std::vector<int>* succ_ids);

  void updateHeuristicValues();

  static const int cvMmScale = 1000;

protected:
  int GetFromToHeuristic(const PlanningState& from, const PlanningState& to);

  int  stepCost(const PlanningState& a, const PlanningState& b);

  bool occupied(const PlanningState& s);

  void GetRandomNeighs(const PlanningState* currentState,
                       std::vector<int>* NeighIDV,
                       std::vector<int>* CLowV,
                       int nNumofNeighs, int nDist_c, bool bSuccs);

  const PlanningState* createNewHashEntry(const State& s);

  const PlanningState* createNewHashEntry(const PlanningState& s);

  const PlanningState* getHashEntry(const State& s);

  const PlanningState* getHashEntry(const PlanningState& s);

  const PlanningState* createHashEntryIfNotExists(const PlanningState& s);

  bool closeToGoal(const PlanningState& from);

  bool closeToStart(const PlanningState& from);

  bool pointWithinPolygon(const std::pair<int, int>& point,
                          const std::vector<std::pair<int, int> >& edges);

  struct less
  {
    bool operator ()(const PlanningState* a,
                     const PlanningState* b) const;
  };

  int ivIdStartFootLeft;
  int ivIdStartFootRight;
  int ivIdGoalFootLeft;
  int ivIdGoalFootRight;

  std::vector<const PlanningState*> ivStateId2State;

  std::vector<const PlanningState*>* ivpStateHash2State;

  const std::vector<Footstep>& ivFootstepSet;

  const boost::shared_ptr<Heuristic> ivHeuristicConstPtr;

  const double ivFootsizeX;
  const double ivFootsizeY;

  const double ivOriginFootShiftX;
  const double ivOriginFootShiftY;

  const int ivMaxFootstepX;
  const int ivMaxFootstepY;
  int ivMaxFootstepTheta;

  const int ivMaxInvFootstepX;
  const int ivMaxInvFootstepY;
  int ivMaxInvFootstepTheta;

  const int ivStepCost;

  const int ivCollisionCheckAccuracy;

  const int ivHashTableSize;

  const double ivCellSize;
  const int ivNumAngleBins;

  const bool ivForwardSearch;

  double ivMaxStepWidth;

  const int ivNumRandomNodes;
  const int ivRandomNodeDist;

  double ivHeuristicScale;

  bool ivHeuristicExpired;

  boost::shared_ptr<gridmap_2d::GridMap2D> ivMapPtr;

  exp_states_2d_t ivExpandedStates;
  exp_states_t ivRandomStates;  
  size_t ivNumExpandedStates;

  bool* ivStepRange;
};
}

#endif  // FOOTSTEP_PLANNER_FOOTSTEPPLANNERENVIRONMENT_H_

---

footstep_planner
Author(s): Johannes Garimort, Armin Hornung
autogenerated on Tue Mar 5 11:43:55 2013