RESUMEN

The optimal leaderless and leader-following time-varying formation (TVF) control problems for second-order multiagent systems (MASs) are investigated, where two optimal TVF control protocols are proposed to achieve the desired formations as well as minimize the comprehensive optimization function that contain the cooperative performance index and the control energy index. For leaderless case, the optimal formation control problem is reformulated as an infinite-time state regulator problem by employing the state space decomposition method, which is subject to specified constraints on energy and performance indices, and the analytic criterion for optimal TVF achievability is subsequently proposed. Then, the results of optimal leaderless TVF control are extended to the leader-following case with switching topologies, where the main challenge is changed to find the optimal controller rather than the optimal gain matrix, and the optimal value of the comprehensive index is accurately determined. Finally, two simulation cases are proposed to validate the effectiveness of the theoretical results, and comparisons with previous works are presented to expound the optimality of the proposed formation control method.

RESUMEN

In this study, a multi-agent system (MAS) is incorporated in a decentralized strategy to restore distribution systems while taking into account coupling neighboring microgrids (CNMGs). This provides modeling for renewable energy sources (RESs), electric vehicles (EVs), battery storage systems (BSS) and load. The desired and most favorable restoration path is found by the MAS, in which zone agents are dispersed across the distribution system. The MAS can also manage microgrids (MGs) overloaded as the unbalance operation of RESs, BSS, EVs, and load. This is realized by making a bridge between MGs and neighboring non-overloaded MGs. The suggested method adheres to voltage and power flow restrictions while operating according to expert system standards. The recommended approach is put to the test using a 33-bus radial distribution system. MATLAB calculations on agents and power flow are carried out in order to verify the validity of the choices made by agents. The proposed restoration plan is able to obtain the best power supply path with a low number of switching in the event of a fault so that the voltage magnitude is higher than 0.9 p.u. and free capacity is available for the distribution lines. The smart charging strategy of EVs reduces 93% of their turn off compared to the non-smart charging strategy. However, if the CNMG plan is established, all vehicles can be powered.

RESUMEN

This paper focuses on online recorded-data-based composite adaptive fuzzy bipartite consensus control for uncertain fractional-order multiagent systems with interconnected terms and external disturbances by employing a switched-threshold-based event-triggered mechanism (ETM) under the backstepping structure. Fuzzy logic system is used as a universal function approximation to deal with function uncertainties that are not prone to model in the system. A new composite learning adaptive parameter design scheme that synthesizes both prediction error and tracking error is developed to enhance the tracking performance, where the prediction error is raised from the utilization of online recorded data and instantaneous data. A unique switched-threshold-based ETM is introduced, in which the information transmission between the sensor and the controller is imposed on one of the individuals. One merit of this work consists in that it can automatically and rapidly switch and adjust between the fixed threshold and relative threshold ETM according to the amplitude of input signals to balance the network resources and impede the occurrence of pulse phenomenon. In addition, it is theoretically proven that the proposed scheme can ensure that all internal signals of the closed-loop system are bounded and achieve local bipartite consistent errors through the fractional Lyapunov stability criterion. Finally, a numerical example is provided to confirm the feasibility of the proposed approach.

RESUMEN

This paper proposes a new induced attack strategy against multiagent systems from the perspective of the attacker. It is noted that the induced attack can drive multiagent systems as a whole to follow a specific trajectory prescribed by the attacker, which cannot be achieved by denial-of-service attacks or deception attacks. Firstly, the induced attack signal is produced by establishing an attack generation exosystem, whose dynamics can be regulated to generate the prescribed consensus trajectory. Then, by the local state information and the induced attack signal among partial agents, a new induced attack protocol is proposed, which consists of the nominal consensus term and the induced attack term. By constructing the projection of the induced attack signal onto the consensus subspace, an explicit expression of the prescribed consensus trajectory is determined, which describes the movement trajectory of the entire multiagent system under the induced attack. Meanwhile, the induced attack design criterion is proposed to determine the dynamics matrix of the attack generation exosystem via the robust H∞ scheme. Finally, the simulation example is performed to illustrate the effectiveness of theoretical results.

RESUMEN

