You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Seems to me from the code and the video demo that the agent exhibits two behaviours.
Find position closest to the first coin in dictionary
Subject to constraint that it is not contained in a .3x.3 bounding box of any hazards
So if there is a monster at the midpoint of the player and the coin, but displaced from the coin by at least .3 in either direction, the agent will run directly into the monster because it only cares about danger at the destination but not the path. This seems to happen in the demo.
Some ideas are to (i) only consider solutions in the neighbourhood of the player (relative vector with bounds), or to (ii) change the fitness function to measure distance from the segment with endpoints at player and coin and (iii) consider the coin closest to the solution.
As it is the agent is exhibiting behaviour that could be easily found using simple path finding rather than GA.
The text was updated successfully, but these errors were encountered:
Seems to me from the code and the video demo that the agent exhibits two behaviours.
So if there is a monster at the midpoint of the player and the coin, but displaced from the coin by at least .3 in either direction, the agent will run directly into the monster because it only cares about danger at the destination but not the path. This seems to happen in the demo.
Some ideas are to (i) only consider solutions in the neighbourhood of the player (relative vector with bounds), or to (ii) change the fitness function to measure distance from the segment with endpoints at player and coin and (iii) consider the coin closest to the solution.
As it is the agent is exhibiting behaviour that could be easily found using simple path finding rather than GA.
The text was updated successfully, but these errors were encountered: