You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

229 lines
11 KiB

  1. #include "Grid.h"
  2. #include <algorithm>
  3. Grid::Grid(cells gridCells, cells background, const GridOptions &gridOptions, const std::map<coordinates, float> &stateRewards)
  4. : allGridCells(gridCells), background(background), gridOptions(gridOptions), stateRewards(stateRewards)
  5. {
  6. cell max = allGridCells.at(allGridCells.size() - 1);
  7. maxBoundaries = std::make_pair(max.row - 1, max.column - 1);
  8. std::copy_if(gridCells.begin(), gridCells.end(), std::back_inserter(walls), [](cell c) {
  9. return c.type == Type::Wall;
  10. });
  11. std::copy_if(gridCells.begin(), gridCells.end(), std::back_inserter(lava), [](cell c) {
  12. return c.type == Type::Lava;
  13. });
  14. std::copy_if(gridCells.begin(), gridCells.end(), std::back_inserter(floor), [](cell c) {
  15. return c.type == Type::Floor;
  16. });
  17. std::copy_if(background.begin(), background.end(), std::back_inserter(slipperyNorth), [](cell c) {
  18. return c.type == Type::SlipperyNorth;
  19. });
  20. std::copy_if(background.begin(), background.end(), std::back_inserter(slipperyEast), [](cell c) {
  21. return c.type == Type::SlipperyEast;
  22. });
  23. std::copy_if(background.begin(), background.end(), std::back_inserter(slipperySouth), [](cell c) {
  24. return c.type == Type::SlipperySouth;
  25. });
  26. std::copy_if(background.begin(), background.end(), std::back_inserter(slipperyWest), [](cell c) {
  27. return c.type == Type::SlipperyWest;
  28. });
  29. std::copy_if(gridCells.begin(), gridCells.end(), std::back_inserter(lockedDoors), [](cell c) {
  30. return c.type == Type::LockedDoor;
  31. });
  32. std::copy_if(gridCells.begin(), gridCells.end(), std::back_inserter(goals), [](cell c) {
  33. return c.type == Type::Goal;
  34. });
  35. std::copy_if(gridCells.begin(), gridCells.end(), std::back_inserter(keys), [](cell c) {
  36. return c.type == Type::Key;
  37. });
  38. std::copy_if(gridCells.begin(), gridCells.end(), std::back_inserter(boxes), [](cell c) {
  39. return c.type == Type::Box;
  40. });
  41. agent = *std::find_if(gridCells.begin(), gridCells.end(), [](cell c) {
  42. return c.type == Type::Agent;
  43. });
  44. std::copy_if(gridCells.begin(), gridCells.end(), std::back_inserter(adversaries), [](cell c) {
  45. return c.type == Type::Adversary;
  46. });
  47. agentNameAndPositionMap.insert({ "Agent", agent.getCoordinates() });
  48. for(auto const& adversary : adversaries) {
  49. std::string color = adversary.getColor();
  50. color.at(0) = std::toupper(color.at(0));
  51. try {
  52. if(gridOptions.agentsToBeConsidered.size() != 0 && std::find(gridOptions.agentsToBeConsidered.begin(), gridOptions.agentsToBeConsidered.end(), color) == gridOptions.agentsToBeConsidered.end()) continue;
  53. auto success = agentNameAndPositionMap.insert({ color, adversary.getCoordinates() });
  54. if(!success.second) {
  55. throw std::logic_error("Agent with " + color + " already present\n");
  56. }
  57. } catch(const std::logic_error& e) {
  58. std::cerr << "Expected agents colors to be different. Agent with color : '" << color << "' already present." << std::endl;
  59. throw;
  60. }
  61. }
  62. for(auto const& color : allColors) {
  63. cells cellsOfColor;
  64. std::copy_if(background.begin(), background.end(), std::back_inserter(cellsOfColor), [&color](cell c) {
  65. return c.type == Type::Floor && c.color == color;
  66. });
  67. if(cellsOfColor.size() > 0) {
  68. backgroundTiles.emplace(color, cellsOfColor);
  69. }
  70. }
  71. }
  72. std::ostream& operator<<(std::ostream& os, const Grid& grid) {
  73. int lastRow = 1;
  74. for(auto const& cell : grid.allGridCells) {
  75. if(lastRow != cell.row)
  76. os << std::endl;
  77. os << static_cast<char>(cell.type) << static_cast<char>(cell.color);
  78. lastRow = cell.row;
  79. }
  80. return os;
  81. }
  82. cells Grid::getGridCells() {
  83. return allGridCells;
  84. }
  85. bool Grid::isBlocked(coordinates p) {
  86. return isWall(p) || isLockedDoor(p) || isKey(p);
  87. }
  88. bool Grid::isWall(coordinates p) {
  89. return std::find_if(walls.begin(), walls.end(),
  90. [p](cell cell) {
  91. return cell.row == p.first && cell.column == p.second;
  92. }) != walls.end();
  93. }
  94. bool Grid::isLockedDoor(coordinates p) {
  95. return std::find_if(lockedDoors.begin(), lockedDoors.end(),
  96. [p](cell cell) {
  97. return cell.row == p.first && cell.column == p.second;
  98. }) != lockedDoors.end();
  99. }
  100. bool Grid::isKey(coordinates p) {
  101. return std::find_if(keys.begin(), keys.end(),
  102. [p](cell cell) {
  103. return cell.row == p.first && cell.column == p.second;
  104. }) != keys.end();
  105. }
  106. bool Grid::isBox(coordinates p) {
  107. return std::find_if(boxes.begin(), boxes.end(),
  108. [p](cell cell) {
  109. return cell.row == p.first && cell.column == p.second;
  110. }) != boxes.end();
  111. }
  112. void Grid::printToPrism(std::ostream& os, const prism::ModelType& modelType) {
  113. cells northRestriction;
  114. cells eastRestriction;
  115. cells southRestriction;
  116. cells westRestriction;
  117. cells walkable = floor;
  118. walkable.insert(walkable.end(), goals.begin(), goals.end());
  119. walkable.insert(walkable.end(), boxes.begin(), boxes.end());
  120. walkable.push_back(agent);
  121. walkable.insert(walkable.end(), adversaries.begin(), adversaries.end());
  122. walkable.insert(walkable.end(), lava.begin(), lava.end());
  123. for(auto const& c : walkable) {
  124. if(isBlocked(c.getNorth())) northRestriction.push_back(c);
  125. if(isBlocked(c.getEast())) eastRestriction.push_back(c);
  126. if(isBlocked(c.getSouth())) southRestriction.push_back(c);
  127. if(isBlocked(c.getWest())) westRestriction.push_back(c);
  128. }
  129. prism::PrismModulesPrinter printer(modelType, agentNameAndPositionMap.size(), gridOptions.enforceOneWays);
  130. printer.printModel(os, modelType);
  131. if(modelType == prism::ModelType::SMG) {
  132. printer.printGlobalMoveVariable(os, agentNameAndPositionMap.size());
  133. }
  134. for(auto const &backgroundTilesOfColor : backgroundTiles) {
  135. for(auto agentNameAndPosition = agentNameAndPositionMap.begin(); agentNameAndPosition != agentNameAndPositionMap.end(); ++agentNameAndPosition) {
  136. printer.printBackgroundLabels(os, agentNameAndPosition->first, backgroundTilesOfColor);
  137. }
  138. }
  139. cells noTurnFloor;
  140. if(gridOptions.enforceOneWays) {
  141. for(auto const& c : floor) {
  142. cell east = c.getEast(allGridCells);
  143. cell south = c.getSouth(allGridCells);
  144. cell west = c.getWest(allGridCells);
  145. cell north = c.getNorth(allGridCells);
  146. if( (east.type == Type::Wall && west.type == Type::Wall) or
  147. (north.type == Type::Wall && south.type == Type::Wall) ) {
  148. noTurnFloor.push_back(c);
  149. }
  150. }
  151. }
  152. for(auto agentNameAndPosition = agentNameAndPositionMap.begin(); agentNameAndPosition != agentNameAndPositionMap.end(); ++agentNameAndPosition) {
  153. printer.printFormulas(os, agentNameAndPosition->first, northRestriction, eastRestriction, southRestriction, westRestriction, { slipperyNorth, slipperyEast, slipperySouth, slipperyWest }, lava, walls, noTurnFloor, slipperyNorth, slipperyEast, slipperySouth, slipperyWest);
  154. printer.printGoalLabel(os, agentNameAndPosition->first, goals);
  155. printer.printKeysLabels(os, agentNameAndPosition->first, keys);
  156. }
  157. std::vector<AgentName> agentNames;
  158. std::transform(agentNameAndPositionMap.begin(),
  159. agentNameAndPositionMap.end(),
  160. std::back_inserter(agentNames),
  161. [](const std::map<AgentNameAndPosition::first_type,AgentNameAndPosition::second_type>::value_type &pair){return pair.first;});
  162. if(modelType == prism::ModelType::SMG) {
  163. printer.printCrashLabel(os, agentNames);
  164. }
  165. size_t agentIndex = 0;
  166. for(auto agentNameAndPosition = agentNameAndPositionMap.begin(); agentNameAndPosition != agentNameAndPositionMap.end(); ++agentNameAndPosition, agentIndex++) {
  167. AgentName agentName = agentNameAndPosition->first;
  168. bool agentWithView = std::find(gridOptions.agentsWithView.begin(), gridOptions.agentsWithView.end(), agentName) != gridOptions.agentsWithView.end();
  169. bool agentWithProbabilisticBehaviour = std::find(gridOptions.agentsWithProbabilisticBehaviour.begin(), gridOptions.agentsWithProbabilisticBehaviour.end(), agentName) != gridOptions.agentsWithProbabilisticBehaviour.end();
  170. std::set<std::string> slipperyActions;
  171. printer.printInitStruct(os, agentName);
  172. if(agentWithProbabilisticBehaviour) printer.printModule(os, agentName, agentIndex, maxBoundaries, agentNameAndPosition->second, keys, backgroundTiles, agentWithView, gridOptions.probabilitiesForActions);
  173. else printer.printModule(os, agentName, agentIndex, maxBoundaries, agentNameAndPosition->second, keys, backgroundTiles, agentWithView);
  174. for(auto const& c : slipperyNorth) {
  175. printer.printSlipperyMove(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::North);
  176. if(!gridOptions.enforceOneWays) printer.printSlipperyTurn(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::North);
  177. }
  178. for(auto const& c : slipperyEast) {
  179. printer.printSlipperyMove(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::East);
  180. if(!gridOptions.enforceOneWays) printer.printSlipperyTurn(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::East);
  181. }
  182. for(auto const& c : slipperySouth) {
  183. printer.printSlipperyMove(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::South);
  184. if(!gridOptions.enforceOneWays) printer.printSlipperyTurn(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::South);
  185. }
  186. for(auto const& c : slipperyWest) {
  187. printer.printSlipperyMove(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::West);
  188. if(!gridOptions.enforceOneWays) printer.printSlipperyTurn(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::West);
  189. }
  190. printer.printEndmodule(os);
  191. if(modelType == prism::ModelType::SMG) {
  192. if(agentWithProbabilisticBehaviour) printer.printPlayerStruct(os, agentNameAndPosition->first, agentWithView, gridOptions.probabilitiesForActions, slipperyActions);
  193. else printer.printPlayerStruct(os, agentNameAndPosition->first, agentWithView, {}, slipperyActions);
  194. }
  195. //if(!stateRewards.empty()) {
  196. printer.printRewards(os, agentName, stateRewards, lava, goals, backgroundTiles);
  197. //}
  198. }
  199. }
  200. std::array<bool, 8> Grid::getWalkableDirOf8Neighborhood(cell c) /* const */ {
  201. return (std::array<bool, 8>)
  202. {
  203. !isBlocked(c.getNorth()),
  204. !isBlocked(c.getNorth(allGridCells).getEast()),
  205. !isBlocked(c.getEast()),
  206. !isBlocked(c.getSouth(allGridCells).getEast()),
  207. !isBlocked(c.getSouth()),
  208. !isBlocked(c.getSouth(allGridCells).getWest()),
  209. !isBlocked(c.getWest()),
  210. !isBlocked(c.getNorth(allGridCells).getWest())
  211. };
  212. }