$search

environment_robarm.h

Go to the documentation of this file.

/*
 * Copyright (c) 2008, Maxim Likhachev
 * All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 * 
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name of the University of Pennsylvania nor the names of its
 *       contributors may be used to endorse or promote products derived from
 *       this software without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */
#ifndef __ENVIRONMENT_ROBARM_H_
#define __ENVIRONMENT_ROBARM_H_



#define NUMOFLINKS 6


#define ROBARM_LONGACTIONDIST_CELLS 30   //for R* max. distance in coord to a sample point. It should be exactly this, for one of the coordinates and this or smaller for the rest
#define ROBARM_NUMOFRANDSUCCSATDIST 10           //# of random successors at distance defined above, used by R* search

//if cleared then the intersection of the whole arm against obstacles 
//and bounds is checked
#define ENDEFF_CHECK_ONLY 0

#define UNIFORM_COST 1  //all the actions have the same costs when set


#define INVALID_NUMBER 999


typedef struct
{
        short unsigned int x;
        short unsigned int y;
        bool bIsObstacle;
}CELLV;


//state structure
typedef struct STATE2D_t
{
        unsigned int g;
        short unsigned int iterationclosed;
    short unsigned int x;
    short unsigned int y;
} State2D;


typedef struct ENV_ROBARM_CONFIG
{
        double EnvWidth_m;
        double EnvHeight_m;
        int EnvWidth_c;
        int EnvHeight_c;
        int BaseX_c;
        short unsigned int EndEffGoalX_c;
        short unsigned int EndEffGoalY_c;
        double LinkLength_m[NUMOFLINKS];
        double LinkStartAngles_d[NUMOFLINKS];
        double LinkGoalAngles_d[NUMOFLINKS];
        char** Grid2D;
        double GridCellWidth;

        double angledelta[NUMOFLINKS];
        int anglevals[NUMOFLINKS];

} EnvROBARMConfig_t;



typedef struct ENVROBARMHASHENTRY
{
        int stateID;
        //state coordinates
        short unsigned int coord[NUMOFLINKS];  
        short unsigned int endeffx;
        short unsigned int endeffy;
} EnvROBARMHashEntry_t;


typedef struct
{
    EnvROBARMHashEntry_t* goalHashEntry;
    EnvROBARMHashEntry_t* startHashEntry;
    
        //Maps from coords to stateId   
        int HashTableSize;
        vector<EnvROBARMHashEntry_t*>* Coord2StateIDHashTable;

        //vector that maps from stateID to coords       
        vector<EnvROBARMHashEntry_t*> StateID2CoordTable;

        //any additional variables
    int** Heur; //h[fromx][fromy][tox][toy] = Heur[to][from], where to= tox+toy*width_c, from = fromx+fromy*width_c

}EnvironmentROBARM_t;

class EnvironmentROBARM : public DiscreteSpaceInformation
{

public:

        bool InitializeEnv(const char* sEnvFile);

        bool InitializeMDPCfg(MDPConfig *MDPCfg);

        int  GetFromToHeuristic(int FromStateID, int ToStateID);
        int  GetGoalHeuristic(int stateID);
        int  GetStartHeuristic(int stateID);
        void SetAllActionsandAllOutcomes(CMDPSTATE* state);
        void SetAllPreds(CMDPSTATE* state);
        void GetSuccs(int SourceStateID, vector<int>* SuccIDV, vector<int>* CostV);
        void GetPreds(int TargetStateID, vector<int>* PredIDV, vector<int>* CostV);

        int      SizeofCreatedEnv();
        void PrintState(int stateID, bool bVerbose, FILE* fOut=NULL);
        void PrintEnv_Config(FILE* fOut);


    ~EnvironmentROBARM(){};
    void PrintTimeStat(FILE* fOut);
        
 private:

        //member data
        EnvROBARMConfig_t EnvROBARMCfg;
        EnvironmentROBARM_t EnvROBARM;



        void ComputeContAngles(short unsigned int coord[NUMOFLINKS], double angle[NUMOFLINKS]);
        void ComputeCoord(double angle[NUMOFLINKS], short unsigned int coord[NUMOFLINKS]);
        int ComputeEndEffectorPos(double angles[NUMOFLINKS], short unsigned int*  pX, short unsigned int* pY);
        int IsValidCoord(short unsigned int coord[NUMOFLINKS], char** Grid2D=NULL, vector<CELLV>* pTestedCells=NULL);
        int distanceincoord(unsigned short* statecoord1, unsigned short* statecoord2);
        void ReInitializeState2D(State2D* state);
        void InitializeState2D(State2D* state, short unsigned int x, short unsigned int y);
        void Search2DwithQueue(State2D** statespace, int* HeurGrid, int searchstartx, int searchstarty);
        void Create2DStateSpace(State2D*** statespace2D);
        void Delete2DStateSpace(State2D*** statespace2D);
        void printangles(FILE* fOut, short unsigned int* coord, bool bGoal, bool bVerbose, bool bLocal);
        void DiscretizeAngles();
        void Cell2ContXY(int x, int y, double *pX, double *pY);
        void ContXY2Cell(double x, double y, short unsigned int* pX, short unsigned int *pY);
        int IsValidLineSegment(double x0, double y0, double x1, double y1, char **Grid2D,
                                                        vector<CELLV>* pTestedCells);
        void GetRandomSuccsatDistance(int SourceStateID, std::vector<int>* SuccIDV, std::vector<int>* CLowV);
        unsigned int GetHeurBasedonCoord(short unsigned int coord[NUMOFLINKS]);
        void PrintHeader(FILE* fOut);
        int cost(short unsigned int state1coord[], short unsigned int state2coord[]);

        


        void ReadConfiguration(FILE* fCfg);

        void InitializeEnvConfig();

        unsigned int GETHASHBIN(short unsigned int* coord, int numofcoord);

        void PrintHashTableHist();


        EnvROBARMHashEntry_t* GetHashEntry(short unsigned int* coord, int numofcoord, bool bIsGoal);

        EnvROBARMHashEntry_t* CreateNewHashEntry(short unsigned int* coord, int numofcoord,  short unsigned int endeffx, short unsigned int endeffy);


        void CreateStartandGoalStates();

        bool InitializeEnvironment();

        void ComputeHeuristicValues();

        bool IsValidCell(int X, int Y);

        bool IsWithinMapCell(int X, int Y);


        int GetEdgeCost(int FromStateID, int ToStateID);
        int GetRandomState();
        bool AreEquivalent(int State1ID, int State2ID);

        void PrintSuccGoal(int SourceStateID, int costtogoal, bool bVerbose, bool bLocal /*=false*/, FILE* fOut /*=NULL*/);


};







#endif

---

sbpl
Author(s): Maxim Likhachev/maximl@seas.upenn.edu
autogenerated on Fri Mar 1 14:18:57 2013