Simultaneous Localization and Mapping Using Rao-Blackwellized Particle Filters in Multi Robot Systems

In this paper we investigate the problem of Simultaneous Localization and Mapping (SLAM) for a multi robot system. Relaxing some assumptions that characterize related work we propose an application of Rao-Blackwellized Particle Filters (RBPF) for the purpose of cooperatively estimating SLAM posterior. We consider a realistic setup in which the robots start from unknown initial poses (relative locations are unknown too), and travel in the environment in order to build a shared representation of the latter. The robots are required to exchange a small amount of information only when a rendezvous event occurs and to measure relative poses during the meeting. As a consequence the approach also applies when using an unreliable wireless channel or short range communication technologies (bluetooth, RFId, etc.). Moreover it allows to take into account the uncertainty in relative pose measurements. The proposed technique, which constitutes a distributed solution to the multi robot SLAM problem, is further validated through simulations and experimental tests.     

Knowledge representation and inference techniques to improve the management of gas and oil facilities

This paper describes an experimental work carried out in the framework of an important European project to create and make use of a wide-ranging knowledge base in the gas/oil domain. In the context of this work, “knowledge base” means a collection of formal statement relating, with a negligible loss of information, the inner content (the ‘meaning’) of “complex events” included in two different “storyboards”. These events – originally presented under the form of unstructured natural language information – concern some general activities proper to the management of gas/oil facilities, like recognizing and monitoring gas leakage alarms in a gas processing plant or triggering the different steps needed to activate a gas turbine. To express this sort of information and to set up the knowledge base, the NKRL (Narrative Knowledge Representation Language) formalism has been used. NKRL is a conceptual meta-model and Computer Science environment expressly created to deal, in an ‘intelligent’ and complete way, with complex and content-rich ‘narrative’ data sources. The final knowledge base has been firstly tested in depth using the standard NKRL querying and information retrieval tools. High-level inference procedures have then been used, both “transformation rules” – unsuccessful queries are ‘transformed’ to produce results that are ‘semantically similar’ to those searched for initially – and “hypothesis rules” – information in the knowledge base is automatically aggregated to supply a sort of ‘causal’ explanation of some retrieved events.     

Optimal dynamic advertising with an adverse exogenous effect on brand goodwill

We propose the model of a firm that advertises a product in a homogeneous market, where a constant exogenous interference is present. Using the framework of Nerlove and Arrow’s advertising model, we assume that the interference acts additively on goodwill production as a negative term. Hence, we allow that the goodwill may become negative and we associate a zero demand with negative goodwill values. We consider a piecewise linear demand function and formulate a nonsmooth optimal-control problem with an infinite horizon. We obtain that an optimal advertising policy exists and takes one of two forms: either a positive and constant advertising effort, or a decreasing effort starting from a positive level and eventually reaching the zero value at a finite exit time. In the former scenario, the demand is always positive and the firm stays in the market in the long run; in the latter, the demand becomes zero in the short run, and afterward, the firm goes out of business. In both cases we have an explicit representation of the optimal control, which is obtained through the study of an auxiliary smooth optimal-control problem. It is interesting that the fundamental choice between staying in the market and going out of business at some time depends both on the interference level and on the initial goodwill level.     

Low-complexity FFT/IFFT IP hardware macrocells for OFDM and MIMO–OFDM CMOS transceivers

The paper presents an automated environment for fast design space exploration and automatic generation of FFT/IFFT macrocells with minimum circuit and memory complexity within the numerical accuracy budget of the target application. The effectiveness of the tool is demonstrated through FPGA and CMOS implementations (90 nm, 65 nm and 45 nm technologies) of the baseband processing in embedded OFDM transceivers. Compared with state-of-art FFT/IFFT IP cores, the proposed work provides macrocells with lower circuit complexity while keeping the same system performance (throughput, transform size and accuracy) and is the first addressing the requirements of all OFDM standards including MIMO systems: 802.11 WLAN, 802.16 WMAN, Digital Audio and Video Broadcasting in terrestrial, handheld and hybrid satellite-scenarios, Ultra Wide Band, Broadband on Power Lines, xDSL.     

Reputation management algorithms for DHT-based peer-to-peer environment

