Solution: It is an action sequence which leads from the start node to the goal node.Path Cost: It is a function which assigns a numeric cost to each path.Transition model: A description of what each action do, can be represented as a transition model.Actions: It gives the description of all the available actions to the agent.The root of the search tree is the root node which is corresponding to the initial state. Search tree: A tree representation of search problem is called Search tree.Goal test: It is a function which observe the current state and returns whether the goal state is achieved or not.Start State: It is a state from where agent begins the search. ![]() Search Space: Search space represents a set of possible solutions, which a system may have.A search problem can have three main factors: ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |