Vincenzo Caglioti, Augusto Citterio, Andrea Fossati
{"title":"Cooperative, distributed localization in multi-robot systems: a minimum-entropy approach","authors":"Vincenzo Caglioti, Augusto Citterio, Andrea Fossati","doi":"10.1109/DIS.2006.20","DOIUrl":"https://doi.org/10.1109/DIS.2006.20","url":null,"abstract":"In this paper, we consider the problem of localization in a multi-robot system. We present a new approach focused on distribution, scalability, and minimum-uncertainty perception. An extended Kalman filter (EKF) is used to update an estimate of the robot poses in correspondence to each sensor measurement. An entropic criterion is used, in order to select optimal measurements that reduce the global uncertainty relative to the estimate of the robot poses. It is shown that, in addition to EKF, also the selection of the optimal measurement can be distributed among the robots, in a scalable fashion. The proposed approach has been validated by simulations and preliminary experimental results","PeriodicalId":318812,"journal":{"name":"IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications (DIS'06)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126692650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Brace of Agent Simulation Scenarios","authors":"M. Fletcher, P. Vrba","doi":"10.1109/DIS.2006.1","DOIUrl":"https://doi.org/10.1109/DIS.2006.1","url":null,"abstract":"The paper presents a pair of agent simulation scenarios from the defense and manufacturing domains using COTS agent simulation products from Agent Oriented Software and Rockwell Automation. These scenarios highlight the requirements for exploring how the agents should behave autonomously and interact socially to ensure the overall simulation plays out coherently","PeriodicalId":318812,"journal":{"name":"IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications (DIS'06)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122467830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. Barea, E. López, L. Bergasa, S. Alvarez, M. Ocaña
{"title":"Detection Model in Collaborative Multi-Robot Monte Carlo Localization.","authors":"R. Barea, E. López, L. Bergasa, S. Alvarez, M. Ocaña","doi":"10.1109/DIS.2006.24","DOIUrl":"https://doi.org/10.1109/DIS.2006.24","url":null,"abstract":"This paper presents an algorithm for collaborative mobile robot localization based on probabilistic methods (Monte Carlo localization) used in assistant robots. When a root detects another in the same environment, a probabilistic method is used to synchronize each robot's belief. As a result, the robots localize themselves faster and maintain higher accuracy. The technique has been implemented and tested using a virtual environment capable to simulate several robots and using two real mobile robots equipped with cameras and laser range-finders for detecting other robots. The result obtained in simulation and with real robots show improvements in localization speed and accuracy when compared to conventional single-robot localization","PeriodicalId":318812,"journal":{"name":"IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications (DIS'06)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134065028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multidimensional Context Representations for Situational Trust","authors":"M. Rehák, M. Gregor, M. Pechoucek","doi":"10.1109/DIS.2006.54","DOIUrl":"https://doi.org/10.1109/DIS.2006.54","url":null,"abstract":"We propose a generic model for situation representation in agent trust models. As we argue that general trust models are inappropriate in complex environments and their use for advanced decision-making is limited due to the lack of detail, we introduce a generic framework for context representation in trust model. Presented method is independent of the trustfulness representation formalism in the underlying trust model. It doesn't prescribe any particular form for the set of reference contexts that holds the trustworthiness information in the context space: we define and evaluate the baseline approach with regular grid and discuss future extension towards more adaptive approaches using octant trees and fuzzy clustering techniques","PeriodicalId":318812,"journal":{"name":"IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications (DIS'06)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123586212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Lemaignan, A. Siadat, J. Dantan, Anatoli Semenenko
{"title":"MASON: A Proposal For An Ontology Of Manufacturing Domain","authors":"S. Lemaignan, A. Siadat, J. Dantan, Anatoli Semenenko","doi":"10.1109/DIS.2006.48","DOIUrl":"https://doi.org/10.1109/DIS.2006.48","url":null,"abstract":"This paper presents a proposal for a manufacturing upper ontology, aimed to draft a common semantic net in manufacturing domain. Usefulness of ontologies for data formalization and sharing, especially in a manufacturing environment, are first discussed. Details are given about the Web ontology language (OWL) and its adequation for ontologies in the manufacturing systems is shown. A concrete proposal named MASON (MAnufacturing's Semantics ONtology) is presented and two applications of this ontology are exposed: automatic cost estimation and semantic-aware multiagent system for manufacturing","PeriodicalId":318812,"journal":{"name":"IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications (DIS'06)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129879607","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Conflict Resolution with Minimal Communication Bandwidth","authors":"A. Farinelli, L. Iocchi, D. Nardi","doi":"10.1109/DIS.2006.18","DOIUrl":"https://doi.org/10.1109/DIS.2006.18","url":null,"abstract":"Task assignment for multi-robot systems is a main issue to attain good performance in complex real world environments. In several application domains tasks to be executed are not inserted into the system by an external entity but are perceived by robots during mission execution. In this paper we explicitly focus on detecting and solving conflicts that may arise during the task assignment process. We propose a conflict resolution method based only on point to point messages. The approach is able to guarantee a conflict free allocation using a very limited communication bandwidth. We also present an extension to make the system robust to possible network failures","PeriodicalId":318812,"journal":{"name":"IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications (DIS'06)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126985914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Collective Multi-Objective Planning","authors":"A. Mouaddib, M. Juin","doi":"10.1109/DIS.2006.17","DOIUrl":"https://doi.org/10.1109/DIS.2006.17","url":null,"abstract":"Multi-objective multi-agent planning addresses the problem of resolving conflicts between individual agent interests and the group interests. In this paper, we address this problem using a vector-valued decentralized Markov decision process (2V-DEC-MDP). The formal framework of a vector-valued MDP considered uses the value function which returns a vector representing the individual and the group interests. Indeed, local decisions of each agent are guided by the local reward of the agent, the opportunity gain to the group and the opportunity cost of its nuisance. An optimal policy in such contexts is not clear but in this approach we develop a regret-based technique to find a good tradeoff between the group and individual interests. To do that, the approach we present uses Egalitarian social welfare orderings that allow an agent to consider during its local optimization the satisfaction of all criteria and reducing their differences. The obtained result is an equilibrium of individual and group satisfactions where the local policies can lead to more global satisfying behaviors in some settings. This result is illustrated in an example and compared to alternate local policies","PeriodicalId":318812,"journal":{"name":"IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications (DIS'06)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126842366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A New Evaluation Method of Communication for Distributed Control","authors":"Jason J. Scarlett, R. Brennan","doi":"10.1109/DIS.2006.4","DOIUrl":"https://doi.org/10.1109/DIS.2006.4","url":null,"abstract":"Distributed systems are relying more heavily on event-triggered system architectures such as UML and IEC 61499. Existing communication protocols can support the high-level communication within these systems, but there is contention as to which low-level protocol to use, or if any exist that meet the requirements of being event-triggered and hard realtime. This paper presents a new way to measure communication performance. The goal of the new measurement method is to stress the necessity that a system be both efficient and fair. This is illustrated by comparing three communication strategies; controller area network (CAN), time-triggered CAN (TTCAN), and alternating priority CAN. The first two represent the extremes between event-triggered and time-triggered communication strategies. The third is introduced to illustrate the benefits of the new measurement technique","PeriodicalId":318812,"journal":{"name":"IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications (DIS'06)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128364284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"TURBO: an autonomous execution environment with scalability and load balancing features","authors":"R. Alfano, G. Di Caprio","doi":"10.1109/DIS.2006.73","DOIUrl":"https://doi.org/10.1109/DIS.2006.73","url":null,"abstract":"Execution environments and application servers require load balancing features in order to scale properly whilst maintaining high performance and availability, especially when running mission-critical services. Usually it is difficult to apply load balancing to real systems due to their complexity and lack of tools that support their application; moreover their integration requires changes that could break design cohesion or introduce unmanageable complexity. To overcome some of those limitations, we propose a system called \"telco uniform request balancer\" (TURBO), a distributed execution environment that is natively designed to provide autonomic high scalability and dynamic load balancing. TURBO integrates load balancing behavior effortlessly by self-organization through a collaborative behavior. The system is based on a peer-to-peer variant of the Linda distributed model and a \"poll when idle\" (PID) approach for load distribution","PeriodicalId":318812,"journal":{"name":"IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications (DIS'06)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134143789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
C. Lo, Yu-Teng Chang, Chen-Feng Wu, Hung-Teng Chang
{"title":"The Evaluations of Quantitative Methods to Conflict Agents","authors":"C. Lo, Yu-Teng Chang, Chen-Feng Wu, Hung-Teng Chang","doi":"10.1109/DIS.2006.70","DOIUrl":"https://doi.org/10.1109/DIS.2006.70","url":null,"abstract":"Conflict is a natural and very typical phenomenon in every field of human world. It has very significant common characteristics and dynamics, and, therefore, it makes sense to examine them together and comparatively. People get involved in conflicts because their interests or their values are challenged or because their needs are not met (Resmerita and Heymann, 2003). Different kinds or classes of conflict require different conflict resolution strategies. According to their different natures people need different strategies to resolve different sorts of conflicts. Therefore, this paper describes how to represent each agent's view and expand the ideas of mathematic techniques to conflict agents and gives a brief evaluation of each technique in its theory","PeriodicalId":318812,"journal":{"name":"IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications (DIS'06)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134186611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}