https://padlet.com/STEMLearningDesignDevelopment/kkr4abfb62eyob4x Reflect on your learning and think about how it finds an optimal solution to a problem. Post your response below. en-us 2021-07-07 02:23:38 UTC 2025-04-24 08:00:58 UTC hello@padlet.com https://padlet-uploads.storage.googleapis.com/1261430453/4303bd8ef6a3f4f4cd5e3b7b8c4e3076/AI_brain.png https://padlet.com/STEMLearningDesignDevelopment/kkr4abfb62eyob4x/wish/1666163025 Provided that the "Weights" are correct for a task the A* algorithm works by expanding the lowest cost action it can currently perform, This is repeated until the desired goal is found. If the "Weights" for each task are correctly assigned then the lowest "Cost" action path will have been found.]]> 2021-08-02 01:32:40 UTC https://padlet.com/STEMLearningDesignDevelopment/kkr4abfb62eyob4x/wish/1666163025 https://padlet.com/STEMLearningDesignDevelopment/kkr4abfb62eyob4x/wish/1674188808 The algorithm will confirm if it's heading down the right path and expand the node if its the lowest cost value. In the end, when the A* reaches the goal state, and the solution is the lowest cost out all possible routes, then it can define that it has achieved success. ]]> 2021-08-10 14:36:00 UTC https://padlet.com/STEMLearningDesignDevelopment/kkr4abfb62eyob4x/wish/1674188808 https://padlet.com/STEMLearningDesignDevelopment/kkr4abfb62eyob4x/wish/1679677037 The algorithm is always keeping track of the lowest possible path cost for every node it has visited, if there is any lower possible path cost then it will expand that path until it either reaches the goal or a lower possible path cost is found and the process is repeated until the goal is found.]]> 2021-08-16 00:22:27 UTC https://padlet.com/STEMLearningDesignDevelopment/kkr4abfb62eyob4x/wish/1679677037