K. Sycara, S. Roth, N. Sadeh, and M. S. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man, and Cybernetics, 21:1446--1461, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in order to cooperate effectively [NHLS94] Although effective cooperation is possible when the agents transmit abstractions (or texture measures ) of their current state, this does add a significant overhead to the agent s processing requirements. Similar heuristics have been presented in [SRSF91, BCF93, BP94] in particular [YIK90] inter alia, compared backtracking and consistency algorithms as methodologies for Distributed Constraint Satisfaction Problems. In [MJPL90, JM94] the concept of generating suboptimal solutions which are then repaired using heuristics is further expanded, ....

K. Sycara, S. Roth, N. Sadeh, and M. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1446--1461, 1991.

....authors propose different algorithms to solve DCSPs variable based, domain based and functionbased. They all assume a binary DCSP and are hence based on simple constraint representations via no good sets. An important contribution to DCSP solving has been given by Sycara, Roth, Sadeh and Fox in [39] in which they present Distributed Constrained Heuristic Search. They characterize the design trade off for a proper level of distribution in a system for a given communication bandwidth, but do not address this problem in the paper. Sycara et al. characterize the effect of different ....

K. P. Sycara, S. F. Roth, N. Sadeh, and M. S. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man, and Cybernetics, 21(6):1446-1461, 1991.

....are distributed among multiple agents and the agents are required to satisfy all constraints by communicating with each other. Many problems in multi agent systems, such as distributed interpretation problems[9] distributed resource allocation problems[3] distributed scheduling problems[11], and multi agent truth maintenance systems[7] can be formalized as Distributed CSPs. On the other hand, when a problem designer tries to describe a real life problem as a CSP, the resulting CSP is often over constrained and has no solutions. For such an over constrained CSP, almost all ....

K. P. Sycara, S. Roth, N. Sadeh and M. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man and Cybernetics,Vol. 21, No. 6, pp. 1446--1461, 1991.

