Second, These sections describe how Phoenix agents there are motivating issues, of plan in real time but do not provide the which the foremost is to understand minute detail that is offered elsewhere (Cohen how complex environments et al. forthcoming). The next section illustrates constrain on the design of Phoenix agents controlling a forest fire. We seek general The last section describes the current status of rules that justify and explain the project and our immediate goals. The terms in these rules describe The Phoenix task is to control simulated characteristics of environments, forest fires by deploying simulated bulldozers, tasks and behaviors, and the crews, airplanes, and other objects. We discuss architectures of agents. Phoenix Environment, Layers 1 and 2 but Phoenix is a commentary on the Phoenix Simulator. In the following pages, we describe Phoenix from the perspective of our technical aims and motives. The second section describes the Phoenix task--controlling simulated forest fires-- and explains why we use a simulated environment instead of a real, physical one. The two lowest layers of Phoenix, described in The Phoenix Environment, Layers 1 and 2, implement the simulated environment and maintain the illusion that the forest fire and agents are acting simultaneously. Above these layers are two others: a Figure 2. Fire at 12:30 Bulldozers are Close to organization of multiple Meeting at the Fire Front. The left pane displays the real world; the right pane displays fireboss sees it. Firefighting objects are also and other agents are semiautonomous.

To demonstrate these methods we have trained an ANS network to drive a vehicle through simulated rreeway traffic. I ntJooducticn Computational systems employing fine grained parallelism are revolutionizing the way we approach a number or long standing problems involving pattern recognition and cognitive processing. The field spans a wide variety or computational networks, rrom constructs emulating neural runctions, to more crystalline configurations that resemble systolic arrays. Several titles are used to describe this broad area or research, we use the term artificial neural systems (ANS). Our concern in this work is the use or ANS ror manually training certain types or autonomous systems where the desired rules of behavior are difficult to rormulate. Artificial neural systems consist of a number or processing elements interconnected in a weighted, user-specified fashion, the interconnection weights acting as memory ror the system. Each processing element calculatE', an output value based on the weighted sum or its inputs. In addition, the input data is correlated with the output or desired output (specified by an instructive agent) in a training rule that is used to adjust the interconnection weights.

To demonstrate these methods we have trained an ANS network to drive a vehicle through simulated rreeway traffic. I ntJooducticn Computational systems employing fine grained parallelism are revolutionizing the way we approach a number or long standing problems involving pattern recognition and cognitive processing. The field spans a wide variety or computational networks, rrom constructs emulating neural runctions, to more crystalline configurations that resemble systolic arrays. Several titles are used to describe this broad area or research, we use the term artificial neural systems (ANS). Our concern in this work is the use or ANS ror manually training certain types or autonomous systems where the desired rules of behavior are difficult to rormulate. Artificial neural systems consist of a number or processing elements interconnected in a weighted, user-specified fashion, the interconnection weights acting as memory ror the system. Each processing element calculatE', an output value based on the weighted sum or its inputs. In addition, the input data is correlated with the output or desired output (specified by an instructive agent) in a training rule that is used to adjust the interconnection weights.

To demonstrate these methods we have trained an ANS network to drive a vehicle through simulated rreeway traffic. I ntJooducticn Computational systems employing fine grained parallelism are revolutionizing the way we approach a number or long standing problems involving pattern recognition and cognitive processing. Thefield spans a wide variety or computational networks, rrom constructs emulating neural runctions, to more crystalline configurations that resemble systolic arrays. Several titles are used to describe this broad area or research, we use the term artificial neural systems (ANS). Our concern inthis work is the use or ANS ror manually training certain types or autonomous systems where the desired rules of behavior are difficult to rormulate. Artificial neural systems consist of a number or processing elements interconnected in a weighted, user-specified fashion, the interconnection weights acting as memory ror the system. Each processing element calculatE', an output value based on the weighted sum or its inputs. In addition, the input data is correlated with the output or desired output (specified by an instructive agent) in a training rule that is used to adjust the interconnection weights.

The Robotics Institute, Carnegie Mellon University Pittsburgh, PA 15213 Abstract In non-cooperative multi-agent planning, resolution of multiple conflicting goals is the result of finding compromise solutions. Previous research has dealt with such multi-agent problems where planning goals are well-specified, subgoals can be enumerated, and the utilities associated with subgoals known. Our research extends the domain of problems to include non-cooperative multi-agent interactions where planning goals are ill-specified, subgoals cannot be enumerated, and the associated utilities are not precisely known. Negotiation is performed through proposal and modification of goal relaxations. Case-Based Reasoning is integrated with the use of multi-attribute utilities to portray tradeoffs and propose novel goal relaxations and compromises. Persuasive arguments are generated and used as a mechanism to dynamically change the agents' utilities so that convergence to an acceptable compromise can be achieved.

This report contains a historical perspective on previous Distributed Artificial Intelligence Workshops, highlights of the roundtable discussions, and a collection of research abstracts submitted by the participants.

The 1987 Workshop on Distributed Artificial Intelligence (DAI) was held at Sea Ranch, California, 3 to 6 December 1987. Twenty-eight participants gathered in this rugged, windswept northern California coastal village to debate the theory and practice of DAI.

He then proved that In addition, I noticed that John McCarthy was snapping network representations (such as that of the brain) cannot freely with his camera at the workshop. He may have some possibly exhibit intelligence-tapes, as in Turing Machines, amusing illustrations of the unlikely events rec0rded.l

In Reasoning about Actions and Plans: Proc. 1986 Workshop, pp. 47–82.

The fifth Distributed Artificial Intelligence Workshop was held at the Schlumberger-Doll Research Laboratory from October 14 to 17, 1984. It was attended by 20 participants from academic and industrial institutions. As in the past, this workshop was designed as an informal meeting. It included brief research reports from individual groups along with general discussion of questions of common interest. This report summarizes the general discussion and contains summaries of group presentations that have been contributed by individual speakers.