Conry, S.E., Meyer, R.A., Lesser, V.R.. Multistage Negotiation in Distributed Planning. In (see[7]).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....can alter dynamically over time. Closer to our approach are frameworks that explicitly address the need for agents to reach an agreement or consensus. Typically, consensus is reached through a process of goal revelation and information exchange, loosely categorized under the label negotiation [70, 14, 87, 52, 8]. As an example, the PERSUADER system [86, 87] uses negotiation to find a compromise that is acceptable to the agents in conflict. Their goals might not be totally satisfied by the final agreement. The negotiation process can be seen as a search in a dynamic space consisting of the agents ....

S. E. Conry, R. A. Meyer, and V. R. Lesser. Multistage negotiation in distributed planning. In Alan H. Bond and Les Gasser, editors, Readings in Distributed Artificial Intelligence, pages 367--384. Morgan Kaufmann, San Mateo, California, 1988.

....utilities. In her work, agents try to influence the goals and intentions of their opponents. We do not model the agents intentions in our model. We assume that the agents goals are fixed before the negotiation starts. Thus, Research that applies negotiation to DPS environments includes [CML88, DL89, MLB92, KG94] 39 the agents in our model do not argue about the goals, but rather exchange offers. This is possible because we assume that there is complete information and each agent can compute the utility of both agents from a given agreement. In [KL95] Kraus and Lehmann developed an ....

....in the environments with two attributes and deadlines. Even though the strategies are more complex than in the strategies identified in [KWZ95] the negotiation ends after the first time period. Other work in the DAI community dealing with the resource allocation problem includes, for example, CML88, KL89] which present a multistage negotiation protocol that is useful for cooperatively resolving resource allocation conflicts arising in distributed networks of semi autonomous problem solving nodes. A key element in their solution is the ability to detect subgoal interactions in a distributed ....

S. E. Conry, R. A. Meyer, and V. R. Lesser. Multistage negotiation in distributed planning. In A. H. Bond and L. Gasser, editors, Readings in Distributed Artificial Intelligence, pages 367--384. Morgan Kaufmann Publishers, Inc., San Mateo, California, 1988.

....in Fig. 2. The architecture of anthropic agency is shown in Fig. 3. Each step is carried on by a group of agents and the interactions between these groups are mediated by shared memory areas called blackboards, which are a well known established paradigm within distributed artificial intelligence [12,26,27] that is still investigated and improved (see, for example, 29] The communication structure among the agents is designed to ensure decoupling and independence of agents, as a requirement for the flexibility of the whole system. To accomplish this goal, all the communications are mediated by the ....

Conry SE, Meyer RA, Lesser VR. Multistage negotiation in distributed planning. In: Bond AH, Gasser L, editors. Readings in distributed artificial intelligence. San Matteo, CA, USA: Morgan Kaufmann; 1988. p. 367--84.

....difficult to be efficiently solved in a traditional way, including traditional knowledge based approach developed during last two decades. Now it seems, that multiagent system (MAS) technology is one of the most promising ways to manage this challenge due to a distributed way of tasks solving [5, 10, 15], where agents make their local decisions on plan fragments and negotiate the global decision. A distributed way of decision making means that each agent must make his local decision having a deficit of information about environment and other agents, resulting in conflicts between the decisions. ....

....task of planning and scheduling of learning activities that makes it possible to detect and to resolve subgoal interactions and conflicts. It can be considered as an extension of CNP, because multiple contracting mechanism is applied. The most close task statement is one considered in [5], which was applied to traffic planning and control of a complex communications system. In the framework of their model, a cooperation strategy in which agents iteratively exchange tentative and high level partial results of their local subtasks, was generated. This strategy results in solutions, ....

Conry, S. E., Meyer, R. A., & Lesser, V. R. Multistage Negotiation in Distributed Planning, In Bond, A. H. and Gasser, L., (eds.) Readings in Distributed Artificial Intelligence. Morgan Kaufmann Publishers: San Mateo, CA, 1988, pp. 367-384.

