Search results
Results from the WOW.Com Content Network
Automated planning and scheduling, sometimes denoted as simply AI planning, [1] is a branch of artificial intelligence that concerns the realization of strategies or action sequences, typically for execution by intelligent agents, autonomous robots and unmanned vehicles.
A partial-order planner is an algorithm or program which will construct a partial-order plan and search for a solution. The input is the problem description, consisting of descriptions of the initial state, the goal and possible actions. The problem can be interpreted as a search problem where the set of possible partial-order plans is the ...
Generative artificial intelligence (generative AI, GenAI, [166] or GAI) is a subset of artificial intelligence that uses generative models to produce text, images, videos, or other forms of data. [ 167 ] [ 168 ] [ 169 ] These models learn the underlying patterns and structures of their training data and use them to produce new data [ 170 ...
The book's chapters span from classical AI topics like searching algorithms and first-order logic, propositional logic and probabilistic reasoning to advanced topics such as multi-agent systems, constraint satisfaction problems, optimization problems, artificial neural networks, deep learning, reinforcement learning, and computer vision. [7]
Physics-informed neural networks for solving Navier–Stokes equations. Physics-informed neural networks (PINNs), [1] also referred to as Theory-Trained Neural Networks (TTNs), [2] are a type of universal function approximators that can embed the knowledge of any physical laws that govern a given data-set in the learning process, and can be described by partial differential equations (PDEs).
The book by Kennedy and Eberhart [5] describes many philosophical aspects of PSO and swarm intelligence. An extensive survey of PSO applications is made by Poli . [ 6 ] [ 7 ] In 2017, a comprehensive review on theoretical and experimental works on PSO has been published by Bonyadi and Michalewicz.
A partially observable Markov decision process (POMDP) is a generalization of a Markov decision process (MDP). A POMDP models an agent decision process in which it is assumed that the system dynamics are determined by an MDP, but the agent cannot directly observe the underlying state.
A minimum spanning tree of a weighted planar graph.Finding a minimum spanning tree is a common problem involving combinatorial optimization. Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, [1] where the set of feasible solutions is discrete or can be reduced to a discrete set.