Multi-threaded Communicating Agents in Qu-Prolog

In this tutorial paper we summarise the key features of the multi-threaded Qu-Prolog language for implementing multi-threaded communicating agent applications. Internal threads of an agent communicate using the shared dynamic database used as a generalisation of Linda tuple store. Threads in different agents, perhaps on different hosts, communicate using either a thread-to-thread store and forward communication system, or by a publish and subscribe mechanism in which messages are routed to their destinations based on content test subscriptions. We illustrate the features using an auction house application. This is fully distributed with multiple auctioneers and bidders which participate in simultaneous auctions. The application makes essential use of the three forms of inter-thread communication of Qu-Prolog. The agent bidding behaviour is specified graphically as a finite state automaton and its implementation is essentially the execution of its state transition function. The paper assumes familiarity with Prolog and the basic concepts of multi-agent systems.

Achieving cooperation in a distributed multi-robot team

DMAPS (Distributed Multi-Agent Planning System) is a planning system developed for distributed multi-robot teams based on MAPS(Multi-Agent Planning System). MAPS assumes that each agent has the same global view of the environment in order to determine the most suitable actions. This assumption fails when perception is local to the agents: each agent has only a partial and unique view of the environment. DMAPS addresses this problem by creating a probabilistic global view on each agent by fusing the perceptual information from each robot. The experimental results on consuming tasks show that while the probabilistic global view is not identical on each robot, the shared view is still effective in increasing performance of the team.

The effect of the CaO/SiO2 ratio on the phase equilibria in the ZnO-“Fe2O3”-(PbO + CaO + SiO2) system in air: CaO/SiO2 = 0.1, PbO/(CaO + SiO2) = 6.2, and CaO/SiO2 = 0.6, PbO/(CaO + SiO2) = 4.3

Experimental studies on phase equilibria in the multi-component system PbO-ZnO-CaO-SiO2-FeO-Fe2O3 in air have been conducted to characterize the phase relations of a complex slag system used in the oxidation smelting of lead and in typical lead blast furnace sinters. The liquidus in two pseudoternary sections ZnO-Fe2O3-(PbO + CaO + SiO2) with the CaO/SiO2 weight ratio of 0.1 and the PbO/(CaO + SiO2) weight ratio of 6.2, and with CaO/SiO2 weight ratio of 0.6 and the PbO/(CaO + SiO2) weight ratio of 4.3, have been constructed.

Modeling and exploiting behavior patterns in dynamic environments

This paper presents a new approach to improving the effectiveness of autonomous systems that deal with dynamic environments. The basis of the approach is to find repeating patterns of behavior in the dynamic elements of the system, and then to use predictions of the repeating elements to better plan goal directed behavior. It is a layered approach involving classifying, modeling, predicting and exploiting. Classifying involves using observations to place the moving elements into previously defined classes. Modeling involves recording features of the behavior on a coarse grained grid. Exploitation is achieved by integrating predictions from the model into the behavior selection module to improve the utility of the robot's actions. This is in contrast to typical approaches that use the model to select between different strategies or plays. Three methods of adaptation to the dynamic features of the environment are explored. The effectiveness of each method is determined using statistical tests over a number of repeated experiments. The work is presented in the context of predicting opponent behavior in the highly dynamic and multi-agent robot soccer domain (RoboCup)

Multi-robot control in highly dynamic, competitive environments

The control and coordination of multiple mobile robots is a challenging task; particularly in environments with multiple, rapidly moving obstacles and agents. This paper describes a robust approach to multi-robot control, where robustness is gained from competency at every layer of robot control. The layers are: (i) a central coordination system (MAPS), (ii) an action system (AES), (iii) a navigation module, and (iv) a low level dynamic motion control system. The multi-robot coordination system assigns each robot a role and a sub-goal. Each robot’s action execution system then assumes the assigned role and attempts to achieve the specified sub-goal. The robot’s navigation system directs the robot to specific goal locations while ensuring that the robot avoids any obstacles. The motion system maps the heading and speed information from the navigation system to force-constrained motion. This multi-robot system has been extensively tested and applied in the robot soccer domain using both centralized and distributed coordination.

Classifying an opponent's behaviour in robot soccer

This paper illustrates the prediction of opponent behaviour in a competitive, highly dynamic, multi-agent and partially observableenvironment, namely RoboCup small size league robot soccer. The performance is illustrated in the context of the highly successful robot soccer team, the RoboRoos. The project is broken into three tasks; classification of behaviours, modelling and prediction of behaviours and integration of the predictions into the existing planning system. A probabilistic approach is taken to dealing with the uncertainty in the observations and with representing the uncertainty in the prediction of the behaviours. Results are shown for a classification system using a Naïve Bayesian Network that determines the opponent’s current behaviour. These results are compared to an expert designed fuzzy behaviour classification system. The paper illustrates how the modelling system will use the information from behaviour classification to produce probability distributions that model the manner with which the opponents perform their behaviours. These probability distributions are show to match well with the existing multi-agent planning system (MAPS) that forms the core of the RoboRoos system.

Cytochrome c(551) from Starkeya novella - Characterization, spectroscopic properties, and phylogeny of a diheme protein of the SoxAX family

Cytochromes from the SoxAX family have a major role in thiosulfate oxidation via the thiosulfate-oxidizing multi-enzyme system (TOMES). Previously characterized SoxAX proteins from Rhodovulum sulficlophilum and Paracoccus pantotrophus contain three heme c groups, two of which are located on the SoxA subunit. In contrast, the SoxAX protein purified from Starkeya novella was found to contain only two heme groups. Mass spectrometry showed that a disulfide bond replaced the second heme group found in the diheme SoxA subunits. Apparent molecular masses of 27,229 +/- 10.3 Da and 20,258.6 +/- 1 Da were determined for SoxA and SoxX with an overall mass of 49.7 kDa, indicating a heterodimeric structure. Optical redox potentiometry found that the two heme cofactors are reduced at similar potentials (versus NHE) that are as follows: + 133 mV (pH 6.0); + 104 mV (pH 7.0); +49 (pH 7.9) and +10 mV (pH 8.7). EPR spectroscopy revealed that both ferric heme groups are in the low spin state, and the spectra were consistent with one heme having a His/Cys axial ligation and the other having a His/Met axial ligation. The His/Cys ligated heme is present in different conformational states and gives rise to three distinct signals. Amino acid sequencing was used to unambiguously assign the protein to the encoding genes, soxAX, which are part of a complete sox gene cluster found in S. novella. Phylogenetic analysis of soxA- and soxX-related gene sequences indicates a parallel development of SoxA and SoxY, with the diheme and monoheme SoxA sequences located on clearly separated branches of a phylogenetic tree.

Teleonomic entropy: measuring the phase-space of end-directed systems

We introduce a novel way of measuring the entropy of a set of values undergoing changes. Such a measure becomes useful when analyzing the temporal development of an algorithm designed to numerically update a collection of values such as artificial neural network weights undergoing adjustments during learning. We measure the entropy as a function of the phase-space of the values, i.e. their magnitude and velocity of change, using a method based on the abstract measure of entropy introduced by the philosopher Rudolf Carnap. By constructing a time-dynamic two-dimensional Voronoi diagram using Voronoi cell generators with coordinates of value- and value-velocity (change of magnitude), the entropy becomes a function of the cell areas. We term this measure teleonomic entropy since it can be used to describe changes in any end-directed (teleonomic) system. The usefulness of the method is illustrated when comparing the different approaches of two search algorithms, a learning artificial neural network and a population of discovering agents. (C) 2004 Elsevier Inc. All rights reserved.

The effect of finite bandwidth squeezed light on entanglement creation in the Dicke model

We analyse the relation between local two-atom and total multi-atom entanglements in the Dicke system composed of a large number of atoms. We use concurrence as a measure of entanglement between two atoms in the multi-atom system, and the spin squeezing parameter as a measure of entanglement in the whole n-atom system. In addition, the influence of the squeezing phase and bandwidth on entanglement in the steady-state Dicke system is discussed. It is shown that the introduction of a squeezed field leads to a significant enhancement of entanglement between two atoms, and the entanglement increases with increasing degree of squeezing and bandwidth of the incident squeezed field. In the presence of a coherent field the entanglement exhibits a strong dependence on the relative phase between the squeezed and coherent fields, that can jump quite rapidly from unentangled to strongly entangled values when the phase changes from zero to pi. We find that the jump of the degree of entanglement is due to a flip of the spin squeezing from one quadrature component of the atomic spin to the other component when the phase changes from zero to pi. We also analyse the dependence of the entanglement on the number of atoms and find that, despite the reduction in the degree of entanglement between two atoms, a large entanglement is present in the whole n-atom system and the degree of entanglement increases as the number of atoms increases.

Intelligent decision support for family financial planning

In today’s financial markets characterized by constantly changing tax laws and increasingly complex transactions, the demand for family financial planning (FFP) services is rising dramatically. However, the current trend to develop advisory systems that focus mainly on the financial or investment side fails to consider the whole picture of FFP. Separating financial or investment advice from legal and accounting advice may result in conflicting advice or important omissions that could lead to users suffering financial loss. In this paper, we propose a conceptual model for FFP decision-making process, followed by a novel architecture to support an aggregated FFP decision process by utilizing intelligentagents and Web-services technology. A prototype system for supporting FFP decision is presented to demonstrate the advances of the proposed Web-service multi-agentsbased system architecture and business value.

Belief revision for adaptive negotiation agents

Existing negotiation agents are primitive in terms of what they can learn and how responsive they are towards the changing negotiation contexts. These weaknesses can be alleviated if an expressive representation language is used to represent negotiation contexts and a sound inference mechanism is applied to reason about the preferential changes arising in these negotiation contexts. This paper illustrates a novel adaptive negotiation agent model, which is underpinned by the well-known AGM belief revision logic. Our preliminary experiments show that the performance of the belief-based adaptive negotiation agents is promising.