10 #ifndef MAP_PATHFINDING_TRANSITIONS_H_
11 #define MAP_PATHFINDING_TRANSITIONS_H_
14 #include "../../generic_defs/transition_system.h"
93 bool loadMap(std::string file_name);
bool isDummyAction(const MapDir &action) const
Definition: map_pathfinding_transitions.cpp:345
Definition: map_pathfinding_transitions.h:41
bool setDiagonalCost(double d_cost)
Definition: map_pathfinding_transitions.cpp:189
bool canNorth(const MapLocation &state) const
Definition: map_pathfinding_transitions.cpp:357
unsigned map_height
The map height.
Definition: map_pathfinding_transitions.h:216
unsigned getMapHeight() const
Definition: map_pathfinding_transitions.cpp:174
void set4Connected()
Definition: map_pathfinding_transitions.cpp:179
virtual double getActionCost(const MapLocation &state, const MapDir &action) const
Definition: map_pathfinding_transitions.cpp:240
virtual ~MapPathfindingTransitions()
Definition: map_pathfinding_transitions.cpp:42
virtual MapDir getInverse(const MapLocation &state, const MapDir &action) const
Definition: map_pathfinding_transitions.cpp:315
void clearMap()
Definition: map_pathfinding_transitions.cpp:350
bool canWest(const MapLocation &state) const
Definition: map_pathfinding_transitions.cpp:381
bool isNWEmpty(const MapLocation &state) const
Definition: map_pathfinding_transitions.cpp:403
double diag_cost
The cost of a diagonal move.
Definition: map_pathfinding_transitions.h:219
bool canSouth(const MapLocation &state) const
Definition: map_pathfinding_transitions.cpp:374
bool loadMap(std::string file_name)
Definition: map_pathfinding_transitions.cpp:46
Definition: map_location.h:21
unsigned getMapWidth() const
Definition: map_pathfinding_transitions.cpp:169
std::vector< std::vector< bool > > grid_empty
Indexed by location, indicates if it is empty or an obstacle.
Definition: map_pathfinding_transitions.h:220
void set8Connected()
Definition: map_pathfinding_transitions.cpp:184
bool isSEEmpty(const MapLocation &state) const
Definition: map_pathfinding_transitions.cpp:393
MapDir getDummyAction() const
Definition: map_pathfinding_transitions.cpp:340
bool is4Connected() const
Definition: map_pathfinding_transitions.cpp:199
Definition: transition_system.h:23
bool isNEEmpty(const MapLocation &state) const
Definition: map_pathfinding_transitions.cpp:388
bool is8Connected() const
Definition: map_pathfinding_transitions.cpp:204
std::ostream & operator<<(std::ostream &out, const MapDir &dir)
Definition: map_pathfinding_transitions.cpp:408
virtual void applyAction(MapLocation &state, const MapDir &action) const
Definition: map_pathfinding_transitions.cpp:247
unsigned map_width
The map width.
Definition: map_pathfinding_transitions.h:215
MapPathfindingTransitions(bool four_dirs=true)
Definition: map_pathfinding_transitions.cpp:31
bool isSWEmpty(const MapLocation &state) const
Definition: map_pathfinding_transitions.cpp:398
bool canEast(const MapLocation &state) const
Definition: map_pathfinding_transitions.cpp:367
virtual bool isApplicable(const MapLocation &state, const MapDir &action) const
Definition: map_pathfinding_transitions.cpp:209
virtual void getActions(const MapLocation &state, std::vector< MapDir > &actions) const
Definition: map_pathfinding_transitions.cpp:283
bool four_connected
If the map is 4-connected or 8-connected.
Definition: map_pathfinding_transitions.h:218
virtual bool isInvertible(const MapLocation &state, const MapDir &action) const
Definition: map_pathfinding_transitions.cpp:308