....simultaneously. This problem can be formalized as a distributed CSP by representing each task as a variable, and possible plans as variable values. Many other application problems that are concerned with finding a consistent combination of agent actions decisions (e.g. distributed scheduling [5] and distributed interpretation problems [6] can be formalized as distributed CSPs. Since a variety of DAI application problems can be formalized as distributed CSPs, we can consider distributed algorithms for solving distributed CSPs as an important infrastructure in DAI. It must be noted that ....

K. P. Sycara, S. Roth, N. Sadeh, and M. Fox, "Distributed constrained heuristic search", IEEE Transactions on Systems, Man and Cybernetics,vol. 21, no. 6, pp. 1446--1461, 1991.

....which variables and constraints are distributed among multiple automated agents. Various application problems in Multi agent Systems (MAS) that are concerned with finding a consistent combination of agent actions (e.g. distributed resource allocation problems [4] distributed scheduling problems [21], 2 Figure1.Example of a Constraint Satisfaction Problem (4 queens) distributed interpretation tasks [16] and multi agent truth maintenance tasks [13] can be formalized as distributed CSPs. Therefore, we can consider distributed algorithms for solving distributed CSPs as an important ....

....work, a real life problem with 10 departments, 20 nurses in each department, and 100 weekly assignments was solved using distributed CSP techniques. Many other application problems that are concerned with finding a consistent combination of agent actions decisions (e.g. distributed scheduling [14, 21] and distributed interpretation problems [16] can be formalized as distributed CSPs. 5. Algorithms for Solving Distributed CSPs In this section, we make the following assumptions for simplicity in describing the algorithms. 1. Each agent has exactly one variable. 2. All constraints are ....

Sycara, K. P., S. Roth, N. Sadeh, and M. S. Fox: 1991, `Distributed Constrained Heuristic Search'. IEEE Transactions on Systems, Man and Cybernetics 21(6), 1446--1461.

....which variables and constraints are distributed among multiple automated agents. Various application problems in Multiagent Systems (MAS) that are concerned with finding a consistent combination of agent actions (e.g. distributed resource allocation problems [5] distributed scheduling problems [11], distributed interpretation tasks [9] and multiagent truth maintenance tasks [7] can be formalized as distributed CSPs. Therefore, we can consider distributed algorithms for solving distributed CSPs as an important infrastructure in MAS. It must be noted that although algorithms for solving ....

K. P. Sycara, S. Roth, N. Sadeh, and M. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1446--1461, 1991.

....sometimes face a problem where multiple agents have to find a consistent combination of actions under some constraints about taking their actions. Such a problem includes the distributed interpretation problem [6] the distributed resource allocation problem [2] the distributed scheduling problem [9] and the problem in multi agent truth maintenance tasks [5] These problems are naturally described as a distributed constraint satisfaction problem (distributed CSP) 12, 13] A distributed CSP is a constraint satisfaction problem where variables and constraints are distributed among multiple ....

K. P. Sycara, S. Roth, N. Sadeh, and M. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1446--1461, 1991.

....field of Distributed Artificial Intelligence (DAI) have been studying problems where a group of agents interact to solve a problem [15] in the absence of a central coordination mechanism. For instance, distributed, constrained, heuristic search has been applied to the domain of job shop scheduling [16]. An important contribution of this work is the characterization of the scheduling problem as a distributed multiagent search of the solution space. The contract net protocol has been used to define a bidding approach that enables task allocation among multiple agents [7, 8] To realize ....

Sycara K., S. Roth, N. Sadeh, and M. Fox. "Distributed Constrained Heuristic Search." IEEE Transactions on Systems, Man, and Cybernetics. IEEE Society, NovemberDecember 1991, pp. 1446-1461.

....Their works are a kind of cooperation in parallel activities. Need for cooperation is not emerged from the constraint of execution environments but from the property of problems; the communication structure for cooperation depends on the problem itself. Sycara et al. researched distributed search [24]. They have proposed a method of selecting a piece of information to send among agents. The structure of job assignment to agents is fixed during the execution. Durfee et al. proposed a cooperation method in a distributed vehicle monitoring system [4] In their model, the search space is divided ....

Katia P. Sycara, Steven F. Roth, Norman Sadeh, and Mark S. Fox. Distributed constrained heuristic search. IEEE Trans. Syst. Man Cybern.(Special Issue on Distributed AI), 21(6):1446--1461, 1991. 18

.... networks [3] 36] 2)# Distributed resource scheduling and planning, which emphasizes how (scheduling) agents (associated with each work cell) should coordinate their schedules to avoid and resolve conflicts over resources, and to maximize system output (e.g. factory scheduling [38] 41] [51]; network management [1] and intelligent environments [74] 75] 3)# Distributed expert systems, which emphasize how agents share information and negotiate over collective solutions (designs) given their different expertise and solution criteria (e.g. concurrent engineering [32] network ....

# K.P. Sycara, S. Roth, N. Sadeh, and M. Fox, "Distributed Constrained Heuristic Search," IEEE Trans. Systems, Man, and Cybernetics, vol. 21, no. 6, pp. 1,446--1,461, 1991.

....simultaneously. This problem can be formalized as a distributed CSP by representing each task as a variable, and possible plans as variable values. Many other application problems that are concerned with finding a consistent combination of agent actions decisions (e.g. distributed scheduling [5] and distributed interpretation problems [6] can be formalized as distributed CSPs. Since a variety of DAI application problems can be formalized as distributed CSPs, we can consider distributed algorithms for solving distributed CSPs as an important infrastructure in DAI. 1041 4347 98 10.00 ....

# K.P. Sycara, S. Roth, N. Sadeh, and M. Fox, "Distributed Constrained Heuristic Search," IEEE Trans. Systems, Man, and Cybernetics, vol. 21, no. 6, pp. 1,446--1,461, 1991.

....sometimes face a problem where multiple agents have to find a consistent combination of actions under some constraints about taking their actions. Such a problem includes the distributed interpretation problem [6] the distributed resource allocation problem [2] the distributed scheduling problem [9], and the problem in multi agent truth maintenance tasks [5] These problems are naturally described as distributed constraint satisfaction problems (distributed CSPs) 12, 13] A distributed CSP is a constraint satisfaction problem where variables and constraints are distributed among multiple ....

K. P. Sycara, S. Roth, N. Sadeh, and M. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1446--1461, 1991.

....of problems in artificial intelligence can be formalized as CSPs. Similarly, various application problems in Multiagent Systems (MAS) that are concerned with finding a consistent combination of agent actions (e.g. distributed resource allocation problems [7] distributed scheduling problems [20], distributed interpretation tasks [16] and multi agent truth maintenance tasks [14] can be formalized as distributed CSPs. Therefore, we have considered an efficient distributed algorithm for solving a distributed CSP as an important infrastructure in MAS. The author has proposed the ....

Sycara, K. P., Roth, S., Sadeh, N., and Fox, M.: Distributed Constrained Heuristic Search. IEEE Transactions on Systems, Man and Cybernetics, 21(6) (1991) 1446--1461

....In [10] the authors propose di erent algorithms to solve DCSPs variable based, domainbased and function based. They all assume a binary DCSP and are hence based on simple constraint representations via no good sets. An important contribution to DCSP solving has been given by Sycara et al. in [16] in which they present distributed constrained heuristic search. They have used a combination of distributed constraint propagation (in form of communicating resource demands, called textures) and distributed heuristic search (called asynchronous backjumping) The authors introduction of special ....

K. P. Sycara, S. F. Roth, N. Sadeh, and M. S. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man, and Cybernetics, 21(6):1446{ 1461, 1991.

....of capacity and temporal constraints is warranted by the local scheduling algorithms and the protocol itself. Hence, there is no need either of validating global schedules or tinkering them, if some constraints are violated. This property is rather unique in distributed scheduling (c.f. Sycara et al. 1991; Hoitomt et al. 1993; Duffie and Prabhu, 1994) 3.6. What are the bidding rules (1) No bid may cross the time and price limits of the announcement, however, within these limits each machine is free to offer as many bids (and with arbitrary parameters) as it wants. The bidding strategy of a ....

Sycara, K. Roth, S., Sadeh, N. and Fox, M.S. (1991) Distributed constrained heuristic search. IEEE Trans. on Systems, Man, and Cybernetics, 21(6), 1446-1461.

....the orders must be rejected in order to avoid congestion. In distributed scheduling, scheduling agents manipulate resource and or order variables under their own authority. Potential job interactions are usually handled so that agents tell each other their aggregate workloads and free capacities [5, 6, 7]. Since global consistency can hardly be guaranteed, constraint checking [5] or simulation [6] is needed. Since constraint relaxation and backtracking may require enormous computational overhead, their use are limited. In some cases, heuristic tinkering of almost conflict free schedules is ....

....scheduling agents manipulate resource and or order variables under their own authority. Potential job interactions are usually handled so that agents tell each other their aggregate workloads and free capacities [5, 6, 7] Since global consistency can hardly be guaranteed, constraint checking [5] or simulation [6] is needed. Since constraint relaxation and backtracking may require enormous computational overhead, their use are limited. In some cases, heuristic tinkering of almost conflict free schedules is preferred to backtracking [8] Recent investigations suggest that the efficiency ....

K. Sycara, S. Roth, N. Sadeh and M.S. Fox, `Distributed constrained heuristic search', IEEE Trans. on Systems, Man, and Cybernetics, 21(6), 1446-1461, (1991).

....authors propose di erent algorithms to solve DCSPs variable based, domain based and functionbased. They all assume a binary DCSP and are hence based on simple constraint representations via no good sets. An important contribution to DCSP solving has been given by Sycara, Roth, Sadeh and Fox in [39] in which they present Distributed Constrained Heuristic Search. They characterize the design trade o for a proper level of distribution in a system for a given communication bandwidth, but do not address this problem in the paper. Sycara et al. characterize the e ect of di erent decompositions ....

K. P. Sycara, S. F. Roth, N. Sadeh, and M. S. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man, and Cybernetics, 21(6):1446-1461, 1991.

....are distributed among multiple agents, each of which tries to solve its own CSP. Various application problems in multiagent systems that are concerned with finding a consistent combination of agent actions (e.g. distributed resource allocation problems[4] distributed scheduling problems[15], distributed interpretation tasks[11] and multi agent truth maintenance tasks[10] can be formalized as distributed CSPs. Distributed algorithms for solving distributed CSPs (distributed constraint satisfaction algorithms) have recently been developed by several authors [1, 7, 8, 16, 17, 18] ....

K. P. Sycara, S. Roth, N. Sadeh, and M. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man and Cybernetics, Vol. 21, No. 6, pp. 1446--1461, 1991.

No context found.

K. Sycara, S. Roth, N. Sadeh, and M. Fox. Distributed constrained heuristic search. IEEE Transactions on System, Man and Cybernetics, 21#6#:1446#1461, 1991.

No context found.

K. Sycara, S. Roth, N. Sadeh, and M. S. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man, and Cybernetics, 21:1446--1461, 1991.

No context found.

K. Sycara, S. Roth, and M. Fox. Distributed constrained heuristic search. IEEE Transactions on systems, man, and cybernetics, 21(6):1446--1461, Nov/Dec 1991. To read.

No context found.

Katia Sycara, Steven F Roth, Norman Sadeh-Koniecpol, and Mark S. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man, and Cybernetics, 21:1446-- 1461, 1991.

No context found.

K. Sycara, S. Roth, N. Sadeh, and M. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man, and Cybernetics, 26(1):1446--1461, 1991.

No context found.

Sycara, K., Roth, S., Sadeh, N., Fox, M., "Distributed Constrained Heuristic Search", IEEE Transactions on System, Man, and Cybernetics, Vol.21, No.6, 1991, pp.1446-1461.

No context found.

: 1446-1461.

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