Multi-agent systems for modeling high penetration photovoltaic system impacts in distribution networks

This paper reviews the use of multi-agent systems to model the impacts of high levels of photovoltaic (PV) system penetration in distribution networks and presents some preliminary data obtained from the Perth Solar City high penetration PV trial. The Perth Solar City trial consists of a low voltage distribution feeder supplying 75 customers where 29 consumers have roof top photovoltaic systems. Data is collected from smart meters at each consumer premises, from data loggers at the transformer low voltage (LV) side and from a nearby distribution network SCADA measurement point on the high voltage side (HV) side of the transformer. The data will be used to progressively develop MAS models.

Evaluation of the relationship between Chlamydia pecorum sequence types and disease using a species-specific multi-locus sequence typing scheme (MLST)

Chlamydia pecorum is globally associated with several ovine diseases including keratoconjunctivitis and polyarthritis. The exact relationship between the variety of C. pecorum strains reported and the diseases described in sheep remains unclear, challenging efforts to accurately diagnose and manage infected flocks. In the present study, we applied C. pecorum multi-locus sequence typing (MLST) to C. pecorum positive samples collected from sympatric flocks of Australian sheep presenting with conjunctivitis, conjunctivitis with polyarthritis, or polyarthritis only and with no clinical disease (NCD) in order to elucidate the exact relationships between the infecting strains and the range of diseases. Using Bayesian phylogenetic and cluster analyses on 62 C. pecorum positive ocular, vaginal and rectal swab samples from sheep presenting with a range of diseases and in a comparison to C. pecorum sequence types (STs) from other hosts, one ST (ST 23) was recognised as a globally distributed strain associated with ovine and bovine diseases such as polyarthritis and encephalomyelitis. A second ST (ST 69) presently only described in Australian animals, was detected in association with ovine as well as koala chlamydial infections. The majority of vaginal and rectal C. pecorum STs from animals with NCD and/or anatomical sites with no clinical signs of disease in diseased animals, clustered together in a separate group, by both analyses. Furthermore, 8/13 detected STs were novel. This study provides a platform for strain selection for further research into the pathogenic potential of C. pecorum in animals and highlights targets for potential strain-specific diagnostic test development.

Development of a multi-locus sequence typing scheme for avian isolates of Pasteurella multocida.

A total of 63 isolates of Pasteurella multocida from Australian poultry, all associated with fowl cholera outbreaks, and three international reference strains, representing the three subspecies within P. multocida were used to develop a multi-locus sequence typing scheme. Primers were designed for conserved regions of seven house-keeping enzymes - adk, est, gdh, mdh, pgi, pmi and zwf - and internal fragments of 570-784 bp were sequenced for all isolates and strains. The number of alleles at the different loci ranged from 11 to 20 and a total of 29 allelic profiles or sequence types were recognised amongst the 66 strains. There was a strong concordance between the MLST data and the existing multi-locus enzyme electrophoresis and ribotyping data. When used to study a sub-set of isolates with a known detailed epidemiological history, the MLST data matched the results given by restriction endonuclease analysis, pulsed-field gel electrophoresis, ribotyping and REP-PCR. The MLST scheme provides a high level of resolution and is an excellent tool for studying the population structure and epidemiology of P. multocida.

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 collaborative multi-agent based conference planner application using web and grid services

Distributed Collaborative Computing services have taken over centralized computing platforms allowing the development of distributed collaborative user applications. These applications enable people and computers to work together more productively. Multi-Agent System (MAS) has emerged as a distributed collaborative environment which allows a number of agents to cooperate and interact with each other in a complex environment. We want to place our agents in problems whose solutions require the collation and fusion of information, knowledge or data from distributed and autonomous information sources. In this paper we present the design and implementation of an agent based conference planner application that uses collaborative effort of agents which function continuously and autonomously in a particular environment. The application also enables the collaborative use of services deployed geographically wide in different technologies i.e. Software Agents, Grid computing and Web service. The premise of the application is that it allows autonomous agents interacting with web and grid services to plan a conference as a proxy to their owners (humans). © 2005 IEEE.

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.

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.

Multi-agent Search using Voronoi partitions

This paper addresses the problem of multiagent search in an unknown environment. The agents are autonomous in nature and are equipped with necessary sensors to carry out the search operation. The uncertainty, or lack of information about the search area is known a priori as a probability density function. The agents are deployed in an optimal way so as to maximize the one step uncertainty reduction. The agents continue to deploy themselves and reduce uncertainty till the uncertainty density is reduced over the search space below a minimum acceptable level. It has been shown, using LaSalle’s invariance principle, that a distributed control law which moves each of the agents towards the centroid of its Voronoi partition, modified by the sensor range leads to single step optimal deployment. This principle is now used to devise search trajectories for the agents. The simulations were carried out in 2D space with saturation on speeds of the agents. The results show that the control strategy per step indeed moves the agents to the respective centroid and the algorithm reduces the uncertainty distribution to the required level within a few steps.

Multi-agent Reinforcement Learning for Traffic Signal Control

Optimal control of traffic lights at junctions or traffic signal control (TSC) is essential for reducing the average delay experienced by the road users amidst the rapid increase in the usage of vehicles. In this paper, we formulate the TSC problem as a discounted cost Markov decision process (MDP) and apply multi-agent reinforcement learning (MARL) algorithms to obtain dynamic TSC policies. We model each traffic signal junction as an independent agent. An agent decides the signal duration of its phases in a round-robin (RR) manner using multi-agent Q-learning with either is an element of-greedy or UCB 3] based exploration strategies. It updates its Q-factors based on the cost feedback signal received from its neighbouring agents. This feedback signal can be easily constructed and is shown to be effective in minimizing the average delay of the vehicles in the network. We show through simulations over VISSIM that our algorithms perform significantly better than both the standard fixed signal timing (FST) algorithm and the saturation balancing (SAT) algorithm 15] over two real road networks.

An incremental micromechanical scheme for nonlinear particulate composites

A general incremental micromechanical scheme for the nonlinear behavior of particulate composites is presented in this paper. The advantage of this scheme is that it can reflect partly the effects of the third invariant of the stress on the overall mechanical behavior of nonlinear composites. The difficulty involved is the determination of the effective compliance tensors of the anisotropic multiphase composites. This is completed by making use of the generalized self-consistent Mori-Tanaka method which was recently developed by Dai et al. (Polymer Composites 19(1998) 506-513; Acta Mechanica Solida 18 (1998) 199-208). Comparison with existing theoretical and numerical results demonstrates that the present incremental scheme is quite satisfactory. Based on this incremental scheme, the overall mechanical behavior of a hard-particle reinforced metal matrix composite with progressive particle debonding damage is investigated.