In this paper, we propose a control scheme to ensure the microgrid control layers are resilient to cyberattacks. The studied microgrid consists of several distributed generation (DG) units and we consider the hierarchical control structure that is common for microgrids. The use of communication channels among DGs has made microgrids more vulnerable and this is where cybersecurity issues arise. In this work we added three algorithms, reputation-based, Weighted Mean Subsequence Reduced (W-MSR) and Resilient Consensus Algorithm with Trusted Nodes (RCA-T), to the secondary control layer of the microgrid and made them resilient to false data injection (FDI) attacks. In reputation-based control, some procedures are used for detecting the attacked DGs and isolating them from the others. W-MSR and RCA-T are Mean Subsequence Reduced (MSR)-based algorithms that fade the effect of attacks without finding them. These algorithms use a simple strategy that ignores some extreme values of neighboring agents, so an attacker can simply get ignored. Our analysis of the reputation-based algorithm is based on scrambling matrices, so the communication graph can switch in a prescribed set. In each of the above cases, to evaluate the performance of the designed controllers, in addition to theoretical analysis, we evaluated and compared the controllers using simulation.

RESUMEN

In multiagent systems, it can be hard to design individual models due to financial constraints and design challenges. Given this, most studies use the same models for each individual and fail to take into account intra-group differences. In this paper, the effects of differences within a group on flocking and obstacle avoidance movements are studied. Individual differences, group differences, and mutants are the most significant intra-group differences. The differences lie mostly in perceptual radius, inter-individual forces, and the ability to avoid obstacles and pursue goals. We designed a smooth and bounded hybrid potential function with indefinite parameters. This function satisfies the consistency control requirements of the three previously mentioned systems. It is also applicable to ordinary cluster systems without individual differences. As a result of the action of this function, the system has the advantages of rapid swarming and constant system connectivity during motion. Through theoretical analysis and computer simulation, we confirm the effectiveness of our theoretical class framework designed for a multi-agent system with internal differences.

RESUMEN

Although network management tasks are highly automated using big data and artificial intelligence technologies, when an unforeseen cybersecurity problem or fault scenario occurs, administrators sometimes directly analyze system data to make a heuristic decision. However, a wide variety of information is required to address complex cybersecurity risks, whereas current systems are focused on narrowing the candidates of information. In this study, we propose a multiagent-based data presentation mechanism (MADPM) that consists of agents operating data-processing tools that store and analyze network data. Agents in MADPM interact with other agents to form data-processing sequences. In this process, we design not only the composition of the sequence according to requirements, but also a mechanism to expand it to enable multifaceted analysis that supports heuristic reasoning. We tested five case studies in the prototype system implemented in an experimental network. The results indicated that the multifaceted presentation of data can support administrators more than the selected single-faceted optimal presentation. The final outcome of our proposed approach is the provision of a multifaceted and cross-system data presentation for heuristic inference in network management tasks.

Asunto(s)

RESUMEN

Microarray technology is fully established among the research fields in genetic domain. Academia and industrial researchers investigate and analyze genes' expression to obtain more and more useful information about given organisms, with the aim to perform better disease diagnosis and prediction, accurate medical data analysis, etc. Analyzing gene expression data, often available in raw form, implies a huge amount of analytical and computational complexities and therefore, innovative and intelligent mechanisms have to be designed to obtain useful information from this precious data. This chapter proposes a multiagent algorithm for building a distributed algorithm for DNA Microarray management. A collection of agents, in which each one representing a Microarray (or chip), execute in parallel a sequence of simple operations exploiting local information, and an organized virtual structure is built at global level. A word embeddings approach, able to capture the semantic context and represent Microarrays with vectors, is employed to map the chips, so allowing advanced agents' operations. A similarity-based overlay network of agents is brought out and an efficient management system of DNA Microarray is enabled. The generated virtual structure allows executing of informed operations, such as range queries, in a large dataset containing unstructured data. Preliminary results were confirm the validity of the algorithm proposed.

Asunto(s)

RESUMEN

A recent study on the immunotherapy treatment of renal cell carcinoma reveals better outcomes in obese patients compared to lean subjects. This enigmatic contradiction has been explained, in the context of the debated obesity paradox, as the effect produced by the cell-cell interaction network on the tumor microenvironment during the immune response. To better understand this hypothesis, we provide a computational framework for the in silico study of the tumor behavior. The starting model of the tumor, based on the cell-cell interaction network, has been described as a multiagent system, whose simulation generates the hypothesized effects on the tumor microenvironment. The medical needs in the immunotherapy design meet the capabilities of a multiagent simulator to reproduce the dynamics of the cell-cell interaction network, meaning a reaction to environmental changes introduced through the experimental data.

RESUMEN

Conflict resolution is one of the central tasks during the control of air traffic. In this article, we examined the problem of conflict resolution for unmanned aerial vehicle (UAV) integration into national airspace system and presented an approach based on satisficing game theory to conflict resolution for cooperative UAVs and manned aircraft sharing airspace. This approach ensured the priority of manned aircraft to alleviate the impact of UAVs on air traffic control and reduced the resistance of UAVs integrating into the controlled airspace. At the same time, the approach took account of the heterogeneity of aircraft, which is more realistic considering the UAVs and manned aircraft sharing the same airspace. The preliminary result of the simulation proved that our method was qualified to tackle many tough scenarios.

