Removal of toxic metals in a multi metal system using sorbents for potential application to urban stormwater treatment

In the context of increasing demand for potable water and the depletion of water resources, stormwater is a logical alternative. However, stormwater contains pollutants, among which metals are of particular interest due to their toxicity and persistence in the environment. Hence, it is imperative to remove toxic metals in stormwater to the levels prescribed by drinking water guidelines for potable use. Consequently, various techniques have been proposed, among which sorption using low cost sorbents is economically viable and environmentally benign in comparison to other techniques. However, sorbents show affinity towards certain toxic metals, which results in poor removal of other toxic metals. It was hypothesised in this study that a mixture of sorbents that have different metal affinity patterns can be used for the efficient removal of a range of toxic metals commonly found in stormwater. The performance of six sorbents in the sorption of Al, Cr, Cu, Pb, Ni, Zn and Cd, which are the toxic metals commonly found in urban stormwater, was investigated to select suitable sorbents for creating the mixtures. For this purpose, a multi criteria analytical protocol was developed using the decision making methods: PROMETHEE (Preference Ranking Organisation METHod for Enrichment Evaluations) and GAIA (Graphical Analysis for Interactive Assistance). Zeolite and seaweed were selected for the creation of trial mixtures based on their metal affinity pattern and the performance on predetermined selection criteria. The metal sorption mechanisms employed by seaweed and zeolite were defined using kinetics, isotherm and thermodynamics parameters, which were determined using the batch sorption experiments. Additionally, the kinetics rate-limiting steps were identified using an innovative approach using GAIA and Spearman correlation techniques developed as part of the study, to overcome the limitation in conventional graphical methods in predicting the degree of contribution of each kinetics step in limiting the overall metal removal rate. The sorption kinetics of zeolite was found to be primarily limited by intraparticle diffusion followed by the sorption reaction steps, which were governed mainly by the hydrated ionic diameter of metals. The isotherm study indicated that the metal sorption mechanism of zeolite was primarily of a physical nature. The thermodynamics study confirmed that the energetically favourable nature of sorption increased in the order of Zn < Cu < Cd < Ni < Pb < Cr < Al, which is in agreement with metal sorption affinity of zeolite. Hence, sorption thermodynamics has an influence on the metal sorption affinity of zeolite. On the other hand, the primary kinetics rate-limiting step of seaweed was the sorption reaction process followed by intraparticle diffusion. The boundary layer diffusion was also found to limit the metal sorption kinetics at low concentration. According to the sorption isotherm study, Cd, Pb, Cr and Al were sorbed by seaweed via ion exchange, whilst sorption of Ni occurred via physisorption. Furthermore, ionic bonding is responsible for the sorption of Zn. The thermodynamics study confirmed that sorption by seaweed was energetically favourable in the order of Zn < Cu < Cd < Cr . Al < Pb < Ni. However, this did not agree with the affinity series derived for seaweed suggesting a limited influence of sorption thermodynamics on metal affinity for seaweed. The investigation of zeolite-seaweed mixtures indicated that mixing sorbents have an effect on the kinetics rates and the sorption affinity. Additionally, the theoretical relationships were derived to predict the boundary layer diffusion rate, intraparticle diffusion rate, the sorption reaction rate and the enthalpy of mixtures based on that of individual sorbents. In general, low coefficient of determination (R2) for the relationships between theoretical and experimental data indicated that the relationships were not statistically significant. This was attributed to the heterogeneity of the properties of sorbents. Nevertheless, in relative terms, the intraparticle diffusion rate, sorption reaction rate and enthalpy of sorption had higher R2 values than the boundary layer diffusion rate suggesting that there was some relationship between the former set of parameters of mixtures and that of sorbents. The mixture, which contained 80% of zeolite and 20% of seaweed, showed similar affinity for the sorption of Cu, Ni, Cd, Cr and Al, which was attributed to approximately similar sorption enthalpy of the metal ions. Therefore, it was concluded that the seaweed-zeolite mixture can be used to obtain the same affinity for various metals present in a multi metal system provided the metal ions have similar enthalpy during sorption by the mixture.