This paper addresses the problem of integration of reputation management mechanisms into data look-up and routing processes to cope with some specific security problems in peer-to-peer (P2P) networks based on Distributed Hash Tables (DHT). The goal is to find a mode for “good” peers to cooperate in order to withstand malicious activity of single malevolent peers and their collusions as well.We start from consideration of individual instruments for reputation evaluation that every single peer should be provided with to autonomously define the level of its own trust towards others. We also propose a possible scenario of integration of some existing reputation management techniques and routing mechanisms in a P2P network based on the popular Kademlia algorithm. Then, we present an interaction algorithm that allows peers to obtain the global trust value for each single node through exchanging opinions in the form of local trust values independently calculated by every peer with other members of the community. Such collaboration between peers is indispensable to cope with malicious activity of inconsistent nature specific to DHT-based environment. To render the algorithm resilient to the presence of malicious participants we propose to apply solutions for Byzantine Agreement to exchange opinions among peers. We also provide mathematical evaluations concerning the complexity and computational costs of the proposed algorithm that evidence apparent improvements over the previous one.     

Functional Redesign of Mantis 2.0, a Hybrid Leg-Wheel Robot for Surveillance and Inspection

The paper discusses the redesign of the second version of the Mantis hybrid leg-wheel mobile robot, conceived for surveillance and inspection tasks in unstructured indoor and outdoor environments. This small-scale ground mobile robot is characterized by a main body equipped with two front actuated wheels, a passive rear axle and two rotating legs. Motion on flat and even ground is purely wheeled in order to obtain high speed, high energetic efficiency and stable camera vision; only in case of obstacles or ground irregularities the front legs realize a mixed leg-wheel locomotion to increase the robot climbing ability; in particular, the outer profile of the legs, inspired by the praying mantis, is specially designed to climb square steps. The multibody simulations and the experimental tests on the first prototype have shown the effectiveness of the mixed leg-wheel locomotion not only for step climbing, but also on uneven and yielding terrains. Nevertheless, extensive experimental tests have shown that the front wheels may slip in the last phase of step climbing in case of contact with some materials. In order to overcome this problem, the leg design has been modified with the introduction of auxiliary passive wheels, which reduce friction between legs and step upper surface; these wheels are connected to the legs by one-way bearings, in order to rotate only when they are pulled by the front wheels, and remaining locked when they have to push forward the robot. The influence of the auxiliary wheels on the front wheels slippage is investigated by means of theoretical analysis and multibody simulations.     

Microfluidic device with dual-channel fluorescence acquisition for quantification/identification of cancer cells

This paper presents an optofluidic device for cell discrimination with two independent interrogation regions. Pumping light is coupled to the device, and cell fluorescence is extracted from the two interrogation zones by using optical fibers embedded in the optofluidic chip. To test the reliability of this device, AU-565 cells—expressing EpCAM and HER2 receptors—and RAMOS cells were mixed in a controlled manner, confined inside a hydrodynamic focused flow in the microfluidic chip and detected individually so that they could be discriminated as positive (signal reception from fluorescently labeled antibodies from the AU-565 cells) or negative events (RAMOS cells). A correlation analysis of the two signals reduces the influence of noise on the overall data.     

On the axiomatizability of priority II

This paper contributes to the study of the equational theory of the priority operator of Baeten, Bergstra and Klop in the setting of the process algebra BCCSP. It is shown that, in the presence of at least two actions, the collection of process equations over BCCSP with the priority operator that are valid modulo bisimilarity, irrespective of the chosen priority order over actions, is not finitely based. This holds true even if one restricts oneself to the collection of valid process equations that do not contain occurrences of process variables.     

Special factors,periodicity, and an application to Sturmian words

Let w be a finite word and n the least non-negative integer such that w has no right special factor of length and its right factor of length n is unrepeated. We prove that if all the factors of another word v up to the length n + 1 are also factors of w, thenv itself is a factor ofw. A similar result for ultimately periodic infinite words is established. As a consequence, some ‘uniqueness conditions’ for ultimately periodic words are obtained as well as an upper bound for the rational exponents of the factors of uniformly recurrent non-periodic infinite words. A general formula is derived for the ‘critical exponent’ of a power-free Sturmian word. In particular, we effectively compute the ‘critical exponent’ of any Sturmian sequence whose slope has a periodic development in a continued fraction. Received: 6 May 1999 / 21 February 2000