Asunto(s)

RESUMEN

This study focuses on category formation for individual agents and the dynamics of symbol emergence in a multi-agent system through semiotic communication. In this study, the semiotic communication refers to exchanging signs composed of the signifier (i.e., words) and the signified (i.e., categories). We define the generation and interpretation of signs associated with the categories formed through the agent's own sensory experience or by exchanging signs with other agents as basic functions of the semiotic communication. From the viewpoint of language evolution and symbol emergence, organization of a symbol system in a multi-agent system (i.e., agent society) is considered as a bottom-up and dynamic process, where individual agents share the meaning of signs and categorize sensory experience. A constructive computational model can explain the mutual dependency of the two processes and has mathematical support that guarantees a symbol system's emergence and sharing within the multi-agent system. In this paper, we describe a new computational model that represents symbol emergence in a two-agent system based on a probabilistic generative model for multimodal categorization. It models semiotic communication via a probabilistic rejection based on the receiver's own belief. We have found that the dynamics by which cognitively independent agents create a symbol system through their semiotic communication can be regarded as the inference process of a hidden variable in an interpersonal multimodal categorizer, i.e., the complete system can be regarded as a single agent performing multimodal categorization using the sensors of all agents, if we define the rejection probability based on the Metropolis-Hastings algorithm. The validity of the proposed model and algorithm for symbol emergence, i.e., forming and sharing signs and categories, is also verified in an experiment with two agents observing daily objects in the real-world environment. In the experiment, we compared three communication algorithms: no communication, no rejection, and the proposed algorithm. The experimental results demonstrate that our model reproduces the phenomena of symbol emergence, which does not require a teacher who would know a pre-existing symbol system. Instead, the multi-agent system can form and use a symbol system without having pre-existing categories.

RESUMEN

We present a novel finite-time average consensus protocol based on event-triggered control strategy for multiagent systems. The system stability is proved. The lower bound of the interevent time is obtained to guarantee that there is no Zeno behavior. Moreover, the upper bound of the convergence time is obtained. The relationship between the convergence time and protocol parameter with initial state is analyzed. Lastly, simulations are conducted to verify the effectiveness of the results.

RESUMEN

Pharmacovigilance is the scientific discipline that copes with the continuous assessment of the safety profile of marketed drugs. This assessment relies on diverse data sources, which are routinely analysed to identify the so-called "signals", i.e. potential associations between drugs and adverse effects, that are unknown or incompletely documented. Various computational methods have been proposed to support domain experts in signal detection. However, recent comparative studies illustrated that current methods exhibit high false-positive rates, significantly variable performance across different datasets used for analysis and events of interest, but also complementarity in their outcomes. In this regard, in order to reinforce accurate and timely signal detection, we elaborated through an agent-based approach towards systematic, joint exploitation of multiple heterogeneous signal detection methods, data sources and other drug-related resources under a common, integrated framework. The approach relies on a multiagent system operating based on a collaborative agent interaction protocol, aiming to implement a comprehensive workflow that comprises of method selection and execution, as well as outcomes' aggregation, filtering, ranking and annotation. This paper presents the design of the proposed multiagent system, discusses implementation issues and demonstrates the applicability of the proposed solution in an example signal detection scenario. This work constitutes a step towards large-scale, integrated and knowledge-intensive computational signal detection.

Asunto(s)

RESUMEN

A microgrid is composed of distributed power generation systems (DGs), distributed energy storage devices (DSs), and loads. To maintain a specific frequency in the islanded mode as an important requirement, the control of DGs' output and charge action of DSs are used in supply surplus conditions and load-shedding and discharge action of DSs are used in supply shortage conditions. Recently, multiagent systems for autonomous microgrid operation have been studied. Especially, load-shedding, which is intentional reduction of electricity use, is a critical problem in islanded microgrid operation based on the multiagent system. Therefore, effective schemes for load-shedding are required. Meanwhile, the bankruptcy problem deals with dividing short resources among multiple agents. In order to solve the bankruptcy problem, division rules, such as the constrained equal awards rule (CEA), the constrained equal losses rule (CEL), and the random arrival rule (RA), have been used. In this paper, we approach load-shedding as a bankruptcy problem. We compare load-shedding results by above-mentioned rules in islanded microgrid operation based on wireless sensor network (WSN) as the communication link for an agent's interactions.

Asunto(s)