We would have two robots searching for the rooms and professors and one remaining Lab, we have a long history of behind in the director's office and tell him/ Our current research focuses on realtime well before the competition. They run the Thirteenth National Conference on Artificial SRI's The agent robot has seven sonar sensors, a fast-track technology, called the open-agent architecture vision system from Newton Labs, and a (OAA), was developed at SRI as a way of portable computer on top with a radio ethernet accessing many different types of information for communication to a base station available in computers at different locations. (figure 1). The fast-track system is an interesting device: It consists of a small color video camera and a low-power processor. PC on top to communicate with the other robots and talk to the director.

Although RoboCup's primary objective is a Although RoboCup's final target is a world For the Although it is obvious that building a robot robot (physical robot and software agent) to to play a soccer game is an immense challenge, play a soccer game reasonably well, a wide readers might wonder why we propose range of technologies need to be integrated, RoboCup. It is our intention to use RoboCup and numbers of technical breakthroughs as a vehicle to revitalize AI research by offering must be accomplished. When the accomplishment intelligent robotics, and sensor fusion. of such a goal has significant social The first RoboCup, RoboCup-97, will be held impact, it is considered a grand-challenge during the Fifteenth International Joint Conference project (Kitano et al. 1993). Building a robot on Artificial Intelligence (IJCAI-97) in to play a soccer game itself does not generate Nagoya, Japan, as part of IJCAI-97's special significant social and economic impact, but Accessibility Complete Incomplete and architectures can be evaluated. Computer Sensor Readings Symbolic Nonsymbolic chess is a typical example of the standard Control Central Distributed problem. Various search algorithms were evaluated and developed using this domain. With the recent accomplishment by the Deep Blue team, which beat Kasparov, a human grand Table 1. A major reason for the success of computer chess as a standard problem is that the evaluation of the accomplishment will certainly be considered the progress was clearly defined.

This article describes JEEVES, one of the winning entries in the 1996 Annual AAAI Mobile Robot Competition and Exhibition, held as part of the Thirteenth National Conference on Artificial Intelligence. JEEVES tied for first place in the finals of the competition after it won both preliminary trials. A key aspect in JEEVES's software design was the ability to acquire a model of the environment. The model, a geometric map constructed from sensory data gathered while the robot performed its task, enabled JEEVES to sweep the arena efficiently. It facilitated the retrieval of balls and their delivery at the gate, and it helped to avoid unintended collisions with obstacles. This article argues that JEEVES's success depended crucially on the existence of the model. It also argues that models are generally useful in mobile robotics -- even in tasks as simple as the one faced in this competition.

The YODA Robot Project at the University of Southern California/Information Sciences Institute consists of a group of young researchers who share a passion for autonomous systems that can bootstrap its knowledge from real environments by exploration, experimentation, learning, and discovery. Our goal is to create a mobile agent that can autonomously learn from its environment based on its own actions, percepts, and mis-sions. Our participation in the Fifth Annual AAAI Mobile Robot Competition and Exhibition, held as part of the Thirteenth National Conference on Artificial Intelligence, served as the first milestone in advancing us toward this goal. YODA's software architecture is a hierarchy of abstraction layers, ranging from a set of behaviors at the bottom layer to a dynamic, mission-oriented planner at the top. The planner uses a map of the environment to determine a sequence of goals to be accomplished by the robot and delegates the detailed executions to the set of behaviors at the lower layer. This abstraction architecture has proven robust in dynamic and noisy environments, as shown by YODA's performance at the robot competition.

This article discusses the use of fast (60 frames per second) object tracking using the COGNACHROME VISION SYSTEM, produced by Newton Research Labs. The authors embedded the vision system in a small robot base to tie for first place in the Clean Up the Tennis Court event at the 1996 Annual AAAI Mobile Robot Competition and Exhibition, held as part of the Thirteenth National Conference on Artificial Intelligence. Of particular interest is that the authors' entry was the only robot capable of using a gripper to capture and pick up the motorized, randomly moving squiggle ball. Other examples of robotic systems using fast vision tracking are also presented, such as a robot arm capable of catching thrown objects and the soccer-playing robot team that won the 1996 Micro Robot World Cup Soccer Tournament in Taejon, Korea.

This article was reprinted with permission from "ACM Computing Surveys: 28(4): December 1996, 653-670. original is available from ACM.

The team's robot software was nicknamed Their project was to develop software on the Nomad 200 robot for tasks such as maze following, office delivery, and office navigation. In both the second for the competition's Office Navigation and the final rounds, the software achieved event. The perfectly complete the task. It is equipped with 2 sonar route from the director's office to the conference rings of 16 sonars each and with 2 charge-coupled rooms, directed the robot to each of the device (CCD) cameras. The robot has a two conference rooms, correctly determined 486 processor on board with a hard drive and which conference room was not occupied, 16 megabytes of memory. The behaviors at the bottom level needed to worry about low-level responsibilities, such as avoiding obstacles and not hitting walls but did not need to know about the overall strategy for solving the task.

This article is the content of an invited talk given by the authors at the Thirteenth National Conference on Artificial Intelligence (AAAI-96). The piece begins with a short history of the competition, then discusses the technical challenges and the political and cultural issues associated with bringing it off every year. We also cover the science and engineering involved with the robot tasks and the educational and commercial aspects of the competition. We finish with a discussion of the community formed by the organizers, participants, and the conference attendees. The original talk made liberal use of video clips and slide photographs; so, we have expanded the text and added photographs to make up for the lack of such media.

The Fifth Annual AAAI Mobile Robot Competition and Exhibition was held in Portland, Oregon, in conjunction with the Thirteenth National Conference on Artificial Intelligence. The competition consisted of two events: (1) Office Navigation and (2) Clean Up the Tennis Court. The first event stressed navigation and planning. The second event stressed vision sensing and manipulation. In addition to the competition, there was a mobile robot exhibition in which teams demonstrated robot behaviors that did not fit into the competition tasks. The competition and exhibition were unqualified successes, with nearly 20 teams competing. The robot competition raised the standard for autonomous mobile robotics, demonstrating the intelligent integration of perception, deliberation, and action.

Instance-based learning techniques typically handle continuous and linear input values well, but often do not handle nominal input attributes appropriately. The Value Difference Metric (VDM) was designed to find reasonable distance values between nominal attribute values, but it largely ignores continuous attributes, requiring discretization to map continuous values into nominal values. This paper proposes three new heterogeneous distance functions, called the Heterogeneous Value Difference Metric (HVDM), the Interpolated Value Difference Metric (IVDM), and the Windowed Value Difference Metric (WVDM). These new distance functions are designed to handle applications with nominal attributes, continuous attributes, or both. In experiments on 48 applications the new distance metrics achieve higher classification accuracy on average than three previous distance functions on those datasets that have both nominal and continuous attributes.