Abstract
In this article we address the problem of determining how a structured formation of autonomous undistinguishable agents can be reorganized into another, eventually non-rigid, formation based on changes in the environment, perhaps unforeseeable. The methodology can also be used to correctly position the agents into a particular formation from an initial set of random locations. Given the information on the agents current location and the final locations, there are n! possible permutations for the n agents. Among these, we seek one that minimizes a total relative measure, e.g. distance traveled by the agents during the switching. We propose a dynamic programming methodology to solve this problem to optimality. Possible applications can be found in surveillance, damage assessment, chemical or biological monitoring, among others, where the switching to another formation, not necessarily predefined, may be required due to changes in the environment.

Abstract
In this paper we describe a platform that enables Web site automation and monitoring. The platform automatically gathers high quality site activity data, both from the server and client sides. Web adapters, such as rec-ommender systems, can be easily plugged into the platform, and take advantage of the up-to-date activity data. The platform also includes a module to support the editor of the site to monitor and assess the effects of automation. We illustrate the features of the platform on a case study, where we show how it can be used to gather information not only to model the behavior of users but also the impact of the personalization mechanism. Copyright © 2008, Association for the Advancement of Artificial Intelligence.

Abstract
We propose a dynamic programming approach to address the problem of determining how a structured formation of autonomous undistinguishable agents can be reorganized into another, eventually non-rigid, formation based on changes in the environment, perhaps unforeseeable. The methodology can also be used to correctly position the agents into a particular formation from an initial set of random locations. Given the information of the current agents location and the final locations, there are n! possible permutations for the n agents, and we seek the one that minimizes a total relative measure, e.g. distance traveled by the agents during the switching. Possible applications can be found amongst surveillance, damage assessment, chemical or biological monitoring, among others. where the switching to another formation, not necessarily predefined, may be required due to changes in the environment.

Abstract

Abstract

Abstract
Programming industrial robotic workcells is a challenging task, namely because it means dealing with several types of machines, mange the data flow between them and orchestrate their basic functionality into a working program. In this work service oriented architectures are used for the task of programming robotic workcells along with managing the communication between cell components, and a statechart model engine is implemented to orchestrate the system logic. The objective of this paper is to focus in merging service oriented architectures with StateCharts XML, and in evaluating that robotic workcell programming approach using a simple laboratory test bed.