Optimal power system stabilizer tuning in multi-machine system via an improved differential evolution

Power system stabilizer (PSS) is one of the most important controllers in modern power systems for damping low frequency oscillations. Many efforts have been dedicated to design the tuning methodologies and allocation techniques to obtain optimal damping behaviors of the system. Traditionally, it is tuned mostly for local damping performance, however, in order to obtain a globally optimal performance, the tuning of PSS needs to be done considering more variables. Furthermore, with the enhancement of system interconnection and the increase of system complexity, new tools are required to achieve global tuning and coordination of PSS to achieve optimal solution in a global meaning. Differential evolution (DE) is a recognized as a simple and powerful global optimum technique, which can gain fast convergence speed as well as high computational efficiency. However, as many other evolutionary algorithms (EA), the premature of population restricts optimization capacity of DE. In this paper, a modified DE is proposed and applied for optimal PSS tuning of 39-Bus New-England system. New operators are introduced to reduce the probability of getting premature. To investigate the impact of system conditions on PSS tuning, multiple operating points will be studied. Simulation result is compared with standard DE and particle swarm optimization (PSO).

Characterizing multi-agent team behavior from partial team tracings : evidence from the English Premier League

Real-world AI systems have been recently deployed which can automatically analyze the plan and tactics of tennis players. As the game-state is updated regularly at short intervals (i.e. point-level), a library of successful and unsuccessful plans of a player can be learnt over time. Given the relative strengths and weaknesses of a player’s plans, a set of proven plans or tactics from the library that characterize a player can be identified. For low-scoring, continuous team sports like soccer, such analysis for multi-agent teams does not exist as the game is not segmented into “discretized” plays (i.e. plans), making it difficult to obtain a library that characterizes a team’s behavior. Additionally, as player tracking data is costly and difficult to obtain, we only have partial team tracings in the form of ball actions which makes this problem even more difficult. In this paper, we propose a method to overcome these issues by representing team behavior via play-segments, which are spatio-temporal descriptions of ball movement over fixed windows of time. Using these representations we can characterize team behavior from entropy maps, which give a measure of predictability of team behaviors across the field. We show the efficacy and applicability of our method on the 2010-2011 English Premier League soccer data.

Positional Consensus in Multi-Agent Systems using a Broadcast Control Mechanism

In this paper a strategy for controlling a group of agents to achieve positional consensus is presented. The proposed technique is based on the constraint that every agents must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. We propose a novel linear programming formulation that is computationally less intensive than earlier proposed methods. Moreover, we introduce a random perturbation input in the control command that helps us to achieve perfect consensus even for a large number of agents, which was not possible with the existing strategy in the literature. Moreover, we extend the method to achieve positional consensus at a pre-specified location. The effectiveness of the approach is illustrated through simulation results.

A hybrid agent architecture for modeling autonomous agents in SAGE

This paper highlights the Hybrid agent construction model being developed that allows the description and development of autonomous agents in SAGE (Scalable, fault Tolerant Agent Grooming Environment) - a second generation FIPA-Compliant Multi-Agent system. We aim to provide the programmer with a generic and well defined agent architecture enabling the development of sophisticated agents on SAGE, possessing the desired properties of autonomous agents - reactivity, pro-activity, social ability and knowledge based reasoning. © Springer-Verlag Berlin Heidelberg 2005.

Negotiation schemes for multi-agent cooperative search

