Artificial intelligence

High-profile applications of AI include advanced web search engineschatbotsvirtual assistantsautonomous vehicles, play and analysis in strategy games (e.g., chess and Go), and content generation (e.g. images, audio, and videos).

The traditional goals of AI research include learning, reasoningknowledge representationplanningnatural language processing, and perception, as well as support for robotics.[a] To reach these goals, AI researchers use techniques including state space search and mathematical optimisationformal logicartificial neural networks, and methods based on statisticsoperations research, and economics.[b] AI also draws upon psychologylinguisticsphilosophyneuroscience, and other fields.[2] Some companies, such as OpenAIGoogle DeepMind, and Meta, aim to create artificial general intelligence (AGI)—AI that can complete nearly any cognitive task at least as well as a human.[3]

The general problem of simulating (or creating) intelligence has been broken down into subproblems. These consist of specific traits or capabilities that researchers expect an intelligent system to display. The traits described below have received the most attention and cover the scope of AI research.[a]

Many of these algorithms were insufficient for solving large reasoning problems because they experienced a “combinatorial explosion”, meaning they become exponentially slower as the problems grow.[14] Even humans rarely use the step-by-step deduction that early AI research could model. Humans solve most of their problems using fast, intuitive judgments.[15]

The symbolic approach has difficulty with several problems: the breadth of commonsense knowledge (the set of atomic facts the average person knows is enormous),[30] the sub-symbolic form of most commonsense knowledge (much of what people know is not represented as “facts” or “statements” they can express verbally),[15] and knowledge acquisition (the problem of obtaining knowledge for AI applications).[e]

In classical planning, the agent knows exactly what the effect of any action will be.[36] In most real-world problems, however, the agent may not be certain about the situation it is in (it is “unknown” or “unobservable”) and it may not know for certain what will happen after each possible action (it is not “deterministic”). It must choose an action by making a probabilistic guess and then reassess the situation to see if the action worked.[37]

Markov decision process has a transition model that describes the probability that a particular action will change the state in a particular way and a reward function that supplies the utility of each state and the cost of each action. A policy associates a decision with each possible state. The policy could be calculated (e.g., by policy iteration), determined by a heuristic, or learned.[41]

Leave a Comment

Your email address will not be published. Required fields are marked *