人工智能解决的问题_通过搜索人工智能解决问题

人工智能解决的问题

Whenever the agent is confronted by a problem, its first action is seeking a solution is its knowledge system. This is known as the search for the solution in the knowledge base. Another attempt can be to search for a solution by going into different states. The search of the agent stops in the state when the agent reaches the goal state.

只要代理人遇到问题，其第一个行动就是寻求解决方案就是其知识系统。 这被称为在知识库中搜索解决方案。 另一种尝试是通过进入不同的状态来寻找解决方案。 当代理商达到目标状态时，代理商的搜索将在该状态下停止。

There are many approaches for searching a particular goal state from all the states that the agent can be in.

有多种方法可以从代理可以处于的所有状态中搜索特定目标状态。

There are many search algorithms which are followed by an agent for solving the problems by searching. Some of them are:

有许多搜索算法，其后是用于通过搜索解决问题的代理程序。 他们之中有一些是：

• Random search:

  随机搜寻：

  In this search technique, an agent just keeps checking any random state for being it the goal state. This is not an effective way to search the solution because, in this search, each node can be searched again and again, there is no fixed path followed, problems like infinite searching can be faced.

  在这种搜索技术中，座席只是不断检查任何随机状态是否是目标状态。 这不是搜索解决方案的有效方法，因为在此搜索中，可以一次又一次地搜索每个节点，没有遵循固定的路径，因此可能会遇到无限搜索之类的问题。

• Breadth-first search (BFS):

  广度优先搜索(BFS)：

  In this type of search, the agent considers every state as a node of a tree data structure. It first checks the current node and then evaluates all the neighboring nodes. After all the neighboring nodes are checked, it moves towards the next set of neighboring nodes for any of the neighbor nodes, and this process continues until the search is ended. In BFS, the nodes of the tree are traversed level after level.

  在这种类型的搜索中，代理将每个状态视为树数据结构的一个节点。 它首先检查当前节点，然后评估所有相邻节点。 在检查完所有相邻节点之后，它将移向任何一个相邻节点的下一组相邻节点，并且此过程将继续进行直到搜索结束。 在BFS中，树的节点逐级遍历。

• Depth-first search (DFS):

  深度优先搜索(DFS)：

  In the DFS, the search first begins from the root node and first one of the child node’s sub-tree is completely traversed. That is, first all the one-sided nodes are checked, and then the other sided nodes are checked.

  在DFS中，搜索首先从根节点开始，并且完全遍历子节点的子树中的第一个子树。 即，首先检查所有单侧节点，然后检查另一侧节点。

• Best First Search (Heuristic Search):

  最佳优先搜索(启发式搜索)：

  In the best first search, which is also known as the heuristic search, the agent picks up the best node based upon the heuristic value irrespective of where the node is.

  在最佳的第一搜索(也称为启发式搜索)中，代理基于启发式值选择最佳节点，而与节点的位置无关。

• A* search:

  A *搜索：

  It is one of the best and popular techniques used in pathfinding and graph traversals. It decides the node to be traversed on the basis of an f-score which is calculated according to some norms and the node with the highest f-score gets traversed. Here, the f-score is calculated on the basis of misplaced events and number of nodes which needs to be moved to in order to replace the nodes.

  它是在路径查找和图形遍历中使用的最佳且流行的技术之一。 它基于根据某些规范计算的f分数来确定要遍历的节点，并且遍历具有最高f分数的节点。 在此，f分数是根据放错位置的事件和需要移动以替换节点的节点数来计算的。

翻译自: https://www.includehelp.com/ml-ai/solving-problem-by-searching-in-artificial-intelligence.aspx

人工智能解决的问题