Because of limited sensor and communication ranges, designing efficient mechanisms for cooperative tasks is difficult. In this article, several negotiation schemes for multiple agents performing a cooperative task are presented. The negotiation schemes provide suboptimal solutions, but have attractive features of fast decision-making, and scalability to large number of agents without increasing the complexity of the algorithm. A software agent architecture of the decision-making process is also presented. The effect of the magnitude of information flow during the negotiation process is studied by using different models of the negotiation scheme. The performance of the various negotiation schemes, using different information structures, is studied based on the uncertainty reduction achieved for a specified number of search steps. The negotiation schemes perform comparable to that of optimal strategy in terms of uncertainty reduction and also require very low computational time, similar to 7 per cent to that of optimal strategy. Finally, analysis on computational and communication requirement for the negotiation schemes is carried out.

Scalable fault tolerant agent grooming environment-SAGE

Multi-agent systems (MAS) advocate an agent-based approach to software engineering based on decomposing problems in terms of decentralized, autonomous agents that can engage in flexible, high-level interactions. This chapter introduces scalable fault tolerant agent grooming environment (SAGE), a second-generation Foundation for Intelligent Physical Agents (FIPA)-compliant multi-agent system developed at NIIT-Comtec, which provides an environment for creating distributed, intelligent, and autonomous entities that are encapsulated as agents. The chapter focuses on the highlight of SAGE, which is its decentralized fault-tolerant architecture that can be used to develop applications in a number of areas such as e-health, e-government, and e-science. In addition, SAGE architecture provides tools for runtime agent management, directory facilitation, monitoring, and editing messages exchange between agents. SAGE also provides a built-in mechanism to program agent behavior and their capabilities with the help of its autonomous agent architecture, which is the other major highlight of this chapter. The authors believe that the market for agent-based applications is growing rapidly, and SAGE can play a crucial role for future intelligent applications development. © 2007, IGI Global.

Deploy and search strategy for multi-agent systems using Voronoi partitions

In this paper we analyze a deploy and search strategy for multi-agent systems. Mobile agents equipped with sensors carry out search operation in the search space. The lack of information about the search space is modeled as an uncertainty density distribution over the space, and is assumed to be known to the agents a priori. In each step, the agents deploy themselves in an optimal way so as to maximize per step reduction in the uncertainty density. We analyze the proposed strategy for convergence and spatial distributedness. The control law moving the agents has been analyzed for stability and convergence using LaSalle's invariance principle, and for spatial distributedness under a few realistic constraints on the control input such as constant speed, limit on maximum speed, and also sensor range limits. The simulation experiments show that the strategy successfully reduces the average uncertainty density below the required level.

Self assessment schemes for multi-agent cooperative search

In this paper, we present self assessment schemes (SAS) for multiple agents performing a search mission on an unknown terrain. The agents are subjected to limited communication and sensor ranges. The agents communicate and coordinate with their neighbours to arrive at route decisions. The self assessment schemes proposed here have very low communication and computational overhead. The SAS also has attractive features like scalability to large number of agents and fast decision-making capability. SAS can be used with partial or complete information sharing schemes during the search mission. We validate the performance of SAS using simulation on a large search space consisting of 100 agents with different information structures and self assessment schemes. We also compare the results obtained using SAS with that of a previously proposed negotiation scheme. The simulation results show that the SAS is scalable to large number of agents and can perform as good as the negotiation schemes with reduced communication requirement (almost 20% of that required for negotiation).

Stability of synchronization in a multi-cellular system

Networks of biochemical reactions regulated by positive-and negative-feedback processes underlie functional dynamics in single cells. Synchronization of dynamics in the constituent cells is a hallmark of collective behavior in multi-cellular biological systems. Stability of the synchronized state is required for robust functioning of the multi-cell system in the face of noise and perturbation. Yet, the ability to respond to signals and change functional dynamics are also important features during development, disease, and evolution in living systems. In this paper, using a coupled multi-cell system model, we investigate the role of system size, coupling strength and its topology on the synchronization of the collective dynamics and its stability. Even though different coupling topologies lead to synchronization of collective dynamics, diffusive coupling through the end product of the pathway does not confer stability to the synchronized state. The results are discussed with a view to their prevalence in biological systems. Copyright (C) EPLA, 2010

