![]() Identifies all the best possible sequence of actions to reach the goal stateįrom the current state. The state-space forms aĭirected map or graph where nodes are the states, links between the nodes areĪctions, and the path is a sequence of states connected by the sequence of Initial state followed by any sequence of actions. State-space of a problem is a set of all states which can be reached from the Model together define the state-space of the problem implicitly. Note: Initial state, actions, and transition Remember, an optimal solution has the lowest path cost among all the solutions. The problem-solving agent selects a cost function, which reflects its performance measure.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |