Results 1 - 10 of 16,070

Collaborative plans for complex group action

by Barbara J. Grosz , Sarit Kraus , 1996
"... The original formulation of SharedPlans by B. Grosz and C. Sidner ( 1990) was developed to provide a model of collaborative planning in which it was not necessary for one agent to have intentions-to toward an act of a different agent. Unlike other contemporaneous approaches (J.R. Searle, 1990), this ..."
Abstract - Cited by 543 (30 self) - Add to MetaCart
), this formulation provided for two agents to coordinate their activities without introducing any notion of irreducible joint intentions. However, it only treated activities that directly decomposed into single-agent actions, did not address the need for agents to commit to their joint activity, and did

Action recognition in the premotor cortex

by Vittorio Gallese, Luciano Fadiga, Leonardo Fogassi, Giacomo Rizzolatti - Brain , 1996
"... We recorded electrical activity from 532 neurons in the rostral part of inferior area 6 (area F5) of two macaque monkeys. Previous data had shown that neurons of this area discharge during goal-directed hand and mouth movements. We describe here the properties of a newly discovered set of F5 neurons ..."
Abstract - Cited by 671 (47 self) - Add to MetaCart
neurons ('mirror neurons', n = 92) all of which became active both when the monkey performed a given action and when it observed a similar action performed by the experimenter. Mirror neurons, in order to be visually triggered, required an interaction between the agent of the action

Integrated architectures for learning, planning, and reacting based on approximating dynamic programming

by Richard S. Sutton - Proceedings of the SevenLh International Conference on Machine Learning , 1990
"... gutton~gte.com Dyna is an AI architecture that integrates learning, planning, and reactive execution. Learning methods are used in Dyna both for compiling planning results and for updating a model of the effects of the agent's actions on the world. Planning is incremental and can use the probab ..."
Abstract - Cited by 563 (22 self) - Add to MetaCart
gutton~gte.com Dyna is an AI architecture that integrates learning, planning, and reactive execution. Learning methods are used in Dyna both for compiling planning results and for updating a model of the effects of the agent's actions on the world. Planning is incremental and can use

GOLOG: A Logic Programming Language for Dynamic Domains

by Hector J. Levesque, Raymond Reiter, Yves Lespérance, Fangzhen Lin, Richard B. Scherl , 1994
"... This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world. This allo ..."
Abstract - Cited by 628 (74 self) - Add to MetaCart
for applications in high level control of robots and industrial processes, intelligent software agents, discrete event simulation, etc. It is based on a formal theory of action specified in an extended version of the situation calculus. A prototype implementation in Prolog has been developed.

Goal-directed Requirements Acquisition

by Anne Dardenne , Axel van Lamsweerde, Stephen Fickas - SCIENCE OF COMPUTER PROGRAMMING , 1993
"... Requirements analysis includes a preliminary acquisition step where a global model for the specification of the system and its environment is elaborated. This model, called requirements model, involves concepts that are currently not supported by existing formal specification languages, such as goal ..."
Abstract - Cited by 585 (17 self) - Add to MetaCart
where each node captures an abstraction such as, e.g., goal, action, agent, entity, or event, and where the edges capture semantic links between such abstractions. Well-formedness properties on nodes and links constrain their instances - that is, elements of requirements models. Requirements acquisition

Concurrent Constraint Programming

by Vijay A. Saraswat, Martin Rinard , 1993
"... This paper presents a new and very rich class of (con-current) programming languages, based on the notion of comput.ing with parhal information, and the con-commitant notions of consistency and entailment. ’ In this framework, computation emerges from the inter-action of concurrently executing agent ..."
Abstract - Cited by 502 (16 self) - Add to MetaCart
This paper presents a new and very rich class of (con-current) programming languages, based on the notion of comput.ing with parhal information, and the con-commitant notions of consistency and entailment. ’ In this framework, computation emerges from the inter-action of concurrently executing

A calculus of mobile processes, I

by Robin Milner, et al. , 1992
"... We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract - Cited by 1184 (31 self) - Add to MetaCart
We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage

Agents, Actions and Goals in Dynamic Environments

by Peter Novák, Wojciech Jamroga - PROCEEDINGS OF THE TWENTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
"... In agent-oriented programming and planning, agents ’ actions are typically specified in terms of postconditions, and the model of execution assumes that the environment carries the actions out exactly as specified. That is, it is assumed that the state of the environment after an action has been exe ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
In agent-oriented programming and planning, agents ’ actions are typically specified in terms of postconditions, and the model of execution assumes that the environment carries the actions out exactly as specified. That is, it is assumed that the state of the environment after an action has been

Other Agents ’ Actions as Asynchronous Events

by Kurt D. Krebsbach
"... An individual planning agent does not generally have sufficient computational resources at its disposal to pro-duce an optimal plan in a complex domain, as delibera-tion itself requires and consumes scarce resources. This problem is further exacerbated in a distributed plan-ning context in which mul ..."
Abstract - Add to MetaCart
). In particular, we use GSMDPs to model agents who develop a continuous-time deliberation policy offline which can then be consulted to dynamically select both deliberation-level and domain-level actions at plan ex-ecution time. This scheme allows individual agents to model other cooperative agents ’ actions

Framework for recognizing multi-agent action from visual evidence,”

by Stephen S Intille , Aaron F Bobick - in Proceedings of the 16th National Conference on Artificial Intelligence (AAAI ’99), , 1999
"... Abstract A probabilistic framework for representing and visually recognizing complex multi-agent action is presented. Motivated by work in model-based object recognition and designed for the recognition of action from visual evidence, the representation has three components: (1) temporal structure ..."
Abstract - Cited by 114 (1 self) - Add to MetaCart
Abstract A probabilistic framework for representing and visually recognizing complex multi-agent action is presented. Motivated by work in model-based object recognition and designed for the recognition of action from visual evidence, the representation has three components: (1) temporal structure
Results 1 - 10 of 16,070