Robot soccer competition provides an excellent opportunity for integrated robotics research. In particular, robot players in a soccer game must recognize and track objects in real time, navigate in a dynamic field, collaborate with teammates, and strike the ball in the correct direction. All these tasks demand robots that are autonomous (sensing, thinking, and acting as independent creatures), efficient (functioning under time and resource constraints), cooperative (collaborating with each other to accomplish tasks that are beyond an individual's capabilities), and intelligent (reasoning and planning actions and perhaps learning from experience). Furthermore, all these capabilities must be integrated into a single and complete system, which raises a set of challenges that are new to individual research disciplines. This article describes our experience (problems and solutions) in these aspects. Our robots share the same general architecture and basic hardware, but they have integrated abilities to play different roles (goalkeeper, defender, or forward) and use different strategies in their behavior. Our philosophy in building these robots is to use the least sophistication to make them as robust and integrated as possible. At RoboCup-97, held as part of the Fifteenth International Joint Conference on Artificial Intelligence, these integrated robots performed well, and our DREAMTEAM won the world championship in the middle-size robot league.

Robotic soccer is a challenging research domain that involves multiple agents that need to collaborate in an adversarial environment to achieve specific objectives. In this article, we describe CMUNITED, the team of small robotic agents that we developed to enter the RoboCup-97 competition. We designed and built the robotic agents, devised the appropriate vision algorithm, and developed and implemented algorithms for strategic collaboration between the robots in an uncertain and dynamic environment. The robots can organize themselves in formations, hold specific roles, and pursue their goals. In game situations, they have demonstrated their collaborative behaviors on multiple occasions. We present an overview of the vision-processing algorithm that successfully tracks multiple moving objects and predicts trajectories. The article then focuses on the agent behaviors, ranging from low-level individual behaviors to coordinated, strategic team behaviors. CMUNITED won the RoboCup-97 small-robot competition at the Fifteenth International Joint Conference on Artificial Intelligence in Nagoya, Japan.

's performance in is driven by's development was driven by the Using Further aspects of multiagent agents could not always quickly locate and agent and team modeling. With respect to learning, as well as arenas of agent and intercept the ball or maintain awareness of teamwork, our previous work was based on team modeling (particularly to recognize positions of teammates and opponents. It then enables team members to make any decisions. Instead, all the decision Yaser Al-Onaizan, Ali Erdem, autonomously reason about coordination making rests with the higher level, Gal A. Kaminka, Stacy C. Marsella, and communication in teamwork, providing implemented in the Given its domain architecture, which takes into account the independence, it also enables reuse across recommendations made by the lower level. 's teamwork reasoning is currently test domain given its substantial also implemented in

In this article, we describe the milestone of our research efforts in our work for the RoboCup middle-size league competition. Reinforcement learning in applying it to real robot applications; we then give our method of coping with these has recently been receiving increased attention issues in the context of RoboCup. Finally, we as a method for robot learning with little or no show our system and the experimental results a priori knowledge and a higher capability for of RoboCup-97. The robot senses the current state First, we follow the explanation of Q-learning of the environment and selects an action. For a more thorough treatment, Based on the state and the action, the environment see Watkins and Dayan (1992).

RoboCup-97, The First Robot World Cup Soccer Games and Conferences, was held at the Fifteenth International Joint Conference on Artificial Intelligence. There were two leagues: (1) real robot and (2) simulation. Ten teams participated in the real-robot league and 29 teams in the simulation league. Over 150 researchers attended the technical workshop. The world champions are CMUNITED (Carnegie Mellon University) for the small-size league, DREAMTEAM (University of Southern California) and TRACKIES (Osaka University, Japan) for the middle-size league, and AT-HUMBOLDT (Humboldt University) for the simulation league. The Scientific Challenge Award was given to Sean Luke (University of Maryland) for his genetic programming- based simulation team LUKE, and the Engineering Challenge Awards were given to UTTORI UNITED (Utsunomiya University, Toyo University, and Riken, Japan) and RMIT (Royal Melbourne Institute of Technology, Australia) for designing novel omnidirectional driving mechanisms. Over 5000 spectators and 70 international media covered the competition worldwide. RoboCup-98, the Second Robot World Cup Soccer, was held in conjunction with the Third International Conference on Multiagent Systems in Paris, France, in July 1998.

A computer program that uses AI planning techniques is now the world champion computer program in the game of Contract Bridge. As reported in The New York Times and The Washington Post, this program -- a new version of Great Game Products' BRIDGE BARON program -- won the Baron Barclay World Bridge Computer Challenge, an international competition hosted in July 1997 by the American Contract Bridge League. It is well known that the game tree search techniques used in computer programs for games such as Chess and Checkers work differently from how humans think about such games. In contrast, our new version of the BRIDGE BARON emulates the way in which a human might plan declarer play in Bridge by using an adaptation of hierarchical task network planning. This article gives an overview of the planning techniques that we have incorporated into the BRIDGE BARON and discusses what the program's victory signifies for research on AI planning and game playing.

We applied mobile computing to community support and explored mobile computing with a large number of terminals. This article reports on the Second International Conference on Multiagent Systems (ICMAS'96) Mobile Assistant Project that was conducted at an actual international conference for multiagent systems using 100 personal digital assistants (PDAs) and cellular telephones. We supported three types of service: (1) communication services such as e-mail and net news; (2) information services such as conference, personal, and tourist information; and (3) community support services such as forum and meeting arrangements. After the conference, we analyzed a large amount of log data and obtained the following results: It appears that people continuously used PDAs in their hotel rooms after dinner; e-mail services were used independently of the conference structure, but the load on information services reflected the schedule of the conference. Postquestionnaire data showed that our trial was considered interesting, although people were not fully satisfied with the PDAs and services provided. Participants showed a deep interest in mobile computing for community support.

One of the most common mechanisms used for speeding up problem solvers is macro-learning. Macros are sequences of basic operators acquired during problem solving. Macros are used by the problem solver as if they were basic operators. The major problem that macro-learning presents is the vast number of macros that are available for acquisition. Macros increase the branching factor of the search space and can severely degrade problem-solving efficiency. To make macro learning useful, a program must be selective in acquiring and utilizing macros. This paper describes a general method for selective acquisition of macros. Solvable training problems are generated in increasing order of difficulty. The only macros acquired are those that take the problem solver out of a local minimum to a better state. The utility of the method is demonstrated in several domains, including the domain of NxN sliding-tile puzzles. After learning on small puzzles, the system is able to efficiently solve puzzles of any size.

To effectively generate a fast and consistent apartment construction project network, Hyundai Engineering and Construction and Korea Advanced Institute of Science and Technology developed a case- and constraint-based project-planning expert system for an apartment domain. The system, FAS-TRAK- APT, is inspired by the use of previous cases by a human expert project planner for planning a new project and the modification of these cases by the project planner using his/her knowledge of domain constraints. This large-scale, case-based, and mixed-initiative planning system, integrated with intensive constraint-based adaptation, utilizes semantic-level metaconstraints and human decisions for compensating incomplete cases imbedding specific planning knowledge. The case- and constraint-based architecture inherently supports cross-checking cases with constraints during system development and maintenance. This system has drastically reduced the time and effort required for initial project planning, improved the quality and completeness of the generated plans, and is expected to give the company the competitive advantage in contract bids for new contracts.

In this paper we consider the problem of `theory patching', in which we are given a domain theory, some of whose components are indicated to be possibly flawed, and a set of labeled training examples for the domain concept. The theory patching problem is to revise only the indicated components of the theory, such that the resulting theory correctly classifies all the training examples. Theory patching is thus a type of theory revision in which revisions are made to individual components of the theory. Our concern in this paper is to determine for which classes of logical domain theories the theory patching problem is tractable. We consider both propositional and first-order domain theories, and show that the theory patching problem is equivalent to that of determining what information contained in a theory is `stable' regardless of what revisions might be performed to the theory. We show that determining stability is tractable if the input theory satisfies two conditions: that revisions to each theory component have monotonic effects on the classification of examples, and that theory components act independently in the classification of examples in the theory. We also show how the concepts introduced can be used to determine the soundness and completeness of particular theory patching algorithms.