Multi-Agent Rendezvous Algorithm with Rectilinear Decision Domain

The aim of this paper is to develop a computationally efficient decentralized rendezvous algorithm for a group of autonomous agents. The algorithm generalizes the notion of sensor domain and decision domain of agents to enable implementation of simple computational algorithms. Specifically, the algorithm proposed in this paper uses a rectilinear decision domain (RDD) as against the circular decision domain assumed in earlier work. Because of this, the computational complexity of the algorithm reduces considerably and, when compared to the standard Ando's algorithm available in the literature, the RDD algorithm shows very significant improvement in convergence time performance. Analytical results to prove convergence and supporting simulation results are presented in the paper.

Positional Consensus of Multi-Agent Systems Using Linear Programming Based Decentralized Control with Rectilinear Decision Domain

In this paper we develop a Linear Programming (LP) based decentralized algorithm for a group of multiple autonomous agents to achieve positional consensus. Each agent is capable of exchanging information about its position and orientation with other agents within their sensing region. The method is computationally feasible and easy to implement. Analytical results are presented. The effectiveness of the approach is illustrated with simulation results.

Automated Multi-Agent Search Using Centroidal Voronoi Configuration

This paper addresses the problem of automated multiagent search in an unknown environment. Autonomous agents equipped with sensors carry out a search operation in a search space, where the uncertainty, or lack of information about the environment, is known a priori as an uncertainty density distribution function. The agents are deployed in the search space to maximize single step search effectiveness. The centroidal Voronoi configuration, which achieves a locally optimal deployment, forms the basis for the proposed sequential deploy and search strategy. It is shown that with the proposed control law the agent trajectories converge in a globally asymptotic manner to the centroidal Voronoi configuration. Simulation experiments are provided to validate the strategy. Note to Practitioners-In this paper, searching an unknown region to gather information about it is modeled as a problem of using search as a means of reducing information uncertainty about the region. Moreover, multiple automated searchers or agents are used to carry out this operation optimally. This problem has many applications in search and surveillance operations using several autonomous UAVs or mobile robots. The concept of agents converging to the centroid of their Voronoi cells, weighted with the uncertainty density, is used to design a search strategy named as sequential deploy and search. Finally, the performance of the strategy is validated using simulations.

Multi-agent search using?sensors with heterogeneous capabilities

In this thesis we address the problem of multi-agent search. We formulate two deploy and search strategies based on optimal deployment of agents in search space so as to maximize the search effectiveness in a single step. We show that a variation of centroidal Voronoi configuration is the optimal deployment. When the agents have sensors with different capabilities, the problem will be heterogeneous in nature. We introduce a new concept namely, generalized Voronoi partition in order to formulate and solve the heterogeneous multi-agent search problem. We address a few theoretical issues such as optimality of deployment, convergence and spatial distributedness of the control law and the search strategies. Simulation experiments are carried out to compare performances of the proposed strategies with a few simple search strategies.

Fault-Tolerant Average Execution Time Optimization for General Purpose Multi-Processor System-on Chips

Fault-tolerance is due to the semiconductor technology development important, not only for safety-critical systems but also for general-purpose (non-safety critical) systems. However, instead of guaranteeing that deadlines always are met, it is for general-purpose systems important to minimize the average execution time (AET) while ensuring fault-tolerance. For a given job and a soft (transient) error probability, we define mathematical formulas for AET that includes bus communication overhead for both voting (active replication) and rollback-recovery with checkpointing (RRC). And, for a given multi-processor system-on-chip (MPSoC), we define integer linear programming (ILP) models that minimize AET including bus communication overhead when: (1) selecting the number of checkpoints when using RRC, (2) finding the number of processors and job-to-processor assignment when using voting, and (3) defining fault-tolerance scheme (voting or RRC) per job and defining its usage for each job. Experiments demonstrate significant savings in AET.