This article presents an experiment of expertise capitalization in road traffic-accident analysis. We study the integration of models of expertise from different members of an organization into a coherent corporate expertise model. We present our elicitation protocol and the generic models and tools we exploited for knowledge modeling in this context of multiple experts. We compare the knowledge models obtained for seven experts in accidentology and their representation through conceptual graphs. Finally, we discuss the results of our experiment from a knowledge capitalization viewpoint.

It is a northern European city of 100,000, almost on the border between the Republic of Ireland and Northern Ireland. The local press (The Derry Journal north Derry coast, with beautiful meetings enjoyed themselves and & Belfast Telegraph) and radio (BBC beaches at Benone and Castlenock expressed their congratulations on Northern Ireland) ran a number of and then through Coleraine to the the program and organization. Also, articles leading up to and during the seaside resorts of Portstewart and for the first time, AICS attracted a conference. All plenary invited speaker Portrush. A few kilometers further large number of delegates and papers talks and the panel session went out along the north Antrim coast, we from abroad, including many from on streaming video and audio, stored arrive at the Giants' Causeway and the United Kingdom, Europe, and Sauce!); Gweedore, home of the Clannad and live with the possibility of phonein for Pattern Recognition (IAPR), the They did lie in the areas of evidential reasoning, AICS-97, the Annual Conference of a supreme job.

A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed by temporally relating actions and world states. The temporal languages are members of the family of Description Logics, which are characterized by high expressivity combined with good computational properties. The subsumption problem for a class of temporal Description Logics is investigated and sound and complete decision procedures are given. The basic language TL-F is considered first: it is the composition of a temporal logic TL -- able to express interval temporal networks -- together with the non-temporal logic F -- a Feature Description Logic. It is proven that subsumption in this language is an NP-complete problem. Then it is shown how to reason with the more expressive languages TLU-FU and TL-ALCF. The former adds disjunction both at the temporal and non-temporal sides of the language, the latter extends the non-temporal side with set-valued features (i.e., roles) and a propositionally complete language.

We present a new approach to path planning, called the ``Ariadne's clew algorithm''. It is designed to find paths in high-dimensional continuous spaces and applies to robots with many degrees of freedom in static, as well as dynamic environments --- ones where obstacles may move. The Ariadne's clew algorithm comprises two sub-algorithms, called SEARCH and EXPLORE, applied in an interleaved manner. EXPLORE builds a representation of the accessible space while SEARCH looks for the target. Both are posed as optimization problems. We describe a real implementation of the algorithm to plan paths for a six degrees of freedom arm in a dynamic environment where another six degrees of freedom arm is used as a moving obstacle. Experimental results show that a path is found in about one second without any pre-processing.

This paper presents a general and efficient framework for probabilistic inference and learning from arbitrary uncertain information. It exploits the calculation properties of finite mixture models, conjugate families and factorization. Both the joint probability density of the variables and the likelihood function of the (objective or subjective) observation are approximated by a special mixture model, in such a way that any desired conditional distribution can be directly obtained without numerical integration. We have developed an extended version of the expectation maximization (EM) algorithm to estimate the parameters of mixture models from uncertain training examples (indirect observations). As a consequence, any piece of exact or uncertain information about both input and output values is consistently handled in the inference and learning stages. This ability, extremely useful in certain situations, is not found in most alternative methods. The proposed framework is formally justified from standard probabilistic principles and illustrative examples are provided in the fields of nonparametric pattern classification, nonlinear regression and pattern completion. Finally, experiments on a real application and comparative results over standard databases provide empirical evidence of the utility of the method in a wide range of applications.

Modeling various aspects of language-syntax, semantics, pragmatics, and discourse, among others -- by the use of constrained formal-computational systems, just adequate for such modeling, has proved to be an effective research strategy, leading to deep understanding of these aspects, with implications for both machine processing and human processing. This approach enables one to distinguish between the universal and stipulative constraints. This is in contrast to an approach where we start with the most powerful formal-computational system and then model the phenomena by making all constraints stipulative in a sense. The use of constrained systems for modeling leads to some novel ways of describing locality of structures and brings out the relationship between the complexity of description of primitives and local computations over them. These ideas serve to unify theoretical, computational, and statistical aspects of natural language processing in AI. It is expected that this approach will also be productive in other domains of AI.

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.

The object-recognition module that was nonmanipulator category. In the last days before the finals, the students heavily modified or replaced. For example, during the types of object that were in the actual environment. Once pixels to modify their subsystems). It is fair to say the competition served to and a flag ground-plane assumption.

In real life, such functions range of objects along with the perceptual might be useful for in-home care of the capabilities required to support it. The rules specified a fixed course and a fixed set This event was extremely difficult because it of objects that would populate it. The course forced teams to implement both manipulation consisted of typical household furniture and (the grasping and moving of objects) and visual Lexan partitions arranged to produce a simplified object recognition. The objects were typical required teams to implement them for a wide household objects, such as a television remote, range of objects. It therefore eliminated a a pill bottle, and fruits and vegetables.

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.