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.

291 lines
13 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(unlockedDoors), [](cell c) {
  33. return c.type == Type::Door;
  34. });
  35. std::copy_if(gridCells.begin(), gridCells.end(), std::back_inserter(goals), [](cell c) {
  36. return c.type == Type::Goal;
  37. });
  38. std::copy_if(gridCells.begin(), gridCells.end(), std::back_inserter(keys), [](cell c) {
  39. return c.type == Type::Key;
  40. });
  41. std::copy_if(gridCells.begin(), gridCells.end(), std::back_inserter(boxes), [](cell c) {
  42. return c.type == Type::Box;
  43. });
  44. agent = *std::find_if(gridCells.begin(), gridCells.end(), [](cell c) {
  45. return c.type == Type::Agent;
  46. });
  47. std::copy_if(gridCells.begin(), gridCells.end(), std::back_inserter(adversaries), [](cell c) {
  48. return c.type == Type::Adversary;
  49. });
  50. agentNameAndPositionMap.insert({ "Agent", agent.getCoordinates() });
  51. for(auto const& adversary : adversaries) {
  52. std::string color = adversary.getColor();
  53. color.at(0) = std::toupper(color.at(0));
  54. try {
  55. if(gridOptions.agentsToBeConsidered.size() != 0 && std::find(gridOptions.agentsToBeConsidered.begin(), gridOptions.agentsToBeConsidered.end(), color) == gridOptions.agentsToBeConsidered.end()) continue;
  56. auto success = agentNameAndPositionMap.insert({ color, adversary.getCoordinates() });
  57. if(!success.second) {
  58. throw std::logic_error("Agent with " + color + " already present\n");
  59. }
  60. } catch(const std::logic_error& e) {
  61. std::cerr << "Expected agents colors to be different. Agent with color : '" << color << "' already present." << std::endl;
  62. throw;
  63. }
  64. }
  65. for(auto const& color : allColors) {
  66. cells cellsOfColor;
  67. std::copy_if(background.begin(), background.end(), std::back_inserter(cellsOfColor), [&color](cell c) {
  68. return c.type == Type::Floor && c.color == color;
  69. });
  70. if(cellsOfColor.size() > 0) {
  71. backgroundTiles.emplace(color, cellsOfColor);
  72. }
  73. }
  74. }
  75. std::ostream& operator<<(std::ostream& os, const Grid& grid) {
  76. int lastRow = 1;
  77. for(auto const& cell : grid.allGridCells) {
  78. if(lastRow != cell.row)
  79. os << std::endl;
  80. os << static_cast<char>(cell.type) << static_cast<char>(cell.color);
  81. lastRow = cell.row;
  82. }
  83. return os;
  84. }
  85. cells Grid::getGridCells() {
  86. return allGridCells;
  87. }
  88. bool Grid::isBlocked(coordinates p) {
  89. return isWall(p) || isLockedDoor(p) || isKey(p);
  90. }
  91. bool Grid::isWall(coordinates p) {
  92. return std::find_if(walls.begin(), walls.end(),
  93. [p](cell cell) {
  94. return cell.row == p.first && cell.column == p.second;
  95. }) != walls.end();
  96. }
  97. bool Grid::isLockedDoor(coordinates p) {
  98. return std::find_if(lockedDoors.begin(), lockedDoors.end(),
  99. [p](cell cell) {
  100. return cell.row == p.first && cell.column == p.second;
  101. }) != lockedDoors.end();
  102. }
  103. bool Grid::isUnlockedDoor(coordinates p) {
  104. return std::find_if(unlockedDoors.begin(), unlockedDoors.end(),
  105. [p](cell cell) {
  106. return cell.row == p.first && cell.column == p.second;
  107. }) != unlockedDoors.end();
  108. }
  109. bool Grid::isKey(coordinates p) {
  110. return std::find_if(keys.begin(), keys.end(),
  111. [p](cell cell) {
  112. return cell.row == p.first && cell.column == p.second;
  113. }) != keys.end();
  114. }
  115. bool Grid::isBox(coordinates p) {
  116. return std::find_if(boxes.begin(), boxes.end(),
  117. [p](cell cell) {
  118. return cell.row == p.first && cell.column == p.second;
  119. }) != boxes.end();
  120. }
  121. void Grid::applyOverwrites(std::string& str, std::vector<Configuration>& configuration) {
  122. for (auto& config : configuration) {
  123. if (!config.overwrite_) {
  124. continue;
  125. }
  126. size_t start_pos;
  127. if (config.type_ == ConfigType::Formula) {
  128. start_pos = str.find("formula " + config.identifier_);
  129. } else if (config.type_ == ConfigType::Label) {
  130. start_pos = str.find("label " + config.identifier_);
  131. } else if (config.type_ == ConfigType::Module) {
  132. start_pos = str.find(config.identifier_);
  133. }
  134. size_t end_pos = str.find(';', start_pos) + 1;
  135. std::string expression = config.expression_;
  136. str.replace(start_pos, end_pos - start_pos , expression);
  137. }
  138. }
  139. void Grid::printToPrism(std::ostream& os, std::vector<Configuration>& configuration ,const prism::ModelType& modelType) {
  140. cells northRestriction;
  141. cells eastRestriction;
  142. cells southRestriction;
  143. cells westRestriction;
  144. cells walkable = floor;
  145. cells conditionallyWalkable;
  146. walkable.insert(walkable.end(), goals.begin(), goals.end());
  147. walkable.insert(walkable.end(), boxes.begin(), boxes.end());
  148. walkable.push_back(agent);
  149. walkable.insert(walkable.end(), adversaries.begin(), adversaries.end());
  150. walkable.insert(walkable.end(), lava.begin(), lava.end());
  151. conditionallyWalkable.insert(conditionallyWalkable.end(), keys.begin(), keys.end());
  152. conditionallyWalkable.insert(conditionallyWalkable.end(), lockedDoors.begin(), lockedDoors.end());
  153. conditionallyWalkable.insert(conditionallyWalkable.end(), unlockedDoors.begin(), unlockedDoors.end());
  154. for(auto const& c : walkable) {
  155. if(isBlocked(c.getNorth())) northRestriction.push_back(c);
  156. if(isBlocked(c.getEast())) eastRestriction.push_back(c);
  157. if(isBlocked(c.getSouth())) southRestriction.push_back(c);
  158. if(isBlocked(c.getWest())) westRestriction.push_back(c);
  159. }
  160. // TODO Add doors here (list of doors keys etc)
  161. // walkable.insert(walkable.end(), lockedDoors.begin(), lockedDoors.end());
  162. // walkable.insert(walkable.end(), unlockedDoors.begin(), unlockedDoors.end());
  163. for(auto const& c : conditionallyWalkable) {
  164. if(isBlocked(c.getNorth())) northRestriction.push_back(c);
  165. if(isBlocked(c.getEast())) eastRestriction.push_back(c);
  166. if(isBlocked(c.getSouth())) southRestriction.push_back(c);
  167. if(isBlocked(c.getWest())) westRestriction.push_back(c);
  168. }
  169. prism::PrismModulesPrinter printer(modelType, agentNameAndPositionMap.size(), configuration, gridOptions.enforceOneWays);
  170. printer.printModel(os, modelType);
  171. if(modelType == prism::ModelType::SMG) {
  172. printer.printGlobalMoveVariable(os, agentNameAndPositionMap.size());
  173. }
  174. for(auto const &backgroundTilesOfColor : backgroundTiles) {
  175. for(auto agentNameAndPosition = agentNameAndPositionMap.begin(); agentNameAndPosition != agentNameAndPositionMap.end(); ++agentNameAndPosition) {
  176. printer.printBackgroundLabels(os, agentNameAndPosition->first, backgroundTilesOfColor);
  177. }
  178. }
  179. cells noTurnFloor;
  180. if(gridOptions.enforceOneWays) {
  181. for(auto const& c : floor) {
  182. cell east = c.getEast(allGridCells);
  183. cell south = c.getSouth(allGridCells);
  184. cell west = c.getWest(allGridCells);
  185. cell north = c.getNorth(allGridCells);
  186. if( (east.type == Type::Wall && west.type == Type::Wall) or
  187. (north.type == Type::Wall && south.type == Type::Wall) ) {
  188. noTurnFloor.push_back(c);
  189. }
  190. }
  191. }
  192. for(auto agentNameAndPosition = agentNameAndPositionMap.begin(); agentNameAndPosition != agentNameAndPositionMap.end(); ++agentNameAndPosition) {
  193. printer.printFormulas(os, agentNameAndPosition->first, northRestriction, eastRestriction, southRestriction, westRestriction, { slipperyNorth, slipperyEast, slipperySouth, slipperyWest }, lava, walls, noTurnFloor, slipperyNorth, slipperyEast, slipperySouth, slipperyWest, keys);
  194. printer.printGoalLabel(os, agentNameAndPosition->first, goals);
  195. printer.printKeysLabels(os, agentNameAndPosition->first, keys);
  196. }
  197. std::vector<AgentName> agentNames;
  198. std::transform(agentNameAndPositionMap.begin(),
  199. agentNameAndPositionMap.end(),
  200. std::back_inserter(agentNames),
  201. [](const std::map<AgentNameAndPosition::first_type,AgentNameAndPosition::second_type>::value_type &pair){return pair.first;});
  202. if(modelType == prism::ModelType::SMG) {
  203. printer.printCrashLabel(os, agentNames);
  204. }
  205. size_t agentIndex = 0;
  206. for(auto agentNameAndPosition = agentNameAndPositionMap.begin(); agentNameAndPosition != agentNameAndPositionMap.end(); ++agentNameAndPosition, agentIndex++) {
  207. AgentName agentName = agentNameAndPosition->first;
  208. //std::cout << "Agent Name: " << agentName << std::endl;
  209. bool agentWithView = std::find(gridOptions.agentsWithView.begin(), gridOptions.agentsWithView.end(), agentName) != gridOptions.agentsWithView.end();
  210. bool agentWithProbabilisticBehaviour = std::find(gridOptions.agentsWithProbabilisticBehaviour.begin(), gridOptions.agentsWithProbabilisticBehaviour.end(), agentName) != gridOptions.agentsWithProbabilisticBehaviour.end();
  211. std::set<std::string> slipperyActions;
  212. printer.printInitStruct(os, agentName, keys);
  213. if(agentWithProbabilisticBehaviour) printer.printModule(os, agentName, agentIndex, maxBoundaries, agentNameAndPosition->second, keys, backgroundTiles, agentWithView, gridOptions.probabilitiesForActions);
  214. else printer.printModule(os, agentName, agentIndex, maxBoundaries, agentNameAndPosition->second, keys, backgroundTiles, agentWithView);
  215. for(auto const& c : slipperyNorth) {
  216. printer.printSlipperyMove(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::North);
  217. if(!gridOptions.enforceOneWays) printer.printSlipperyTurn(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::North);
  218. }
  219. for(auto const& c : slipperyEast) {
  220. printer.printSlipperyMove(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::East);
  221. if(!gridOptions.enforceOneWays) printer.printSlipperyTurn(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::East);
  222. }
  223. for(auto const& c : slipperySouth) {
  224. printer.printSlipperyMove(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::South);
  225. if(!gridOptions.enforceOneWays) printer.printSlipperyTurn(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::South);
  226. }
  227. for(auto const& c : slipperyWest) {
  228. printer.printSlipperyMove(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::West);
  229. if(!gridOptions.enforceOneWays) printer.printSlipperyTurn(os, agentName, agentIndex, c.getCoordinates(), slipperyActions, getWalkableDirOf8Neighborhood(c), prism::PrismModulesPrinter::SlipperyType::West);
  230. }
  231. printer.printEndmodule(os);
  232. if(modelType == prism::ModelType::SMG) {
  233. if(agentWithProbabilisticBehaviour) printer.printPlayerStruct(os, agentNameAndPosition->first, agentWithView, gridOptions.probabilitiesForActions, slipperyActions);
  234. else printer.printPlayerStruct(os, agentNameAndPosition->first, agentWithView, {}, slipperyActions);
  235. }
  236. //if(!stateRewards.empty()) {
  237. printer.printRewards(os, agentName, stateRewards, lava, goals, backgroundTiles);
  238. //}
  239. if (!configuration.empty()) {
  240. printer.printConfiguration(os, configuration);
  241. }
  242. }
  243. for (auto const & key : keys) {
  244. os << "\n";
  245. printer.printKeyModule(os, key, maxBoundaries);
  246. printer.printEndmodule(os);
  247. }
  248. }
  249. std::array<bool, 8> Grid::getWalkableDirOf8Neighborhood(cell c) /* const */ {
  250. return (std::array<bool, 8>)
  251. {
  252. !isBlocked(c.getNorth()),
  253. !isBlocked(c.getNorth(allGridCells).getEast()),
  254. !isBlocked(c.getEast()),
  255. !isBlocked(c.getSouth(allGridCells).getEast()),
  256. !isBlocked(c.getSouth()),
  257. !isBlocked(c.getSouth(allGridCells).getWest()),
  258. !isBlocked(c.getWest()),
  259. !isBlocked(c.getNorth(allGridCells).getWest())
  260. };
  261. }