Industry
Toward RoboCup without Color Labeling
Hanek, Robert, Schmitt, Thorsten, Buck, Sebastian, Beetz, Michael
Hence, no training phase is needed. The local statistics define an with white lines; goals are blue and yellow; and expectation of "how the two sides of the curve robots are black with light blue or magenta might look." Second, refine the estimation of model parameters These stringent rules allow for simple mechanisms by (1) updating the mean of the estimation for object detection and recognition: in a maximum a posteriori step such that Segment the captured image into blobs of the the vicinity of the curve matches the expectation same color and interpret these blobs. To the defined by the local statistics and (2) updating best of our knowledge, all autonomous robot the covariance of the estimation based on soccer teams with vision-based perception apply the Hessian of the resulting objective function. However, because The two steps are repeated until there is no the RoboCup committee is planning to significant change in the estimated Gaussian make the rules more realistic, these objectrecognition distribution.
RoboCupJunior: Learning with Educational Robotics
Sklar, Elizabeth, Eguchi, Amy, Johnson, Jeffrey
The RoboCupJunior division of RoboCup is now entering its third year of international participation and is growing rapidly in size and popularity. This article first outlines the history of the junior league since it was first demonstrated in Paris at RoboCup-1998 and describes how it has evolved into the international sensation it is today. Although the popularity of the event is self-evident, we are working to identify and quantify the educational benefits of the initiative. The remainder of the article focuses on describing our efforts to encapsulate these qualities, highlighting results from a pilot study conducted at RoboCupJunior-2000 and presenting new data from a subsequent study of RoboCupJunior-2001.
Exploiting Contextual Independence In Probabilistic Inference
Bayesian belief networks have grown to prominence because they provide compact representations for many problems for which probabilistic inference is appropriate, and there are algorithms to exploit this compactness. The next step is to allow compact representations of the conditional probabilities of a variable given its parents. In this paper we present such a representation that exploits contextual independence in terms of parent contexts; which variables act as parents may depend on the value of other variables. The internal representation is in terms of contextual factors (confactors) that is simply a pair of a context and a table. The algorithm, contextual variable elimination, is based on the standard variable elimination algorithm that eliminates the non-query variables in turn, but when eliminating a variable, the tables that need to be multiplied can depend on the context. This algorithm reduces to standard variable elimination when there is no contextual independence structure to exploit. We show how this can be much more efficient than variable elimination when there is structure to exploit. We explain why this new method can exploit more structure than previous methods for structured belief network inference and an analogous algorithm that uses trees.
Acquiring Correct Knowledge for Natural Language Generation
Reiter, E., Sripada, S. G., Robertson, R.
Natural language generation (NLG) systems are computer software systems that produce texts in English and other human languages, often from non-linguistic input data. NLG systems, like most AI systems, need substantial amounts of knowledge. However, our experience in two NLG projects suggests that it is difficult to acquire correct knowledge for NLG systems; indeed, every knowledge acquisition (KA) technique we tried had significant problems. In general terms, these problems were due to the complexity, novelty, and poorly understood nature of the tasks our systems attempted, and were worsened by the fact that people write so differently. This meant in particular that corpus-based KA approaches suffered because it was impossible to assemble a sizable corpus of high-quality consistent manually written texts in our domains; and structured expert-oriented KA techniques suffered because experts disagreed and because we could not get enough information about special and unusual cases to build robust systems. We believe that such problems are likely to affect many other NLG systems as well. In the long term, we hope that new KA techniques may emerge to help NLG system builders. In the shorter term, we believe that understanding how individual KA techniques can fail, and using a mixture of different KA techniques with different strengths and weaknesses, can help developers acquire NLG knowledge that is mostly correct.
The 2002 Trading Agent Competition: An Overview of Agent Strategies
This article summarizes 16 agent strategies that were designed for the 2002 Trading Agent Competition. Agent architects use numerous general-purpose AI techniques, including machine learning, planning, partially observable Markov decision processes, Monte Carlo simulations, and multiagent systems. Ultimately, the most successful agents were primarily heuristic based and domain specific.
The Robot Host Competition at the AAAI-2002 Mobile Robot Competition
Gustafson, David A., Michaud, Francois
Robots in the Robot Host competition, part of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002) Mobile Robot Competition faced two challenges: (1) a serving task that was similar to the Hors d'Oeuvres, Anyone? Both tasks required moving carefully among people, politely offering them information or hors d'oeuvres, recognizing when the people are making a request, and answering the request.
The AAAI-2002 Robot Challenge
Kuipers, Benjamin J., Stroupe, Ashley
The Eighteenth National Conference on Artificial Intelligence (AAAI-2002) Robot Challenge is part of an annual series of robot challenges and competitions. It is intended to promote the development of robot systems that interact intelligently with humans in natural environments. The Challenge task calls for a robot to attend the AAAI conference, which includes registering for the conference and giving a talk about itself. In this article, we review the task requirements, introduce the robots that participated at AAAI-2002 and describe the strengths and weaknesses of their performance.
The AAAI-2002 Robot Exhibition
The AAAI-2002 Robot Exhibition offered robotics researchers a venue for live demonstrations of their current projects. Researchers ranging from undergraduates working on their own to large multilab groups demonstrated robots that performed tasks ranging from improvisational comedy to urban search and rescue. This article describes their entries.
AAAI-2002 Fall Symposium Series
Ohsawa, Yukio, McBurney, Peter, Parsons, Simon, Miller, Christopher A., Schultz, Alan, Scholtz, Jean, Goodrich, Michael, Eugene Santos, Jr., Bell, Benjamin, Charles L. Isbell, Jr., Littman, Michael L.
The AAAI-2002 Fall Symposium Series was held Friday through Sunday, 15 to 17 November 2002 at the Sea Crest Conference Center in North Falmouth, Massachusetts. The five symposia in the 2002 Fall Symposia Series were (1) Chance Discovery: The Discovery and Management of Chance Events; (2) Etiquette for Human-Computer Work; (3) Human-Robot Interaction; (4) Intent Inference for Users, Teams, and Adversaries; and (5) Personalized Agents. The highlights of each symposium were presented at a special plenary session. Association for the Advancement of Artificial Intelligence (AAAI) technical reports of most of the symposia will be made available to AAAI members.