.... that has made the offer (this agent is called contractor) The negotiation model is proposed in many formulations in literature: the original model (called Contract Net) is developed by Smith and Davis (see [38] 39] 40] 41] 37] other use of negotiation can be found in Conry et al. see [5]) Cammarata et al. 4] c) Centralized Multiagent Planning The model (see [4] has been developed in order to solve conflicts among agents. This approach is based on the identification of a privileged agent elected by all the agents of the system using negotiation. The elected agent forms a ....

S. E. Conry, R. A. Meyer, V. R. Lesser, "Multistage negotiation in distributed planning", in A. H. Bond, L. Gasser, Readings in Distributed Artificial Intelligence, San Mateo, CA, Morgan Kaufmann, 1988, p. 367-384

.... has made the best offer (this agent is called contractor) The negotiation paradigm has been proposed in many formulations in literature: the original model (called Contract Net) was developed by Smith and Davis (see [115, 116, 117, 118, 119] other use of negotiation can be found in [24] and [34]. Under the general definition of multiagent planning there are several interaction paradigms in which global plans that specify the actions of the agents are built. In this way, there is no conflict among agents. The global plan can be formed in a centralized [24] or in a distributed way [36, ....

S. E. Conry, R. A. Meyer, and V. R. Lesser. Multistage negotiation in distributed planning. In A. H. Bond and L. Gasser, editors, Readings in Distributed Artificial Intelligence, pages 367--384. Morgan Kaufmann, San Mateo, USA, 1988.

....environments. In this paper, we define a dis tributed constraint satisfaction problem (DCSP) as a CSP in which multiple agents are involved. DCSPs are important for the following reasons: Various CDPS problems can be formalized as DCSPs. Multi agent resource allocation problems de scribed in [4], 8] in which tasks or resources must be allocated to agents so that inter agent constraints are satisfied, can be formalized as DCSPs by viewing each task or resource as a variable and the possible assignments as values. Also, an interpretation problem by multiple agents such as [11] can be ....

Conry, S.E., Meyer, R.E. and Lesser, V.R.: Multi- stage Negotiation in Distributed Planning, In Alan H.Bond and Les Gasser, editors, Readings in Distributed Artificial Intelligence, Morgan Kaufmann, pp. 367 384,1988.

....of Computer Science University of York York YO1 5DD, UK ea minster.york.ac. uk February 8, 1998 Abstract Negotiation has been a subject of central interest in DAI, proposed specially as a means for autonomous, self interested agents to communicate and compromise in Multiagent Systems (Conry et al. 1988; Kraus, 1996; Kraus et al. 1995; Rosenschein and Zlotkin, 1994; Smith, 1980) However, the main focus of DAI research from a logical perspective has been that of planning for multiple agents , which considers issues inherent in centrally directed multi agent execution (Georgeff, 1983; ....

Conry, S., Meyer, R., and Lesser, V. (1988). Multistage negotiation in distributed planning. In Bond, A. and Gasser, L., editors, Readings in Distributed Artificial Intelligence, pages 367--384, San Mateo, CA. Morgan Kaufmann.

....a schedule that divides the usage of the resource among the agents. 1 Examples of joint resources are: communication lines, printers, disks, bridges, road junctions, fresh water, clean air, etc. Other work in the DAI community dealing with the resource allocation problem includes, for example, [5, 30] which present a multistage negotiation protocol that is useful for cooperatively resolving resource allocation conflicts arising in distributed networks of semi autonomous problem solving nodes. 32] addresses tradeoff in resource allocation and real time performance, and develops a mechanism for ....

S. E. Conry, R. A. Meyer, and V. R. Lesser. Multistage negotiation in distributed planning. In A. H. Bond and L. Gasser, editors, Readings in Distributed Artificial Intelligence, pages 367--384. Morgan Kaufmann Publishers, Inc., San Mateo, California, 1988.

....may possibly form different views of the situation. They therefore suggest different frameworks for negotiation and communications for information exchange and conflict resolution. Since the agents are cooperative they are assumed to be honest. For example, Conry at el. and Kuwabara and Lesser [11, 37, 12] presented a multistage negotiation protocol that is useful for cooperatively resolving resource allocation conflicts arising in distributed networks of semi autonomous problem solving nodes. Since they consider the case of scheduling of many resources for multiple tasks they allow agents to ....

S. E. Conry, R. A. Meyer, and V. R. Lesser. Multistage negotiation in distributed planning. In A. H. Bond and L. Gasser, editors, Readings in Distributed Artificial Intelligence, pages 367--384. Morgan Kaufmann Publishers, Inc., San Mateo, California, 1988. 50

....only. We are currently working on enhancing our model to process constraints between the tasks. 2 Scheduling through Contracting The agents use this representation as they engage in a distributed scheduling process based on the multistage negotiation protocol. The multistage negotiation protocol [6] is an extension to the contract net protocol that allows for multiple rounds of negotiation before an agreement is reached between the negotiating agents. The protocol involves the following steps. On receipt of a meeting to schedule, the meeting s host searches its calendar for possible time ....

Susan E. Conry, Robert A. Meyer, and Victor R. Lesser. Multistage negotiation in distributed planning. In Alan H. Bond and Les Gasser, editors, Readings in Distributed Artificial Intelligence, pages 367--384. Morgan Kaufman, 1988.

....constraint satisfaction problems (DCSP) Many negotiation protocols base on the classical contract net protocol [14] that allows distributed problem solvers to contract other problem solvers for the solution of subproblems via a xed interchange of request, bids and award. Multistage negotiation [2] extends this protocol by allowing several rounds of negotiation for agents that try to coordinate their resource demands for plan execution. These protocols have in uenced the design of the collaboration protocol presented here. Researchers in DCSP have also developed several protocols for ....

S. E. Conry, R. A. Meyer, and V. R. Lesser. Multistage negotiation in distributed planning. In A. H. Bond and L. Gasser, editors, Readings in Distributed Articial Intelligence, pages 367-384. Morgan Kaufmann Publishers, 1988.

....is the inherently static nature of the interaction relation. In multi agent interaction it is usually not the case that this relation is given a priori or keeps being static all over the time. Interaction relations are rather de ned dynamically by using matchmaking [1] and contracting protocols [6]. In this paper, we therefore propose an extended Object System concept based on task resource system net object nets agent interaction net Figure 1: Model Layers High Level Petri nets with a dynamic interaction relation and describe its application to the formal modeling of distributed ....

....protocol illustrating a requester that sends a request for commitment to a provider that in turn answers only positively with a commitment. This protocol shall only illustrate our operational model and can be replaced by any of the more realistic protocols for agent interaction, such as in [6, 9]. Agents posses the skill to participate in such a protocol by receiving messages, deciding upon a proper reaction and sending messages. Agents control the task resource system not directly but by placing certain commitments on the pre places of process transitions in their controlled task net ....

S. E. Conry, R. A. Meyer, and V. R. Lesser. Multistage negotiation in distributed planning. In A. H. Bond and L. Gasser, editors, Readings in Distributed Articial Intelligence, pages 367-384. Morgan Kaufmann Publishers, 1988.

....ou refuser une solution. 20 S. Labidi, W. Lejouad Le processus de n egociation ne consiste pas forc ement a trouver un compromis mais peut s etendre a la modification des croyances d autres agents pour faire pr evaloir un point de vue. Pour mener a bien le processus de n egociation [23] [21], il est n ecessaire de suivre un protocole qui facilite la convergence vers une solution. Voici un exemple de structure de n egociation entre deux agents A et B : 1. A fait une proposition ; 2. B evalue cette proposition et d etermine la satisfaction qui en r esulte ; 3. Si B est satisfait ....

S. E. Conry, R. A. Meyer, and V. R. Lesser. Multi--Stage Negotiation in Distributed Planning, pages 367--384. Morgan Kaufmann, California, 1988.

....our 3 research, we also checked the effect of problem variance on the impact of negotiation, and we present our results in Section 6.2. In the case of MA, negotiation is a tool for solving conflicts among the self interested agents (e.g. 34, 66, 49] It differs from negotiation in DPS (e.g. [8, 7, 16, 38, 33]) which aims to solve conflicts arising from different knowledge and abilities. In suggesting negotiation as a method to solve conflicts in MA, we have to refer to the negotiation protocol that is, what the possible actions of each agent in the negotiation are, and how they will affect the ....

S. E. Conry, R. A. Meyer, and V. R. Lesser. Multistage negotiation in distributed planning. In A. H. Bond and L. Gasser, editors, Readings in Distributed Artificial Intelligence, pages 367--384. Morgan Kaufmann Publishers, Inc., San Mateo, California, 1988.

....the subtask, and so on. In contract net protocol, the key issue is to solve conflicts from the start of problem solving. Contract net protocol is suitable to use in cooperative domains and to solve resource conflicts and belief conflicts. 3. 3 Multistage Negotiation The multistage negotiation [2] may be viewed as the generalization of contract net protocol. In a contract net, task distribution takes place through a negotiation process involving contractor task announcement followed by bids from competing subcontractors and final announcement of awards. Multistage negotiation generalizes ....

S. Conry, R. Meyer & V. Lesser, Multistage Negotiation in Distributed Planning, COINS Technical Report 86-87. University of Massachusetts, 1986.

....on meetings associated with the different agents. Although meeting scheduling is a complex problem, some solutions have been proposed in the literature (cf. 16 ] One of the solutions proposed, is to implement distributed meeting scheduling by using a multi stage negotiation protocol ( 4 ] Below we show how to implement such a multistage negotiation protocol in 3APL by using the communicative actions. We design a set of plans for two agent meeting scheduling. The two agent case is substantially simpler than the case where more than two agents are allowed. Due to space ....

Susan E. Conry, Robert A. Meyer, and Victor R. Lesser. Multistage Negotiation in Distributed Planning. In Alan H. Bond and Les Gasser, editors, Readings in Distributed Artificial Intelligence, pages 367--384. Morgan Kaufman, 1988.

....contribution of this paper. We illustrate the use of and the differences between the two communication primitives in a multi agent meeting scheduling example. Agents used for meeting scheduling need to negotiate about meeting schedules. An implementation of the multi stage negotiation protocol ([4]) in 3APL is presented and is used by these agents to negotiate. The implementation of the protocol in 3APL is both natural and concise, which illustrates the expressive power of the agent programming language. Furthermore, we show how to implement semaphores, a facility to guarantee mutual ....

....language with the four communication primitives mentioned above. The operational semantics of these primitives is specified in a transition style semantics ( 14] We present an extended example concerning agents negotiating about meeting times by using the multi stage negotiation protocol (cf. [4], 17] Finally, we discuss our approach and other approaches to agent communication languages based on speech act theory. 2 The Agent Language 3APL In this section, we give an overview of the agent programming language 3APL for single agents as proposed in [9] 2.1 Intelligent Agents The ....

[Article contains additional citation context not shown here]

Susan E. Conry, Robert A. Meyer, and Victor R. Lesser. Multistage Negotiation in Distributed Planning. In Alan H. Bond and Les Gasser, editors, Readings in Distributed Artificial Intelligence, pages 367--384. Morgan Kaufman, 1988.

....on meetings associated with the di erent agents. Although meeting scheduling is a complex problem, some solutions have been proposed in the literature (cf. 17 ] One of the solutions proposed, is to implement distributed meeting scheduling by using a multi stage negotiation protocol ( 5 ] Below we show how to implement such a multistage negotiation protocol in 3APL by using the communicative actions. We design a set of plans for two agent meeting scheduling. The two agent case is substantially simpler than the case where more than two agents are allowed. Due to space ....

Susan E. Conry, Robert A. Meyer, and Victor R. Lesser. Multistage Negotiation in Distributed Planning. In Alan H. Bond and Les Gasser, editors, Readings in Distributed Articial Intelligence, pages 367-384. Morgan Kaufman, 1988.

No context found.

Conry, S.E., Meyer, R.A., Lesser, V.R.. Multistage Negotiation in Distributed Planning. In (see[7]).

No context found.

Susan E. Conry, Robert A. Meyer, and Victor R. Lesser. Multistage negotiation in distributed planning. In Alan Bond and Les Gasser, editors, Readings in Distributed Artificial Intelligence, pages 367--384. Morgan Kaufmann Publishers, Inc., San Mateo, 1988.

No context found.

S. Conry, R, Meyer, and V. R, Lesser. Multistage Negotiation in Distributed Planning. In A.H. Bond and L. Gasser, Ed., Readings in Distributed Artocial Intelligence, Morgan Kaufman, 1988.

No context found.

Conry, S., Meyer, R., and Lesser, V., Multi-stage negotiation in distributed planning, Eds. A.H. Bond, L. Gasser, Readings in distributed artificial intelligence, Morgan Kaufmann, San Meteo, California (1988) 367-384.

No context found.

Conry, S.E., Meyer, R.A. and Lesser, V.R., Multistage Negotiation in Distributed Planning. COINTS Technical Report 86-67, Amherst, MA. December 1986.

No context found.

Conry, S. E., Meyer, R. A., and Lesser, V. R. Multistage Negotiation in Distributed Planning. In Readings in Distributed Artificial Intelligence, Bond, A. H. and Gasser, L., (eds.). Morgan Kaufmann Publishers Inc., San Mateo, CA, (1988) 367-384.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC