SPE
Ontologies for Corporate Web Applications
Obrst, Leo, Liu, Howard, Wray, Robert
In this article, we discuss some issues that arise when ontologies are used to support corporate application domains such as electronic commerce (ecommerce) and some technical problems in deploying ontologies for real-world use. In particular, we focus on issues of ontology integration and the related problem of semantic mapping, that is, the mapping of ontologies and taxonomies to reference ontologies to preserve semantics. Along the way, we discuss what typically constitutes an ontology architecture. By its very nature, B2B e-commerce must try to interlink buyers and sellers from multiple companies with disparate product-description terminologies and meanings, thus serving as a paradigmatic case for the use of ontologies to support corporate applications.
An Overview of RoboCup-2002 Fukuoka/Busan
Asada, Minoru, Obst, Oliver, Polani, Daniel, Browning, Brett, Bonarini, Andrea, Fujita, Masahiro, Christaller, Thomas, Takahashi, Tomoichi, Tadokoro, Satoshi, Sklar, Elizabeth, Kaminka, Gal A.
This article reports on the Sixth Robot World Cup Competition and Conference (RoboCup-2002) Fukuoka/Busan, which took place from 19 to 25 June in Fukuoka, Japan. It was the largest Robo- Cup since 1997 and held the first humanoid league competition in the world. Further, the first ROBOTREX (robot trade and exhibitions) was held with about 50 companies, universities, and institutes represented. To the best of our knowledge, this was the largest robotic event in history.
Toward RoboCup without Color Labeling
Hanek, Robert, Schmitt, Thorsten, Buck, Sebastian, Beetz, Michael
To overcome these limitations, we propose an algorithm, called the CONTRACTING CURVE DENSITY (CCD) algorithm, for fitting parametric curves to image data. The method neither assumes object-specific color distributions, or specific edge profiles, nor does it need threshold parameters. To separate adjacent regions, we use local criteria that are based on local image statistics. We apply the method to the problem of localizing the ball and show that the CCD algorithm reliably localizes the ball even in the presence of heavily changing illumination, strong clutter, specularity, partial occlusion, and texture.
Learning-Assisted Automated Planning: Looking Back, Taking Stock, Going Forward
Zimmerman, Terry, Kambhampati, Subbarao
This article reports on an extensive survey and analysis of research work related to machine learning as it applies to automated planning over the past 30 years. Major research contributions are broadly characterized by learning method and then descriptive subcategories. Survey results reveal learning techniques that have extensively been applied and a number that have received scant attention. We extend the survey analysis to suggest promising avenues for future research in learning based on both previous experience and current needs in the planning community.
The Twenty-Fifth Annual German Conference on Artificial Intelligence (KI-2002)
Koehler, Jana, Lakemeyer, Gerhard
The Twenty-Fifth Annual German Conference on Artificial Intelligence (KI- 2002) was held 16 to 20 September 2003 in Aachen (Aix-La-Chapelle), Germany. KI is the main German national conference in AI, but it addresses an international audience by adopting English as the conference language and having the proceedings published in the Springer Lecture Notes in AI series.
The 2002 Starting Artificial Intelligence Researchers Symposium
During the 2002 European Conference on Artificial Intelligence (ECAI-02) was introduced the Starting Artificial Intelligence Researchers Symposium STAIRS), the first-ever international symposium specifically aimed at Ph.D. students in AI. The outcome was a thorough, high-quality, and successful event, with all the features one usually finds in the best international conferences: large international committees, comprehensive coverage, published proceedings, renowned speakers and panelists, subsidized awards, and an exciting social program. Considering the numerous benefits gained by the young researchers through such a forum, no doubt STAIRS will become a regular and well-established biennial event.
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.