|
Hierarchical Task Network
In artificial intelligence, hierarchical task network (HTN) planning is an approach to automated planning in which the dependency among actions can be given in the form of hierarchically structured networks. Planning problems are specified in the hierarchical task network approach by providing a set of tasks, which can be: # primitive (initial state) tasks, which roughly correspond to the actions of STRIPS; # compound tasks (intermediate state), which can be seen as composed of a set of simpler tasks; # goal tasks (goal state), which roughly corresponds to the goals of STRIPS, but are more general. A solution to an HTN problem is then an executable sequence of primitive tasks that can be obtained from the initial task network by decomposing compound tasks into their set of simpler tasks, and by inserting ordering constraints. A primitive task is an action that can be executed directly given the state in which it is executed supports its precondition. A compound task is a comple ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Artificial Intelligence
Artificial intelligence (AI) is intelligence—perceiving, synthesizing, and inferring information—demonstrated by machines, as opposed to intelligence displayed by animals and humans. Example tasks in which this is done include speech recognition, computer vision, translation between (natural) languages, as well as other mappings of inputs. The ''Oxford English Dictionary'' of Oxford University Press defines artificial intelligence as: the theory and development of computer systems able to perform tasks that normally require human intelligence, such as visual perception, speech recognition, decision-making, and translation between languages. AI applications include advanced web search engines (e.g., Google), recommendation systems (used by YouTube, Amazon and Netflix), understanding human speech (such as Siri and Alexa), self-driving cars (e.g., Tesla), automated decision-making and competing at the highest level in strategic game systems (such as chess and Go). ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Automated Planning
Automation describes a wide range of technologies that reduce human intervention in processes, namely by predetermining decision criteria, subprocess relationships, and related actions, as well as embodying those predeterminations in machines. Automation has been achieved by various means including mechanical, hydraulic, pneumatic, electrical, electronic devices, and computers, usually in combination. Complicated systems, such as modern factories, airplanes, and ships typically use combinations of all of these techniques. The benefit of automation includes labor savings, reducing waste, savings in electricity costs, savings in material costs, and improvements to quality, accuracy, and precision. Automation includes the use of various equipment and control systems such as machinery, processes in factories, boilers, and heat-treating ovens, switching on telephone networks, steering, and stabilization of ships, aircraft, and other applications and vehicles with reduced human inte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stanford Research Institute Problem Solver
The Stanford Research Institute Problem Solver, known by its acronym STRIPS, is an automated planner developed by Richard Fikes and Nils Nilsson in 1971 at SRI International. The same name was later used to refer to the formal language of the inputs to this planner. This language is the base for most of the languages for expressing automated planning problem instances in use today; such languages are commonly known as action languages. This article only describes the language, not the planner. Definition A STRIPS instance is composed of: * An initial state; * The specification of the goal states – situations which the planner is trying to reach; * A set of actions. For each action, the following are included: ** preconditions (what must be established before the action is performed); ** postconditions (what is established after the action is performed). Mathematically, a STRIPS instance is a quadruple \langle P,O,I,G \rangle, in which each component has the following meaning: ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Task Analysis Environment Modeling Simulation
Task Analysis, Environment Modeling, and Simulation (TAEMS or TÆMS) is a problem domain independent modeling language used to describe the task structures and the problem-solving activities of intelligent agents in a multi-agent environment.{{cite web , author=Bryan Horling , author2=Victor Lesser , author3=Regis Vincent , author4=Tom Wagner , author5=Anita Raja , author6=Shelley Zhang , author7=Keith Decker , author8=Alan Garvey , title=The Taems White Paper , year=1999 , url=https://mas.cs.umass.edu/research_old/taems/white/taemswhite.pdf , location=Multi-Agent Systems Lab , publisher=University of Massachusetts The intelligent agent operates in environments where: * responses by specific deadlines may be required * the information required for the optimal performance of a computational task may not be available * the results of the computations of multiple agents to interdependent subproblems may need to be aggregated together in order to solve a high-level goal * an agent may ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Artificial Intelligence Center
The Artificial Intelligence Center is a laboratory in the Information and Computing Sciences Division of SRI International. It was founded in 1966 by Charles Rosen and studies artificial intelligence. One of their early projects was Shakey the Robot, the first general-purpose mobile robot. More recently, the center funded early development of CALO and Siri. The center has also provided the military with various technology. See also * Augmentation Research Center SRI International's Augmentation Research Center (ARC) was founded in the 1960s by electrical engineer Douglas Engelbart to develop and experiment with new tools and techniques for collaboration and information processing. The main product to come ... References External links SRI International Artificial intelligence laboratories {{compu-AI-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
SRI International
SRI International (SRI) is an American nonprofit scientific research institute and organization headquartered in Menlo Park, California. The trustees of Stanford University established SRI in 1946 as a center of innovation to support economic development in the region. The organization was founded as the Stanford Research Institute. SRI formally separated from Stanford University in 1970 and became known as SRI International in 1977. SRI performs client-sponsored research and development for government agencies, commercial businesses, and private foundations. It also licenses its technologies, forms strategic partnerships, sells products, and creates spin-off companies. SRI's headquarters are located near the Stanford University campus. SRI's annual revenue in 2014 was approximately $540 million, which tripled from 1998 under the leadership of Curtis Carlson. In 1998, the organization was on the verge of bankruptcy when Carlson took over as CEO. Over the next sixteen years wit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Maryland, College Park
The University of Maryland, College Park (University of Maryland, UMD, or simply Maryland) is a public land-grant research university in College Park, Maryland. Founded in 1856, UMD is the flagship institution of the University System of Maryland. It is also the largest university in both the state and the Washington metropolitan area, with more than 41,000 students representing all fifty states and 123 countries, and a global alumni network of over 388,000. Together, its 12 schools and colleges offer over 200 degree-granting programs, including 92 undergraduate majors, 107 master's programs, and 83 doctoral programs. UMD is a member of the Association of American Universities and competes in intercollegiate athletics as a member of the Big Ten Conference. The University of Maryland's proximity to the nation's capital has resulted in many research partnerships with the federal government; faculty receive research funding and institutional support from many agencies, such as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Preference-based Planning
In artificial intelligence, preference-based planning is a form of automated planning and scheduling which focuses on producing plans that additionally satisfy as many user-specified preferences as possible. In many problem domains, a task can be accomplished by various sequences of actions (also known as plans). These plans can vary in quality: there can be many ways to solve a problem but one generally prefers a way that is, e.g., cost-effective, quick and safe. Preference-based planners take these preferences into account when producing a plan for a given problem. Examples of preference-based planning software include ''PPLAN''PPLAN Bienvenu et al. and ''HTNPlan-P''HTN P ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
NP-complete
In computational complexity theory, a problem is NP-complete when: # it is a problem for which the correctness of each solution can be verified quickly (namely, in polynomial time) and a brute-force search algorithm can find a solution by trying all possible solutions. # the problem can be used to simulate every other problem for which we can verify quickly that a solution is correct. In this sense, NP-complete problems are the hardest of the problems to which solutions can be verified quickly. If we could find solutions of some NP-complete problem quickly, we could quickly find the solutions of every other problem to which a given solution can be easily verified. The name "NP-complete" is short for "nondeterministic polynomial-time complete". In this name, "nondeterministic" refers to nondeterministic Turing machines, a way of mathematically formalizing the idea of a brute-force search algorithm. Polynomial time refers to an amount of time that is considered "quick" for a de ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
PDDL
The Planning Domain Definition Language (PDDL) is an attempt to standardize Automated planning and scheduling, Artificial Intelligence (AI) planning languages. It was first developed by Drew McDermott and his colleagues in 1998 (inspired by Stanford Research Institute Problem Solver, STRIPS and Action description language, ADL among others) mainly to make the 1998/200International Planning Competition (IPC)possible, and then evolved with each competition. The standardization provided by PDDL has the benefit of making research more reusable and easily comparable, though at the cost of some expressive power, compared to domain-specific systems. De facto official versions of PDDL PDDL1.2 This was the official language of the 1st an2ndIPC in 1998 and 2000 respectively. It separated the model of the planning problem in two major parts: (1) domain description and (2) the related problem description. Such a division of the model allows for an intuitive separation of those elements, wh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hierarchical Control System
A hierarchical control system (HCS) is a form of control system in which a set of devices and governing software is arranged in a hierarchical tree. When the links in the tree are implemented by a computer network, then that hierarchical control system is also a form of networked control system. Overview A human-built system with complex behavior is often organized as a hierarchy. For example, a command hierarchy has among its notable features the organizational chart of superiors, subordinates, and lines of organizational communication. Hierarchical control systems are organized similarly to divide the decision making responsibility. Each element of the hierarchy is a linked node in the tree. Commands, tasks and goals to be achieved flow down the tree from superior nodes to subordinate nodes, whereas sensations and command results flow up the tree from subordinate to superior nodes. Nodes may also exchange messages with their siblings. The two distinguishing features of a hier ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
