Next Article in Journal
Water Sources Diagram and Its Applications
Next Article in Special Issue
Optimum Design of a Standalone Solar Photovoltaic System Based on Novel Integration of Iterative-PESA-II and AHP-VIKOR Methods
Previous Article in Journal
A Cooperative Control Scheme for AC/DC Hybrid Autonomous Microgrids
Previous Article in Special Issue
Layout Optimization Process to Minimize the Cost of Energy of an Offshore Floating Hybrid Wind–Wave Farm
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Review

Multi-Agent Systems and Complex Networks: Review and Applications in Systems Engineering

by
Manuel Herrera
1,*,†,
Marco Pérez-Hernández
1,†,
Ajith Kumar Parlikad
1,† and
Joaquín Izquierdo
2,†
1
Institute for Manufacturing, Department of Engineering, University of Cambridge, Cambridge CB3 0FS, UK
2
Fluing, Institute for Multidisciplinary Mathematics, Universitat Politècnica de València, 40022 Valencia, Spain
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Processes 2020, 8(3), 312; https://doi.org/10.3390/pr8030312
Submission received: 23 January 2020 / Revised: 5 March 2020 / Accepted: 6 March 2020 / Published: 8 March 2020

Abstract

:
Systems engineering is an ubiquitous discipline of Engineering overlapping industrial, chemical, mechanical, manufacturing, control, software, electrical, and civil engineering. It provides tools for dealing with the complexity and dynamics related to the optimisation of physical, natural, and virtual systems management. This paper presents a review of how multi-agent systems and complex networks theory are brought together to address systems engineering and management problems. The review also encompasses current and future research directions both for theoretical fundamentals and applications in the industry. This is made by considering trends such as mesoscale, multiscale, and multilayer networks along with the state-of-art analysis on network dynamics and intelligent networks. Critical and smart infrastructure, manufacturing processes, and supply chain networks are instances of research topics for which this literature review is highly relevant.

1. Introduction

Systems engineering is an amalgamation of engineering disciplines for the design, control, and overall management of the life cycle of engineered systems from an interdisciplinary point of view [1]. This involves various levels of abstraction of a system in which the interconnections between the parts (at each abstraction level) are often represented by a complex network [2,3]. Each component of the system then works towards individual and collective objectives to optimise local and general performance objectives. This decision-making process of each component can be modelled by multi-agent systems (MAS) [4,5]. Thus, both complex networks and MAS are of main importance for systems engineering and management. This paper presents the essentials of complex networks and MAS for control and optimisation in systems engineering. This is made through a theoretical overview and literature review of both approaches, introducing them separately ahead of discussing how they can be combined.
A complex network is mathematical abstraction of a real system in the form of a graph. As a difference from graphs, complex networks usually take non-regular topologies to better represent such real-world systems from which may also inherit another features. Examples of complex networks are utility networks [6], social networks [7], chemical reactions [8], or molecular networks [9], among many others. In many cases, networks may vary their properties and functionality depending on internal evolution of their properties or by reacting to exogenous interactions. For instance, in a telecommunication system network, nodes (e.g., routers and switches) may suffer over time a degradation in their properties that may lead them to diminish their performance. However, just the daily variation on traffic demand also has an impact on such nodes performance. Unexpected, external intervention such as cyber-attacks or extreme weather conditions may affect the properties, even the topology of a telecommunication system.
Intelligent distributed systems are capable of modelling how different parts of the network might work individually and collectively [10]. Ultimately, this is used as support for any decision-making system aiming to achieve better overall system functioning and its consequent performance. Intelligent distributed systems encompass autonomous learning units that can be associated with the nodes of a complex network. These intelligent network nodes are able to act independently and also interact with other nodes to pursue both individual (local) and general system-level targets. The necessary communication between individuals can be represented by links of the complex network connecting their nodes. It is natural to understand such nodes as intelligent agents within a MAS framework. Each agent separately obeying simple rules but working together with other agents makes it possible to approach complex engineering challenges. Intelligent distributed systems have been proposed in a broad range of engineered complex systems [11,12]. Precisely, the review proposed herein focuses only on engineered systems and manufacturing processes, given the wide spectrum of the approached topic. Out of this review fall, then, topics related to social systems analysis such as migration models [13,14] or online social media [15,16]. Similarly, natural systems are out of this review scope. This is the case of computational chemistry [17,18], biology [19,20], and metabolic networks [21,22].
Automatic optimisation and control in an engineering system is associated with a near real-time data acquisition and an optimal decision-making. The aim is to maximise the quality and performance of the outcome while minimising the overall costs of the process. The combination of complex networks and MAS provides an integrated framework for systems optimisation and control. The success of this framework is mainly based on its high applicability together with the relative simplicity of the approach. Part of the challenges and research directions in complex networks are coming from the investigation further of their structure at several dimensions or network layers and from the variety of resolution levels (mesoscale networks) in which a network can be analysed. These research topics are complement of those related to network-flow dynamics [23], time-evolving networks [24], and smart systems [25] for which MAS have emerged in their research.
This paper is a literature review of complex networks and MAS. The bibliographic search is approached using a list of academic databases and search engines such as Google Scholar, MDPI, Science Direct, SpringerLink, arXiv, IEEE Xplore, and Scopus. Section 2 and Section 3 encompass a literature review for basic, theoretical essentials on complex networks and MAS, respectively. As a convention, the candidate articles to be part of the review should contain word combinations in the title, keywords, or abstract related to “graph theory” or “complex networks” or “multi-agent systems” or “agent-based modelling” and their variations. The paper continues with Section 4 introducing real-world systems engineering examples for which control and optimisation processes based on complex networks and MAS have been shown to be essential for their operation, management, and protection. The above keywords are subsequently crossed (“and” operator) with others such as “engineering systems” or “critical infrastructure” or “engineering processes” or “manufacturing” or “supply chain” and their variations. Section 5 closes the paper with an open discussion about the systems engineering applications presented in the paper and future research directions on applied complex networks and MAS.

2. Complex Networks

A mathematical graph, G , is formally defined as an ordered pair ( V , ξ ) , where V is a finite nonempty set of vertices or nodes and ξ is the set of edges or links between such nodes ξ { ( u , v ) | u , v ξ } . Complex networks are graphs in which vertices represent physical or virtual items and edges represent the interaction between them. In this paper we refer as nodes and links to complex networks elements; the same elements are, respectively, referred as vertices and edges within the graph theory framework.

2.1. Graph Theory: Basic Concepts

Graph theory is the subject of mathematics specifically dedicated to the study of graphs [26]. In order to approach further analysis for graphs, there is a need to represent them as matrices. A common way to do it is by defining the adjacency matrix, A . In case of undirected graphs, A is symmetric and its elements have values a i j = a j i = w i j if nodes i and j are directly connected and a i j = a j i = 0 otherwise. A directed graph is such that the edges are directed from one vertex to another. In such case, the matrix representing a directed graph is the so-called (oriented) incidence matrix. The sign of the matrix elements distinguishes between outgoing and incoming edges to each node. A common criterion is to give a positive sign for outgoing edges and a negative sign for incoming edges; however, the opposite sign convention is also in use.
Since the physical and performing characteristics of every link may vary, it can be considered to work with weighted graphs and their respective adjacency matrices defined by w i j > 0 . It can be understood that the unweighted graph is such that w i j = 1 for all i and j. The adjacency matrix for directed graphs does not need to necessary be symmetric. In an undirected graph, it is defined the degree of a vertex as the total number of vertices directly connected to it (adjacent vertices). The concept of node degree of directed graphs is split between outdegree (number of outgoing edges) and indegree (number of incoming edges). If the degree of a vertex is 0, then it is a singleton or isolated vertex.
Note that all the properties and models for graphs and complex networks developed herein consider, by default, simple graphs. That is, there are not considered parallel edges connecting 2 vertices or any loop connecting a vertex to itself. These characteristics define the so-called multigraphs which are out of the scope of the current paper.

2.2. Complex Networks Models

Complex networks are instances of real-world graphs. They include examples such as the Internet [27], social networks [28], supply networks [29], metabolic networks [30], and critical infrastructures [31], among other engineered systems. Table 1 shows examples of engineering systems and their network characteristics.
In theory, graphs can take any topology. However, most of them are analysed either by random graphs [32] or by a completely regular distribution. This is not the case of complex networks, where underlying mechanisms provide the network of neither random nor regular structures but follow some distinctive patterns (see Table 2). Some of these structures are the following:
  • Small-world network [33]: The paths between two randomly chosen network nodes is relatively short (usually scales with the logarithm of the total number of nodes). Therefore, in a small-world network, nodes that are not directly neighbours of one another are connected by passing just through a small number of other nodes in between.
  • Scale-free network [34]: In a random graph, the node degree distribution for all the nodes in the network follows a Poisson law. However, in complex networks, this distribution often is a heavier right-skewed one and it is better described by a power-law distribution function following the relation f ( x ) = x k , where x represents the node degree and k > 0 the law parameter. Such distribution indicates that some nodes have many more connections than the rest of the network. As the power-law function is invariant with respect to the scale, networks with node degree following this distribution are named “scale-free networks”.
  • Planar or quasi-planar networks [35]: A planar graph is such that there are not crosses between edges. That is, the edges intersect only at their endpoints. These types of graphs are naturally sparse as they have the same order for the number of edges as for the number of vertices. Planarity or near-planarity propriety can be taken into account to simplify the network analysis of real-world applications. These include street network representation [36,37], road networks [38], water distribution systems [39], data networks [40], and general network flow problems [41].
  • Community structure [42]: This structure happens when subsets of nodes within node–node connections are dense but between which are less dense. Communities in a social network straightforwardly extend to applications in biology [43], ecology [44], engineering [45], and industry [46], among others. The property of modularity [47] is often used for detecting community structures. Modularity measures the strength of the division of a network into modules (clusters or communities). This is defined by the fraction of the edges that fall within the given groups minus the expected fraction if edges were distributed at random. The value of the modularity lies in the range [ 0 , 1 ] .
  • Core-periphery structure: These are structures in networks that present a set of densely connected nodes (core) and a set of sparsely connected nodes (periphery) [48]. Although the most widely studied network structure is that based on the concept of community, core-periphery networks have also emerged as structures of high interest on complex networks modelling [49].

2.3. Complex Networks Measures

In addition to the common structures of complex networks, there are other network properties and descriptors. This is the case of the centrality measures that are widely used for describing the network connectivity. The following are the most common centrality measures:
  • Degree centrality [50]: This is defined as the number of links incident upon a node. That is, a node with higher degree centrality will be supplied easier by any item flowing through the network.
  • Betweenness [51]: This is a measure of the relative number of shortest paths from all vertices to all others that pass through a node.
  • Closeness [52]: This measures the average distance between the network nodes. The information that this measure provides is on the density of nodes that exists in a network together with an idea of how well each node is connected with the network in terms of geodesic distance.
  • Eigenvector centrality [53]: This assigns relative scores to all nodes in the network based on the concept that connections to high-scoring nodes contribute more to the score of the node in question than equal connections to low-scoring nodes. Google’s PageRank [54] and Katz centrality [55] are variations of this concept.
All these measures can also be defined at the link level in addition to the nodes. Thus, the previous definitions can straightforwardly be extended to measures such as edge-betweenness, edge-closeness, and so on.
Additional statistical measures are as follows:
  • Transitivity or clustering [56]: This property is based on counting the number of triangles in the network—two linked nodes each of them linked to other third node in common. This is ultimately a measure quantifying how network nodes tend to cluster together.
  • Degree distribution [57]: A network node degree is the number of links connecting with that node. This has associated the following measures:
    Degree density: This measure is regarding how strong the vertices of a graph are connected.
    Degree-correlation measures: This is computed between nodes of different nature or function for the network (degree assortativity) [58].

2.4. Percolation and Node Ranking in Complex Networks

In a context of risk analysis and resilience assessment of engineered systems, it is worth mentioning how to develop complex network-based measures useful as surrogate indices or estimations of the network performance [60]. Usually, these measures are based on the so-called percolation analysis. Percolation analysis measures the consequence of nodes/links removal from the network with respect to how the typical length of a path connecting pairs of nodes increases, eventually leading to a disconnected network (infinite distance). Network resilience is a measure on how network performance indices may vary after removal of such nodes and/or links out of the network. From a more general perspective, percolation may be understood as a methodology for ranking nodes in complex networks. This subsection presents as well alternative solutions relying on concepts of diversity in connectivity (vitality) and other solutions based on computational Epidemiology processes.

2.4.1. Percolation Analysis in Complex Networks

In Stauffer and Aharony [61], percolation theory is presented as a method to analyse cascading failures in networks. Percolation models several types of network failures ranging from a single node disruption to a scenario in which a critical fraction of the network components have failed [62]. Within a complex networks framework, these failures are modelled by removal of the associated node/link elements. A fully operative network can become into nonfunctional and disconnected network as increasing the percolation of its components. Given the analogies between percolation theory and cascading failures, percolation has been widely used for risk analysis and resilience assessment [63].
Monte Carlo (MC) methods are key for percolation in complex networks [64]. MC methods generate random processes aiding approaching complex or large-scale problems [65]. They can be understood as a sampling mechanism that assigns a probability per node to be removed or to remain in the network configuration [66]. In this way, it is possible to simulate several random disruption scenarios and to check the global consequences at removing a series of links or nodes. Note that removing a node consequently removes its connection links. Li et al. [67] applied percolation theory to modelling bottlenecks in transportation networks. Carvalho et al. [68] found it also suitable for the resilience assessment of gas networks. Percolation analysis was also investigated in water networks by the works of Torres et al. [69] and also by [70]. Chen et al. [71] used percolation analysis to approach cascading models for cyber-physical power systems.

2.4.2. Node Ranking in Complex Networks

MC methods are also key for node ranking and prioritisation of assets to further management and rehabilitation plans. For instance, Hui [72] proposed MC methods as a criterion for prioritising network assets in order to approach a reliability ranking for maintenance issues. The following bullet points gather some main features of node raking in networks.
  • Percolation centrality is a way to better assess the network nodes importance. This measure enhances the purely centrality-based measures with node information with respect to the percolation state [73], making it to vary with the network dynamics of the propagation processes [74].
  • Vital nodes are defined by their topological role in the network as well as by their function and performance within the whole system [75,76]. These functions range from network synchronisation [77] to information spreading [78].
  • An alternative for locating sensitive nodes to trigger cascading failures comes by borrowing models from epidemiology [79,80,81]. How virus spread through a network has a direct parallelism to the way failures can happen at infrastructures [82]. Epidemiology models have been already adapted to aerospace infrastructure [83], transportation networks [84], and urban water networks [85], among others.

2.5. Evolving and Multilayer Complex Networks

The recent advances in real-time monitoring of engineering systems are among the main reasons why evolving complex networks should be considered further [86]. The network assets status, their properties, and even their existence vary over time in response to exogenous variables and given the dynamic nature of the network flow. Barrat et al. [87] pointed out that these variations need to be considered when modelling engineering systems through changing topology complex networks.
Understanding and modelling evolving networks have enabled the development of a wide and diverse range of ranking algorithms that take the temporal dimension into account [74]. To approach this challenge, Kim and Anderson [88] presented the temporal node centrality concept. This directly extends the well-known centrality metrics by representing the dynamic case through a static network with directed flows. An alternative methodology is based on identifying network hubs and on describing how they change over accumulation-time intervals [89]. Shekhtman et al. [90] showed that dynamic complex networks are suitable to consider failures and recovery time of nested networks configurations representing power grids, transportation systems, and communication networks.
Evolving complex networks can be understood as a special case of multilayer networks. A multilayer network is a network with more than one dimension. This is often approached as an adjacency multidimensional array (tensor) of which dimension can be reduced by constraining the network space or by applying operators for flattening the tensor into a matrix [91,92]. It is possible to analyse multilayer complex networks by generalising main network descriptors such as those on degree centrality, clustering coefficients, eigenvector centrality, and modularity [93,94]. Diffusion dynamics [95], failure spread processes [96,97], percolation analysis [98,99], and MAS simulations [100] have also been developed for multilayer networks modelling. Milanović et al. [101] showed how multilayer networks aid to model interconnected critical infrastructures. These systems’ performance depends on a hierarchy of their parts that should work synchronised. These are the physical system, a hardware and software system aiding management and control of the physical assets, and an organisational system in which there is carried out the interrelationship between various infrastructures and/or elements of the same system.

3. Multi-Agent Systems

Multi-agent Systems have been in the research arena for at least 40 years now. Their foundations date back to around 1980 when these systems were identified as a branch of the distributed artificial intelligence (DAI) field [102,103]. For the purpose of this review, we distinguish between multi-agent system (MAS) and agent-based modelling and simulation (ABMS).
  • MAS is the sub-field of DAI, originated as an approach to tackle complex problems, with a distributed nature, by splitting work among cooperative computing units (agents) that plan, reason, and communicate with each other to execute their part of the solution [102]. The essence of a MAS is its ability to enable solutions beyond the individual capabilities of each participating agent [104]. Hence, the role of agents as part of a society and the mechanisms for coordination and cooperation with others are fundamental characteristics of any MAS [5].
  • ABMS is the approach for representing repeated interactions of agents within a social system [105,106]. From this perspective, a multi-agent system is simply a network of dynamic entities called agents [107]. ABMS focuses on providing tools for observing and analysing the individual and collective behaviour of agents in a simulated environment. Different sciences and engineering disciplines have benefited from ABMS by representing humans [108], animals [109], financial traders [110], machines [111], and other active entities. ABMS is used as a tool to explore self-organisation and emergent behaviours and also to evaluate MAS theories, architectures, protocols, etc. at a macro level, that otherwise would be costly, time-consuming, or even impossible to achieve.

3.1. Agents and their Properties

Despite the progress made in last decades, there is no agreement about what an agent is and what its essential properties are. Some authors identify actions as distinctive characteristics of agents [112]. Hence, agents are action triggers with a wide spectrum of complexity in the process that lead to every action. Other researchers use the notion of agency to distinguish between two types of agents: those that exhibit properties attributed to hardware and software systems, i.e., autonomy, social ability, reactivity, and pro-activeness, and those that exhibit properties normally attributed to humans, e.g., based mental or emotional notions such as knowledge [113]. From this analysis, agents are regarded as computer systems that perform autonomous actions within the environment they are situated in pursuit of meeting their objectives [5]. Agents can also be seen as intentional systems, with representations of the mental attitudes such as belief, desires, and intentions [114]. From an ABMS perspective, agents are autonomous, not necessarily computing, entities that are proactive and interact with others [115]. The agent’s behaviour is defined by a set of simple rules to respond to local events in a certain environment, hence leading to the emergence of a system behaviour as opposite to predefined rules for the overall system behaviour [116].
The key properties of agents are presented in Table 3; we group them according to criteria where these come from. We also provide a relevance assessment indicating if these are mainly found in literature as essential or optional properties.
As consequence of the different interpretations of the agent notion, multiple authors, mainly from an MAS perspective, have come out with classifications. Authors of Reference [104] present a multidimensional scheme where, based on agent’s properties, tasks, and structure, they propose 7 types: collaborative, interface, mobile, information, reactive, hybrid, heterogeneous, and smart agents. Another classification [117] incorporates novel agent’s properties such as flexibility (lack of scripts on agent’s actions) and character (believable personality and emotional state). To date, reactive and deliberative (goal-oriented) agents have been widely used to differentiate key behaviour and properties of agents. It is also worth noting from Franklin’s classification [117] the identification of biological and robotic agents in addition to the computational ones.

3.2. Multi-Agent Models

Multi-agent models include representation for the individual agents, their interaction, and the environment [106]. The relevant agent definition depends on what they are representing, e.g., humans, machines, particles, organisms, or computing systems. The key components of multi-agent models found in literature are illustrated in Figure 1 and described below.
The agent’s capabilities are influenced by the adopted notion of agent (see Section 3.1) but commonly include communication with other agents, a mechanism for sensing the environment in order to capture the state of the properties of interest and a mechanism to act on or to influence others and the environment. The knowledge model covers relevant information for the agent to operate, including its own state as well as that of the environment and other agents [106]. In ABMS, knowledge is usually simplified and modelled as set of properties and values or as a state-machine [122,123]. More complex knowledge representations have been proposed, mainly from a MAS perspective, for example, using the fuzzy cognitive model in Reference [124] or ontologies in References [125,126,127]. The approach for representing agent’s knowledge is tied to the decision-making process. The decision-making approach uses agent’s current knowledge to trigger actions given its capabilities and, hence, drive individual agent behaviour. A simple approach to decision-making in ABMS is based on the generation of random numbers [128]. Bringing more rationality to the process is possible by using predefined condition/action rules where a state-machine captures also the conditions for the transitions among them [123].
The work on intentional systems [129] has influenced more complex models that try to mimic the way humans make decisions. In the belief-desire-intention (BDI) model, the information perceived, by the agent as facts, are the beliefs, and the desires and intentions represent a pool of future states the agent might reach, with the difference that an agent is only committed to working towards the intentions. Other cognitive, conceptual, and mathematical models for modelling human decision-making in ABMS are reviewed in Reference [130]. From a MAS perspective, the decision-making models have been widely studied in the context of a more complex reasoning process and they are the distinctive feature of the agent architectures. The three main classes of architectures include reactive, deliberative, and hybrid [131]. For example, the BDI models are a key reference for building deliberative architectures [132].
The interaction models drive the collective system behaviour and enable communication between agents. On top of this communication, the coordination model enables the management of interdependencies between agent’s activities [133]. The interactions between agents might happen spontaneously within the environment (e.g., in case of agents making decisions randomly) or agents might try to achieve goals rationally which requires interactions to follow a defined model. In the later case, different forms of coordination have been explored as it is an essential condition for complex collective behaviours including conflict-resolution, cooperation, organisation, collective learning, planning, control, and optimisation.
The coordination between agents can be based on direct or indirect communication. In the first case, extensive work has been done around definition of languages for communication between agents, for example, using different types of messages according to the purpose and categories of the speech acts theory [134,135]. Indirect coordination is possible when agents observe updates on the environment state produced by other agents; for example, authors of Reference [136] present a coordination model inspired in the ant colony behaviour that does not require direct agent communication. One of the main problems in coordination is consensus, i.e., agents agreement over a certain value of interest, depending on their states [137]. Consensus can be achieved, for example, by specifying rules of information exchange [138].
Different techniques for achieving coordination have been proposed. Authors of References [139,140] present a review of different approaches for coordination that include organisational structures (defined a priori by agent’s responsibilities, capabilities, connectivity, and control flow), contracting (to accomplish a set of tasks), planning (centralised or distributed plans that drive their behaviour/operation), and negotiation (seek agreement with others). In MAS literature, there is no clear distinction between negotiation and consensus. Other nature-inspired models for coordination include stigmergy (indirect coordination through, for instance, the environment), chemical coordination, physical coordination, and biochemical coordination [141]. Animal organisation has inspired models for addressing motion of agents. For example, swarms have enabled distinction of different group of agents as introduced by [107] and presented in Table 4. Figure 2 identifies some of the most common coordination models found in literature.
The environment provides the space where agents interact; it imposes constraints for their operation (e.g., boundaries) and provides resources they can consume [106]. The environment is also the place where relevant events under study happen so the agents can perceive them and consider them in their operation. Some examples of environments in ABMS include simulated geographical location [142], living organisms such as animals [143], the financial markets [144], and a product-manufacturing shop floor [111]. In MAS, the environment is usually a software platform that offers services such as communication, life-cycle management, or advertisement of agent’s services, for instance, JADE [145] or EVE [146].

3.3. Agent-Based Complex Networks

Agent-based complex networks is a research topic directly related to evolving complex networks. This proposes a new management framework where each system’s element cooperates with others towards their own individual targets, also achieving a global solution. Agent-based systems suit well at dealing with the nowadays ubiquity of sensors, smart-meters and, in general, cyber-physical systems. Thus, agent-based systems are of major importance for monitoring and controlling engineered systems. They are also straightforwardly related to the distributed information and intelligence behind to manage the Internet of Things of assets placed in a network [147,148]. Agent-based solutions have shown to be suitable for smart-grids [149,150], transportation [151,152], water distribution systems [153], and telecommunication infrastructure [154]. The works of Cardellini et al. [155], Setola et al. [156], and Iturriza et al. [157] showed how MAS are suitable to model network interdependence.
In a more-than-ever interconnected world of monitoring and controlling engineered systems, there is the emergence of cyber-attacks which are, today, an important concern for system processes functioning [158,159]. Cyber-attacks typically interfere with the supervisory control and data acquisition (SCADA) systems. In normal conditions, SCADA is ready for leading industrial automated control of systems at near real time. However, cyber-attacks target those systems misleading them and even blocking their readings while they are disguised as normal commands [160]. This directly affects the natural system performance. In gas transmission [161,162], SCADA system controls and monitors moisture, quantity, pressure, and temperature of the network of pipelines. In water distribution systems, cyber-attacks can be considered to control unexpected scenarios that can potentially produce shortages and can reduce the water quality for public consumption [163,164]. In the case of smart-grids, cyber-attacks can cause damage at connecting physical assets [165,166]. In transportation, cyber-attacks might be in the way vehicles dynamics and monitoring is collected and analysed [167]. In telecommunication systems the cyber-attacks may directly affect the network topology by line-addition, line-removal, and line-switching [168]. Also in telecommunications and mobile networks, cyber-attacks can directly inject false data in the network, spread malware, send spam, or collect information for illegal purposes [169]. Self-organised networks [170,171] and virtual network functions [172,173] aid to get an early detection and better mitigation of cyber-attacks in mobile networks [174,175].

4. Control and Optimisation of Complex Networks and Multi-Agent Systems

This section presents how MAS and complex networks have been used to address a wide set of control and optimisation problems arising in systems engineering. We particularly focus on representative applications related to manufacturing processes and critical infrastructure management. Thanks to them, we show how complex networks and MAS are able to model, control, and optimise engineering systems of main importance.

4.1. Complex Networks for Control and Optimisation

Controlling complex networks attempts to guarantee that such networks can reach a targeted performance. This is through monitoring how their state evolves on time, under a range of scenarios, and what actions are better placed to reach the aimed control. Control is also achieved through MAS, as it is stated below. However, network dynamics and topology play a key role in the success of such control process [176]. This can also be checked in the paper of Ding et al. [177], where the authors select network key-nodes to be connected to external controllers. Such key nodes can be selected by their relative importance on propagating errors/information or by their connectivity. Overall, this is a particular case of the so-called landmark nodes [178]. Landmark nodes are special nodes in the network, typically aiding to speed up internal computations such as centrality measures. This is of interest in case of dealing with large-scale networks or with near real-time operations [179,180]. For instance, in the work of Giudicciani et al. [181] landmark nodes are selected as nodes in the boundary of network communities (nodes with links connecting nodes of other community). This set of landmark nodes shows to be suitable to get faster computation of the shortest paths in addition to improving the overall management of complex networks related to critical infrastructures.
Control is naturally related to optimisation tasks. To this end, there are several works on network dynamics, topology, and design to optimise resilience [182], recovery [183], connectivity [184], performance [185], and even network control [186]. Overall, complex networks couple with MAS in many optimisation processes. Complex networks have shown to be essential to assign agents (or agents of different breeds) to network nodes depending on their importance. Still, MAS for optimisation gain the space, distance, and neighbourhood notions thanks to the complex network topology. To this end, a network of agents (likely different to the complex network aimed to be controlled or optimised) may also be necessary for an optimal activity between agents, so providing an enhanced response.

4.2. MAS Architectures for Control and Optimisation

The control architecture determines, among others, the components of the system, the responsibilities, and interactions [187]. The control architecture is tailored for each system and might include specific domain functions or entities. However, there are some common abstractions and approaches that can be reused across different problems and domains. This encompasses terminology, structure, a standard template of components and their relationships, and even examples [188]. There are three main distributed control architectural approaches: hierarchical, heterarchical, and holonic [189]. These three are briefly introduced in the following bullet points:
  • Hierarchical architectures imply components or functions are structured along two or more levels with the upper levels having broader view and influence over the lower levels [190]. They also have a command/respond communication across the levels with decision-making in the higher levels, whereas the modified hierarchical architecture shifts the command-based communication to a coordination approach where subordinates might interact with each other within a level in order to complete some of their tasks, without requiring constant instructions from a higher level [189]. Hierarchical architectures are usually rigid and lack flexibility to adapt to changes and disturbances [187].
  • Heterarchical architectures lack a direct controlling component; instead, the supervision is spread across the system and cooperatively carried out [190,191]. The key aspect is that functions are allocated in distributed entities that make decisions with a local perspective. These are autonomous entities and use communication protocols to cooperate with other peers without a central coordinator. The horizontal distribution nature of the functions implies there is no consideration of a global view, which prevents autonomous entities from reaching global optimum goals and incorporates unpredictability to the system.
  • Holonic architectures intend to overcome disadvantages of hierarchical and heterarchical approaches by offering a hybrid solution [188,189,192]. In a holonic architecture, the system is structured around “holons” (entities that are both a sub-whole from an interior perspective and a part from a system-wide point of view [193]) that can be arranged in different forms according to concrete system requirements. The generic holonic form combines distributed and centralised optimisation by enabling holons to react timely to disturbances and by considering updated local views when making decisions while operating under the view of a central coordinator holon.
MAS organisation may result in control as shown above and also in optimisation processes. This optimisation takes place thanks to distributed, local objectives of agents (or aggregation of agents) that negotiate/coordinate/cooperate with other agents (or aggregation) towards a global optimum [194].

4.3. Representative Applications

This subsection presents a number of representative applications of complex networks and agent-based control tackling key challenges in different systems engineering domains. We give special emphasis to application requirements and key architectural aspects with designs that have led to concrete implementations either of real systems or prototypes.

4.3.1. Supply Chain and Manufacturing Networks

Control of manufacturing processes is a challenging work-stream that has obtained attention from researches from both MAS and complex networks. The production processes incorporate heterogeneity of functions, goods, workflows, work products (i.e., orders), and resources that are usually constrained and require efficient utilisation while ensuring the quality of the end products. Several solutions have been proposed to manage and control production of goods in shop floors [192,195,196,197,198,199,200]. The key control requirements cover scheduling, simultaneous processing or orders, quality assurance, real-time customisation, and context-aware servicing and maintenance. These requirements can only be met by flexible and agile factories able to reconfigure and adapt to changes, even at late stages of the manufacturing process. The need of a supervision function aligned with this dynamics is implicit to these requirements.
  • Complex networks: Supply chain and manufacturing processes have a proper research avenue within a network science framework [201]. To this end, simplistic chain models can be approached by complex systems allowing, for instance, a deeper interpretation of the relationship between different supply actors [202]. The paper of Hearnshaw et al. [203] is a pivotal work on supply chain network theory where complex network developments are shown to be a useful working environment. There also are specific applications, as it is the analysis of supply chains for the aerospace industry [29]. Complex networks make, then, possible to extract useful information such as nonlinear pathways between firms, geographic locations and industrial-sectors communities, and connectivity hub firms.
  • MAS: In the last two decades, distributed approaches have gained attention, becoming a solid alternative to monolithic architectures [204,205]. Together, holonic manufacturing systems (HMS) and multi-agent systems help to overcome the limitations of the centralised approaches such as lack of flexibility, agility, dynamics and reconfiguration features [198]. In HMS, the scheduling is intended to be realised from the cooperative interaction of holons while ensuring that global factory concerns are addressed, sometimes, with some degree of central coordination [192]. The agent notion has been used as both a solution domain abstraction and its corresponding software. When used as software building blocks, agents complement broader engineering concepts such as holon [206], intelligent products [207,208], and self-service assets [199].

4.3.2. Electricity Power Grids

Electrical power is essential for basic services such as providing lighting, heating, cooling, and refrigeration in the built environment. Computers, mobile phones, and other domestic appliances use electrical power. Electricity is generated at power plants and moves through a complex system called the “grid”. The grid is made of electricity substations, transformers, and power lines that connect electricity load from source providers to users.
  • Complex networks: Electrical power grids can be considered complex networks [209]. The nodes are power plants and distributing and transmission substations [210]. The links are the power lines which may have different voltage (see Table 1). At the urban level, grids often become a higher inter-connectivity system aiming to get reliability in the supply. Smart grids [211] enhance the traditional electricity supply by adding digital technology which allows utilities and customers to receive information from and to communicate with the grid. This benefits optimal energy generation, electricity and meter-reading cost, and reliability in case of interruptions and blackouts [212]. The work of Das et al. [213] shows how topological, physical, and electrical features of a power grid provide complementary information. As a consequence, all of such features should be considered further to better address near real-time challenges in power grids.
  • MAS: Smart grids have been widely supported by SCADA systems. However, other distributed approaches have been used to overcome limitations of traditional supervisory control systems [214]. Particularly, multi-agent systems have become an enabler of distributed control for the power systems, providing some of the supervision functions without a hierarchical or central supervisor. The requirements for control in power systems include reliability, economic efficiency, and capacity to support from individuals to large industrial customers. Some of the problems addressed include market operations, time-sensitive control, service restoration, and system evolution/flexibility. The authors of References [215,216] present a solution to improve, in real time, the energy market performance with a large number of multiple production and consumption units, each one with different objectives. Based on an auction model, agents use a price vector to gather the quantity of bids for a particular energy demand, and this enables them to decide on the supplier considering the global desire [216]. A similar approach is presented in Reference [217], where a distributed architecture with a single control layer and multiple distributed agents is organised around a set of central facilities.

4.3.3. Transportation Systems

A transportation system is a spatial network which permits either vehicular movement, flow of people, or products supply. The transportation system comprises transport infrastructure, vehicles, and equipment. This should also be considered the transportation assets operation and service to the end-user. This is of main importance for society development and well-being as millions of citizens worldwide use transportation systems on a daily basis.
  • Complex networks: Instances of transportation systems are such important infrastructures as roads and streets, railways, and airline networks. All of them are organised in network patterns [218,219] (see Table 1). For instance, by considering urban streets and roads, it is possible to take segments of these routes as links. The intersections and ends are considered as nodes [220,221,222]. Another example is the associated network to a city underground transit as shown in Figure 3, where the nodes represent the metro-stations and the links are the train lines connecting such stations. Some of the most common issues in transportation and communication systems are related to link and node congestion [223] in a network which often have a scale-free topology.
  • MAS: Smart transportation systems [224] also named intelligent transport systems aim to achieve traffic efficiency by minimising their associated issues such as traffic congestion [225]. Having real-time data of the network status, it is possible to release traffic alert messages and public safety messages. Associated with the concept of smart transportation systems comes the idea of smart, resilient, and energy efficient cities. Baronti et al. [226] proposed an integration of energy storage systems for the smart transportation and the smart grid. A distributed hierarchical approach for control of automated highways is presented in Reference [227]. The architecture is based on a hierarchical control where supervision functions are distributed among four layers. Two layers (network and link) are in the roadside, and two other layers (coordination and regulation) are in the vehicle.

4.3.4. Water Distribution Systems

Water supply services are naturally related to food availability, health, and hygiene. However, they are also key for energy, manufacturing, and other fundamental services. Drinking water comes from reservoirs from which water flows through pressurised pipes to tanks (to storage water for daily supply operations in small urban areas) and demand points. The risks in water distribution systems are associated with pipe bursts, contamination events, and lack of resources during drought periods that are usually of high demand. These events can cause socioeconomic losses but also directly affect the citizen health and well-being.
  • Complex networks: Water distribution systems can be considered as complex networks where nodes are water sources and demand points and links are water pipes, valves, and pump stations [228] (see Table 1). The works of Herrera et al. [229] and di Nardo et al. [230] present instances on how complex network analyses provide useful approaches for the operation and management of water distribution systems. Features and positions of valves and pumps have special relevance for the global water network performance. Smart water networks extend the traditional water distribution system elements by including assets such as sensors and flow-meters, providing information of the network performance. Among other advantages, Candelieri et al. [231] highlighted that the cyber-physical water system is key for more efficient water distribution network management, hydraulic performance, and optimised network protection [164].
  • MAS: Water networks are heterogeneous, ranging from ad hoc farm irrigation systems to critical water infrastructures. The authors of Reference [232] use agent-based modelling to sample large size water supply networks graphs and, then, to propose their further division into district metered areas for management purposes. Similar work is found in References [233,234]. From an asset management point of view, it is worth mentioning the work of Ayala-Cabrera et al. [235] since the authors use an agent-based system to locate and classify buried pipes. Authors of Reference [236] propose an architecture based on a SCADA system that uses model predictive controller (MPC) [237] techniques for controlling an automatic water canal. A key contribution of this architecture is to extend the standard SCADA system with capabilities for complex mathematical processing via a dynamic data exchange (DDE) protocol.

4.3.5. Gas Transmission

Gas supply is essential for heating, hygiene, and cooking food. The gas is transported by high-pressure transmission pipelines from the production facility to the entry point (gate station) of the distribution network. The transmission systems are made by high-pressure pipelines, compressor stations, and storage facilities among other elements. From the gate station, natural gas moves into distribution lines towards users at home. The distribution network consists of smaller distribution pipes which typically supply urban areas. Each distribution system is connected to the higher pressure transmission system at a pressure reduction station.
  • Complex networks: Pipelines for gas transmission can be considered a complex network [238]. Gas pipelines and compressor stations are network-links, and underground storage systems and gas stations are network nodes (see Table 1). Smart gas grids are controlled near real time to meet the time-varying gas demand and to interact with the electrical power smart grid [239]. In this regard, Bliek et al. [240] pictured an ideal smart gas grid as the one that is able to communicate with the smart electric power grid for an improved energy distribution. Brown et al. [241] also pointed out the smart grid capacity to transport nonconventional gases such as biogas or syngas.
  • MAS: The authors of Reference [242] introduce a holonic architecture for the control of continuous production complexes. They work with the case of oil production, where various complex processes take place involving extraction, transportation, treatment, and delivery of oil and secondary products (e.g., gas). Holons are linked to production groups that are a specialisation of production units (PU) representing oil wells or flow stations [188]. The PUs aggregate orders, resources, and a component of process supervision and control. The supervisory layer carries out standard functions of measurement, identify state changes on discrete process, and update the state. Holons are implemented with temporary agent programs (TAP) that negotiate to accept mission assignments. A supervisor agent determines the production method to apply for achieving the missions and requests for external resources to other PUs.
An example of the interdependence between the electric power network and the natural gas system is shown in Figure 4. Several elements for the gas transmission such as PUs and pipeline compressors directly rely on the electricity supply.

5. Discussion and Research Directions

Advances in complex network analysis have boosted their ability to represent more realistic examples of real cases. For instance, there have been important developments on weighted networks [244] and networks with time-varying characteristics and topology [245]. Multiscale complex networks [246] and networks of networks [247] have been recently a very active research topic. Along with the essentials, the current paper already introduced highly advanced methods in complex networks, MAS, and their combination. However, there are some methods and technologies of particular interest, having the potential of becoming main topics in future research. This section highlights important insights and research avenues.

5.1. Discussion

This paper presents a comprehensive review of complex networks and MAS. Both are of main importance for control and optimisation in systems engineering. Therefore, one of the main contributions of this review is the emphasis on real-world systems such as critical infrastructures, manufacturing processes, and supply chain networks. In all cases, complex networks and MAS have shown to be essential for their control and optimisation. In a world where society and systems are more connected than ever, it highlights the importance to analyse how such systems are related between themselves and how their optimal management provide further socioeconomical benefits. This is the case of interconnected infrastructures such as electricity and gas, or telecommunications and transport. Still, there is a emergence of research directly focused on hybrid systems development. In contrast to systems interconnection, hybrid systems naturally ensemble two or more systems into a new one that cannot be understood without the others. This is the case of electricity and transport networks [248], both directly converging for the management of electric bus fleets in metropolitan areas [249]. Another example is the novel concept for water distribution systems integrated into urban smart grids for energy recovery and production [250]. On top of this, any engineering system (single, interconnected, or hybrid) may be considered to have several levels of domain. That is, a physical system (already having several levels if it is an interconnected or a hybrid system) is often coupled with a control system (hardware–software system that can be designed as MAS and organised as a network). Another way to understand additional domain levels of a system is by including the level related to the workforce networkas well as the customers network. We can also combine all of the previously mentioned possibilities. In all the cases, the literature review presented herein represents the fundamentals for the optimal management of these systems, their optimal control and optimisation, and their coordination approaches. The following section shows the foreseen work directions in complex networks and MAS in conjunction with emerging technologies.

5.2. Future Methodology Developments

Applied complex networks to systems engineering should come with developments at multiscale, dynamic, and multidimensional systems. On top of this, MAS will play an essential role providing these networks intelligence in their network flow, evolution, and protection (self-healing, resilient design, and so on). Both complex networks and MAS should be integrated in a process in which distributed, networked agents agree in a common objective for optimal systems control and decision making. There is, then, a need for a consensual dynamics in complex networks, working with the streams of time series varying over time [251] and how the agents can reach a consensus at near real time is a research avenue regarding the methodology development as well as the applications. The rest of the section describes other main research challenges for complex networks and MAS in systems engineering.

5.2.1. Complex Networks

  • Time series in networks: Temporal networks might well be understood as the study on how network topology and features vary over time. Some approaches use multilayer networks to represent as many layers as time units capturing the network status variations through snapshots at each time. This research framework being relatively new, it should be developed further by conducting proper analysis on the streams of time series data associated to complex networks, that is, through the analysis of the temporal evolution of such streams and how it has an impact on the very network structure and performance. As a consequence, future research will be about statistics and inference in dynamic graphs [252]. The challenge may be extended further to the more general framework of machine learning in networks.
  • Graph convolutional neural networks: Convolutional neural networks (CNN) have been mainly focused so far on image analysis. A series of convolutional filters and pooling layers are imposed over the matrix representing such images. The process ends with a layer where the actual learning and the image approached, for instance, is classified. However, there is an emergence of the so-called geometric deep learning in which the CNN input is a manifold or graph-structured data [253]. In the case of CNN over graphs, the input can be the adjacency or the Laplacian matrices associated to such a graph. Then, the learning is similar to the developed for study images since the image input is also a matrix. There is ample room for research on graph-CNN on the analysis of (evolving) complex networks representing engineering systems [254].

5.2.2. Multi-Agent Systems

  • Big data and calibration of ABMS: The validity of agent-based models is given by the real data and theories it uses to base behaviour of agents in the model. Thanks to the wide spreading of sensors, we are experiencing an increased ability to capture huge amounts of data related to physical properties from living/active entities. These data can set the basis for modelling, validation, and calibration of agent-based models across different scientific disciplines. A key challenge is how to process these data effectively while providing feedback to the model. The use of supervised, unsupervised, and semi-supervised learning techniques can produce new methods for model calibration, for example, by enabling classification and comparison of key features of the model within a particular observation window or by easing the definition of baselines for predicted behaviours across the model [255,256].
  • Breaking down learning phase with MAS: This future research highlights the problem of agent breeds learning to teach other agents within an MAS environment. The initial efforts have been via reinforcement learning [257] in which each agent takes the role of student or teacher, requesting and providing advice, respectively, at the appropriate moments looking forward an improved overall system performance [258]. There is a number of further challenges coming from this approach to deal with complex domains for real-world applications.

5.3. Future Applications in Systems Engineering

Advances on complex networks and MAS consequently lead to advances further in their applications for systems engineering. There are foreseen some key applications as a potential breakthrough in systems engineering briefly introduced in the following bullet points.
  • Cyber-physical systems (CPSs): CPSs are representations of physical, spatially distributed systems into a network of sensors and actuators leading to a suitable monitor and control of the system processes. The final aim is to reach optimal decision-making over the system for their optimal management. There are emerging challenges for CPSs to address further in which MAS and complex networks will play a significant role. For instance, in industrial systems such as smart electric grids, there is a need of decentralised, adaptive CPSs framework towards their operative automation and optimal performance [259]. Other systems may also benefit from the use of MAS and complex networks over their CPSs, from smart manufacturing and logistics [260] to food supply chain systems [261].
  • Digital twins (DT): DTs are a digital replica of physical assets and engineering systems taking into account their internal functioning and external processes that may affect their performance. Working with digital twins, it is possible to test in advance systems performance under any regular or anomalous scenario to aid the decision-making process and to accurately foresee further systems issues. One of the key challenges for future digital twins is on increasing their dimensionality and complexity. This will make necessary to create a new generation of systems engineering modelling systems relationships and interdependencies at large scale. To accomplish this challenge, it will be necessary to combine a set of relevant methods such as complex networks, MAS and visualisation processes, among others [262].
  • Blockchain technologies: Blockchain is a global ledger that records transactions on a chain of blocks. Within a complex network framework, these blocks can be expressed as network nodes while transactions are network links representing the exchanges between nodes. Future research will be based on temporal and dynamic complex networks to model and analyse blockchain technologies. Still, as the information flow is passing through the network, agent-based systems will also have a key role in synchronisation and network control tasks [263]. Furthermore, blockchain technologies offer a truly decentralised environment where new network dynamics and coordination models are emerging facilitating distribution artificial intelligent processes [264].

Author Contributions

The authors equally contributed to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the EPSRC and BT Prosperity Partnership project: Next Generation Converged Digital Infrastructure, grant number EP/R004935/1.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Blanchard, B.S. System Engineering Management; John Wiley & Sons: Hoboken, NJ, USA, 2004. [Google Scholar]
  2. Strogatz, S.H. Exploring complex networks. Nature 2001, 410, 268. [Google Scholar] [CrossRef] [Green Version]
  3. Latora, V.; Nicosia, V.; Russo, G. Complex Networks: Principles, Methods and Applications; Cambridge University Press: Cambridge, UK, 2017. [Google Scholar]
  4. Wood, M.F.; DeLoach, S.A. An overview of the multiagent systems engineering methodology. In International Workshop on Agent-Oriented Software Engineering; Springer: Berlin, Germany, 2000; pp. 207–221. [Google Scholar]
  5. Wooldridge, M. An Introduction to Multiagent Systems; John Wiley & Sons: Hoboken, NJ, USA, 2009. [Google Scholar]
  6. Winkler, J.; Dueñas-Osorio, L.; Stein, R.; Subramanian, D. Interface network models for complex urban infrastructure systems. J. Infrastruct. Syst. 2011, 17, 138–150. [Google Scholar] [CrossRef] [Green Version]
  7. Nekovee, M.; Moreno, Y.; Bianconi, G.; Marsili, M. Theory of rumour spreading in complex social networks. Phys. A Stat. Mech. Appl. 2007, 374, 457–470. [Google Scholar] [CrossRef] [Green Version]
  8. Wong, A.S.; Huck, W.T. Grip on complexity in chemical reaction networks. Beilstein J. Org. Chem. 2017, 13, 1486–1497. [Google Scholar] [CrossRef] [PubMed]
  9. Gosak, M.; Markovič, R.; Dolenšek, J.; Rupnik, M.S.; Marhl, M.; Stožer, A.; Perc, M. Network science of biological systems at different scales: A review. Phys. Life Rev. 2018, 24, 118–135. [Google Scholar] [CrossRef]
  10. Demazeau, Y.; Müller, J.P. Decentralized AI; Elsevier: Amsterdam, The Netherlands, 1990. [Google Scholar]
  11. van Steen, M.; Tanenbaum, A.S. A brief introduction to distributed systems. Computing 2016, 98, 967–1009. [Google Scholar] [CrossRef] [Green Version]
  12. Yang, T.; Yi, X.; Wu, J.; Yuan, Y.; Wu, D.; Meng, Z.; Hong, Y.; Wang, H.; Lin, Z.; Johansson, K.H. A survey of distributed optimization. Annu. Rev. Control 2019, 47, 278–305. [Google Scholar] [CrossRef]
  13. Huet, S.; Dumoulin, N.; Deffuant, G. A Calibration to Properly Design a Model Integrating Residential Mobility and Migration in a Rural Area. In Advances in Social Simulation 2015; Springer: Berlin, Germany, 2017; pp. 163–179. [Google Scholar]
  14. Charyyev, B.; Gunes, M.H. Complex network of United States migration. Comput. Soc. Netw. 2019, 6, 1. [Google Scholar] [CrossRef]
  15. Jin, X.; Li, J.; Zhang, L. Online social networks based on complex network theory and simulation analysis. In Proceedings of the 4th International Conference on Computer Engineering and Networks; Springer: Berlin, Germany, 2015; pp. 1129–1138. [Google Scholar]
  16. Del Vicario, M.; Bessi, A.; Zollo, F.; Petroni, F.; Scala, A.; Caldarelli, G.; Stanley, H.E.; Quattrociocchi, W. The spreading of misinformation online. Proc. Natl. Acad. Sci. USA 2016, 113, 554–559. [Google Scholar] [CrossRef] [Green Version]
  17. Manuel, P. Computational aspects of carbon and boron nanotubes. Molecules 2010, 15, 8709–8722. [Google Scholar] [CrossRef]
  18. Obrovac, M. Chemical Computing for Distributed Systems: Algorithms and Implementation. Ph.D. Thesis, Université Rennes 1, Rennes, France, 2013. [Google Scholar]
  19. Hinkelmann, F.; Murrugarra, D.; Jarrah, A.S.; Laubenbacher, R. A mathematical framework for agent based models of complex biological networks. Bull. Math. Biol. 2011, 73, 1583–1602. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  20. Feinerman, O.; Korman, A. Theoretical distributed computing meets biology: A review. In International Conference on Distributed Computing and Internet Technology; Springer: Berlin, Germany, 2013; pp. 1–18. [Google Scholar]
  21. Zhao, J.; Yu, H.; Luo, J.; Cao, Z.; Li, Y. Complex networks theory for analyzing metabolic networks. Chin. Sci. Bull. 2006, 51, 1529–1537. [Google Scholar] [CrossRef] [Green Version]
  22. Borer, B.; Ataman, M.; Hatzimanikatis, V.; Or, D. Modeling metabolic networks of individual bacterial agents in heterogeneous and dynamic soil habitats (IndiMeSH). PLoS Comput. Biol. 2019, 15, e1007127. [Google Scholar] [CrossRef] [PubMed]
  23. Morstyn, T.; Hredzak, B.; Agelidis, V.G. Network topology independent multi-agent dynamic optimal power flow for microgrids with distributed energy storage systems. IEEE Trans. Smart Grid 2016, 9, 3419–3429. [Google Scholar] [CrossRef]
  24. Kiesling, E.; Günther, M.; Stummer, C.; Wakolbinger, L.M. Agent-based simulation of innovation diffusion: A review. Cent. Eur. J. Oper. Res. 2012, 20, 183–230. [Google Scholar] [CrossRef]
  25. Nair, A.S.; Hossen, T.; Campion, M.; Selvaraj, D.F.; Goveas, N.; Kaabouch, N.; Ranganathan, P. Multi-Agent Systems for Resource Allocation and Scheduling in a Smart Grid. Technol. Econ. Smart Grids Sustain. Energy 2018, 3, 15. [Google Scholar] [CrossRef] [Green Version]
  26. Bollobás, B. Modern Graph Theory; Springer Science & Business Media: Berlin, Germany, 2013; Volume 184. [Google Scholar]
  27. Bornholdt, S.; Schuster, H.G. Handbook of Graphs and Networks: From the Genome to the Internet; John Wiley & Sons: Hoboken, NJ, USA, 2006. [Google Scholar]
  28. Scott, J. Social Network Analysis; Sage: Thousand Oaks, CA, USA, 2017. [Google Scholar]
  29. Brintrup, A.; Wang, Y.; Tiwari, A. Supply networks as complex systems: A network-science-based characterization. IEEE Syst. J. 2015, 11, 2170–2181. [Google Scholar] [CrossRef] [Green Version]
  30. Guimera, R.; Amaral, L.A.N. Functional cartography of complex metabolic networks. Nature 2005, 433, 895. [Google Scholar] [CrossRef] [Green Version]
  31. Zio, E. From complexity science to reliability efficiency: A new way of looking at complex network systems and critical infrastructures. Int. J. Crit. Infrastruct. 2007, 3, 488–508. [Google Scholar] [CrossRef]
  32. Erdos, P.; Rényi, A. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 1960, 5, 17–60. [Google Scholar]
  33. Watts, D.J.; Strogatz, S.H. Collective dynamics of ’small-world’ networks. Nature 1998, 393, 440. [Google Scholar] [CrossRef] [PubMed]
  34. Barabási, A.L. Scale-free networks: A decade and beyond. Science 2009, 325, 412–413. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  35. Viana, M.P.; Strano, E.; Bordin, P.; Barthelemy, M. The simplicity of planar networks. Sci. Rep. 2013, 3, 3495. [Google Scholar] [CrossRef] [PubMed]
  36. Boeing, G. Planarity and street network representation in urban form analysis. Environ. Plan. B Urb. Anal. City Sci. 2018. [Google Scholar] [CrossRef] [Green Version]
  37. Diet, A.; Barthelemy, M. Towards a classification of planar maps. Phys. Rev. E 2018, 98, 062304. [Google Scholar] [CrossRef] [Green Version]
  38. Strano, E.; Nicosia, V.; Latora, V.; Porta, S.; Barthélemy, M. Elementary processes governing the evolution of road networks. Sci. Rep. 2012, 2, 296. [Google Scholar] [CrossRef] [Green Version]
  39. Giudicianni, C.; Di Nardo, A.; Di Natale, M.; Greco, R.; Santonastaso, G.F.; Scala, A. Topological taxonomy of water distribution networks. Water 2018, 10, 444. [Google Scholar] [CrossRef] [Green Version]
  40. Bowden, R.; Nguyen, H.X.; Falkner, N.; Knight, S.; Roughan, M. Planarity of data networks. In Proceedings of the IEEE 2011 23rd International Teletraffic Congress (ITC), San Francisco, CA, USA, 6–9 Septemebr 2011; pp. 254–261. [Google Scholar]
  41. Nussbaum, Y. Network Flow Problems in Planar Graphs. Ph.D. Thesis, Tel-Aviv University, Tel-Aviv, Israel, 2014. [Google Scholar]
  42. Girvan, M.; Newman, M.E. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 2002, 99, 7821–7826. [Google Scholar] [CrossRef] [Green Version]
  43. Rieckmann, J.C.; Geiger, R.; Hornburg, D.; Wolf, T.; Kveler, K.; Jarrossay, D.; Sallusto, F.; Shen-Orr, S.S.; Lanzavecchia, A.; Mann, M.; et al. Social network architecture of human immune cells unveiled by quantitative proteomics. Nat. Immunol. 2017, 18, 583. [Google Scholar] [CrossRef]
  44. Kurvers, R.H.; Krause, J.; Croft, D.P.; Wilson, A.D.; Wolf, M. The evolutionary and ecological consequences of animal social networks: emerging issues. Trends Ecol. Evol. 2014, 29, 326–335. [Google Scholar] [CrossRef]
  45. Brentan, B.; Campbell, E.; Goulart, T.; Manzi, D.; Meirelles, G.; Herrera, M.; Izquierdo, J.; Luvizotto, E., Jr. Social Network Community Detection and Hybrid Optimization for Dividing Water Supply into District Metered Areas. J. Water Resour. Plan. Manag. 2018, 144, 04018020. [Google Scholar] [CrossRef] [Green Version]
  46. Palau, A.S.; Liang, Z.; Lütgehetmann, D.; Parlikad, A.K. Collaborative prognostics in Social Asset Networks. Future Gener. Comput. Syst. 2019, 92, 987–995. [Google Scholar] [CrossRef] [Green Version]
  47. Prokhorenkova, L.O.; Prałat, P.; Raigorodskii, A. Modularity of complex networks models. In International Workshop on Algorithms and Models for the Web-Graph; Springer: Berlin, Germany, 2016; pp. 115–126. [Google Scholar]
  48. Lee, S.H.; Cucuringu, M.; Porter, M.A. Density-based and transport-based core-periphery structures in networks. Phys. Rev. E 2014, 89, 032810. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  49. Verma, T.; Russmann, F.; Araújo, N.; Nagler, J.; Herrmann, H.J. Emergence of core–peripheries in networks. Nat. Commun. 2016, 7, 10441. [Google Scholar] [CrossRef]
  50. Opsahl, T.; Agneessens, F.; Skvoretz, J. Node centrality in weighted networks: Generalizing degree and shortest paths. Soc. Netw. 2010, 32, 245–251. [Google Scholar] [CrossRef]
  51. Freeman, L.C. A set of measures of centrality based on betweenness. Sociometry 1977, 35–41. [Google Scholar] [CrossRef]
  52. Wuchty, S.; Stadler, P.F. Centers of complex networks. Theor. Biol. 2003, 223, 45–53. [Google Scholar] [CrossRef] [Green Version]
  53. Bonacich, P. Factoring and weighting approaches to status scores and clique identification. Math. Soc. 1972, 2, 113–120. [Google Scholar] [CrossRef]
  54. Brin, S.; Page, L. Reprint of: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. 2012, 56, 3825–3833. [Google Scholar] [CrossRef]
  55. Katz, L. A new status index derived from sociometric analysis. Psychometrika 1953, 18, 39–43. [Google Scholar] [CrossRef]
  56. Serrano Moral, M.; Boguñá, M. Clustering in complex networks. I. General formalism. Phys. Rev. E 2006, 74, 056114-1–056114-9. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  57. Suchecki, K.; Eguíluz, V.M.; San Miguel, M. Voter model dynamics in complex networks: Role of dimensionality, disorder, and degree distribution. Phys. Rev. E 2005, 72, 036132. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  58. Noldus, R.; Van Mieghem, P. Assortativity in complex networks. J. Complex Netw. 2015, 3, 507–542. [Google Scholar] [CrossRef] [Green Version]
  59. Albert, R.; Barabási, A.L. Statistical mechanics of complex networks. Rev. Mod. Phys. 2002, 74, 47. [Google Scholar] [CrossRef] [Green Version]
  60. Gao, J.; Barzel, B.; Barabási, A.L. Universal resilience patterns in complex networks. Nature 2016, 530, 307. [Google Scholar] [CrossRef]
  61. Stauffer, D.; Aharony, A. Introduction to Percolation Theory: Revised Second Edition; CRC Press: Boca Raton, FL, USA, 2014. [Google Scholar]
  62. Li, D.; Zhang, Q.; Zio, E.; Havlin, S.; Kang, R. Network reliability analysis based on percolation theory. Reliab. Eng. Syst. Saf. 2015, 142, 556–562. [Google Scholar] [CrossRef] [Green Version]
  63. Gao, J.; Liu, X.; Li, D.; Havlin, S. Recent progress on the resilience of complex networks. Energies 2015, 8, 12187–12210. [Google Scholar] [CrossRef] [Green Version]
  64. Chen, X.G. A novel reliability estimation method of complex network based on Monte Carlo. Clust. Comput. 2017, 20, 1063–1073. [Google Scholar] [CrossRef]
  65. Kroese, D.P.; Brereton, T.; Taimre, T.; Botev, Z.I. Why the Monte Carlo method is so important today. Wiley Interdiscip. Rev. Comput. Stat. 2014, 6, 386–392. [Google Scholar] [CrossRef]
  66. Newman, M.E.; Ziff, R.M. Fast Monte Carlo algorithm for site or bond percolation. Phys. Rev. E 2001, 64, 016706. [Google Scholar] [CrossRef] [Green Version]
  67. Li, D.; Fu, B.; Wang, Y.; Lu, G.; Berezin, Y.; Stanley, H.E.; Havlin, S. Percolation transition in dynamical traffic network with evolving critical bottlenecks. Proc. Natl. Acad. Sci. USA 2015, 112, 669–672. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  68. Carvalho, R.; Buzna, L.; Bono, F.; Masera, M.; Arrowsmith, D.K.; Helbing, D. Resilience of natural gas networks during conflicts, crises and disruptions. PLoS ONE 2014, 9, e90265. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  69. Torres, J.M.; Duenas-Osorio, L.; Li, Q.; Yazdani, A. Exploring topological effects on water distribution system performance using graph theory and statistical models. J. Water Resour. Plan. Manag. 2016, 143, 04016068. [Google Scholar] [CrossRef]
  70. Facchini, A.; Scala, A.; Lattanzi, N.; Caldarelli, G.; Liberatore, G.; Dal Maso, L.; Di Nardo, A. Complexity science for sustainable smart water grids. In Italian Workshop on Artificial Life and Evolutionary Computation; Springer: Berlin, Germany, 2016; pp. 26–41. [Google Scholar]
  71. Chen, Y.; Li, Y.; Li, W.; Wu, X.; Cai, Y.; Cao, Y.; Rehtanz, C. Cascading Failure Analysis of Cyber Physical Power System with Multiple Interdependency and Control Threshold. IEEE Access 2018, 6, 39353–39362. [Google Scholar] [CrossRef]
  72. Hui, K.P. Monte Carlo network reliability ranking estimation. IEEE Trans. Reliab. 2007, 56, 50–57. [Google Scholar] [CrossRef]
  73. Piraveenan, M.; Prokopenko, M.; Hossain, L. Percolation centrality: Quantifying graph-theoretic impact of nodes during percolation in networks. PLoS ONE 2013, 8, e53095. [Google Scholar] [CrossRef] [Green Version]
  74. Liao, H.; Mariani, M.S.; Medo, M.; Zhang, Y.C.; Zhou, M.Y. Ranking in evolving complex networks. Phys. Rep. 2017, 689, 1–54. [Google Scholar] [CrossRef] [Green Version]
  75. Morone, F.; Makse, H.A. Influence maximization in complex networks through optimal percolation. Nature 2015, 524, 65. [Google Scholar] [CrossRef] [Green Version]
  76. Lü, L.; Chen, D.; Ren, X.L.; Zhang, Q.M.; Zhang, Y.C.; Zhou, T. Vital nodes identification in complex networks. Phys. Rep. 2016, 650, 1–63. [Google Scholar] [CrossRef] [Green Version]
  77. Jalili, M.; Yu, X. Enhancement of synchronizability in networks with community structure through adding efficient inter-community links. IEEE Trans. Netw. Sci. Eng. 2016, 3, 106–116. [Google Scholar] [CrossRef]
  78. Jalili, M.; Perc, M. Information cascades in complex networks. J. Complex Netw. 2017, 5, 665–693. [Google Scholar] [CrossRef]
  79. Chen, D.; Lü, L.; Shang, M.S.; Zhang, Y.C.; Zhou, T. Identifying influential nodes in complex networks. Phys. A Stat. Mech. Appl. 2012, 391, 1777–1787. [Google Scholar] [CrossRef] [Green Version]
  80. Lawyer, G. Understanding the influence of all nodes in a network. Sci. Rep. 2015, 5, 8665. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  81. Zhang, Z.K.; Liu, C.; Zhan, X.X.; Lu, X.; Zhang, C.X.; Zhang, Y.C. Dynamics of information diffusion and its applications on complex networks. Phys. Rep. 2016, 651, 1–34. [Google Scholar] [CrossRef] [Green Version]
  82. Loecher, M.; Kadtke, J. Critical Infrastructures, Scale-Free~ Networks, and the Hierarchical Cascade of Generalized Epidemics. In Applications of Nonlinear Dynamics; Springer: Berlin, Germany, 2009; pp. 211–223. [Google Scholar]
  83. Dai, X.; Hu, M.; Tian, W.; Xie, D.; Hu, B. Application of Epidemiology Model on Complex Networks in Propagation Dynamics of Airspace Congestion. PLoS ONE 2016, 11, e0157945. [Google Scholar] [CrossRef]
  84. Pastor-Satorras, R.; Castellano, C.; Van Mieghem, P.; Vespignani, A. Epidemic processes in complex networks. Rev. Mod. Phys. 2015, 87, 925. [Google Scholar] [CrossRef] [Green Version]
  85. Bardet, J.P.; Little, R. Epidemiology of urban water distribution systems. Water Resour. Res. 2014, 50, 6447–6465. [Google Scholar] [CrossRef]
  86. Ding, L.; Li, K.; Zhou, Y.; Love, P.E. An IFC-inspection process model for infrastructure projects: Enabling real-time quality monitoring and control. Autom. Construct. 2017, 84, 96–110. [Google Scholar] [CrossRef]
  87. Barrat, A.; Barthelemy, M.; Vespignani, A. Dynamical Processes on Complex Networks; Cambridge University Press: Cambridge, UK, 2008. [Google Scholar]
  88. Kim, H.; Anderson, R. Temporal node centrality in complex networks. Phys. Rev. E 2012, 85, 026107. [Google Scholar] [CrossRef] [Green Version]
  89. Braha, D.; Bar-Yam, Y. From centrality to temporary fame: Dynamic centrality in complex networks. Complexity 2006, 12, 59–63. [Google Scholar] [CrossRef] [Green Version]
  90. Shekhtman, L.M.; Danziger, M.M.; Havlin, S. Recent advances on failure and recovery in networks of networks. Chaos Solitons Fractals 2016, 90, 28–36. [Google Scholar] [CrossRef] [Green Version]
  91. Kivelä, M.; Arenas, A.; Barthelemy, M.; Gleeson, J.P.; Moreno, Y.; Porter, M.A. Multilayer networks. J. Complex Netw. 2014, 2, 203–271. [Google Scholar] [CrossRef] [Green Version]
  92. Choi, J.H.; Vishwanathan, S. DFacTo: Distributed factorization of tensors. In Advances in Neural Information Processing Systems; NIPS: Montréal, Canada; pp. 1296–1304.
  93. De Domenico, M.; Solé-Ribalta, A.; Cozzo, E.; Kivelä, M.; Moreno, Y.; Porter, M.A.; Gómez, S.; Arenas, A. Mathematical formulation of multilayer networks. Phys. Rev. X 2013, 3, 041022. [Google Scholar] [CrossRef] [Green Version]
  94. Rahmede, C.; Iacovacci, J.; Arenas, A.; Bianconi, G. Centralities of nodes and influences of layers in large multiplex networks. J. Complex Netw. 2018, 6, 733–752. [Google Scholar] [CrossRef] [Green Version]
  95. Gomez, S.; Diaz-Guilera, A.; Gomez-Gardenes, J.; Perez-Vicente, C.J.; Moreno, Y.; Arenas, A. Diffusion dynamics on multiplex networks. Phys. Rev. Lett. 2013, 110, 028701. [Google Scholar] [CrossRef] [Green Version]
  96. Zhao, D.; Li, L.; Peng, H.; Luo, Q.; Yang, Y. Multiple routes transmitted epidemics on multiplex networks. Phys. Lett. A 2014, 378, 770–776. [Google Scholar] [CrossRef] [Green Version]
  97. De Domenico, M.; Granell, C.; Porter, M.A.; Arenas, A. The physics of spreading processes in multilayer networks. Nat. Phys. 2016, 12, 901–906. [Google Scholar] [CrossRef] [Green Version]
  98. Cellai, D.; López, E.; Zhou, J.; Gleeson, J.P.; Bianconi, G. Percolation in multiplex networks with overlap. Phys. Rev. E 2013, 88, 052811. [Google Scholar] [CrossRef] [Green Version]
  99. Osat, S.; Faqeeh, A.; Radicchi, F. Optimal percolation on multiplex networks. Nat. Commun. 2017, 8, 1540. [Google Scholar] [CrossRef] [Green Version]
  100. He, W.; Chen, G.; Han, Q.L.; Du, W.; Cao, J.; Qian, F. Multiagent systems on multilayer networks: Synchronization analysis and network design. IEEE Trans. Syst. Man Cybern. Syst. 2017, 47, 1655–1667. [Google Scholar] [CrossRef]
  101. Milanović, J.V.; Zhu, W. Modeling of Interconnected Critical Infrastructure Systems Using Complex Network Theory. IEEE Trans. Smart Grid 2018, 9, 4637–4648. [Google Scholar] [CrossRef]
  102. Konolige, K.; Nilsson, N.J. Multiple-agent planning systems. Proc. AAAI 1980, 80, 138–142. [Google Scholar]
  103. Cammarata, S.; McArthur, D.; Skeeb, R. Strategies of Cooperation in Distributed Problem Solving; Technical Report; The Defense Advanced Research Projects Agency: Arlington, VI, USA, 1983.
  104. Nwana, H.S. Software agents: An overview. Knowl. Eng. Rev. 1996, 11, 205. [Google Scholar] [CrossRef]
  105. Macal, C.M.; North, M.J. Agent-based modeling and simulation. In Proceedings of the 2009 Winter Simulation Conference (WSC), Orlando, FL, USA, 4 December 2009; pp. 86–98. [Google Scholar] [CrossRef] [Green Version]
  106. Macal, C.M.; North, M.J. Tutorial on agent-based modelling and simulation. J. Simul. 2010, 4, 151–162. [Google Scholar] [CrossRef]
  107. Gazi, V.; Fidan, B. Coordination and control of multi-agent dynamic systems: Models and approaches. In International Workshop on Swarm Robotics; Springer: Berlin, Germany, 2006; pp. 71–102. [Google Scholar]
  108. Bonabeau, E. Agent-based modeling: Methods and techniques for simulating human systems. Proc. Natl. Acad. Sci. USA 2002, 99, 7280–7287. [Google Scholar] [CrossRef] [Green Version]
  109. Belsare, A.V.; Gompper, M.E. A model-based approach for investigation and mitigation of disease spillover risks to wildlife: Dogs, foxes and canine distemper in central India. Ecol. Model. 2015, 296, 102–112. [Google Scholar] [CrossRef]
  110. Raberto, M.; Cincotti, S.; Focardi, S.M.; Marchesi, M. Agent-based simulation of a financial market. Phys. A Stat. Mech. Appl. 2001, 299, 319–327. [Google Scholar] [CrossRef] [Green Version]
  111. Barbosa, J.; Leitao, P. Simulation of multi-agent manufacturing systems using agent-based modelling platforms. In Proceedings of the IEEE International Conference on Industrial Informatics (INDIN), Lisbon, Portugal, 26–29 July 2011; pp. 477–482. [Google Scholar] [CrossRef] [Green Version]
  112. Kiss, G. Agent Dynamics. In Foundations of Distributed Artificial Intelligence; O’Hare, G.M., Jennings, N.R., Eds.; John Wiley & Sons: New York, NY, USA, 1996; Chapter 9; pp. 247–267. [Google Scholar]
  113. Wooldridge, M.; Jennings, N.R. Inteligent Agents: Theory And Practice. Knowl. Eng. Rev. 1995, 10, 115–152. [Google Scholar] [CrossRef] [Green Version]
  114. Haddadi, A.; Sundermeyer, K. Belief-desire-intention agent architectures. In Foundations of Distributed Artificial Intelligence; John Wiley & Sons, Inc.: New York, NY, USA, 1996; pp. 169–185. [Google Scholar]
  115. Drogoul, A.; Vanbergue, D.; Meurisse, T.; Université, L.; Place, P.; Cedex, J.P. Multi-Agent Based Simulation: Where are the Agents? Multi-Agent-Based Simulation. In Proceedings of Third International Worshop on MABS 2002; Sichman, J.S., II, Bousquet, f., Davidsson, p., Eds.; Springer: Berlin/Heidelberg, Germany, 2002; pp. 89–104. [Google Scholar]
  116. Iba, H. Agent-Based Modeling and Simulation with Swarm; Chapman and Hall/CRC: Boca Raton, FL, USA, 2013. [Google Scholar]
  117. Franklin, S.; Graesser, A. Is it an Agent, or just a Program? A Taxonomy for Autonomous Agents. In Intelligent Agents III Agent Theories, Architectures, and Languages; Springer: Berlin/Heidelberg, Germany, 1997; pp. 21–35. [Google Scholar] [CrossRef]
  118. Hexmoor, H. A model of absolute autonomy and power: Toward group effects. Connect. Sci. 2002, 14, 323–333. [Google Scholar] [CrossRef]
  119. Castelfranchi, C.; Falcone, R. From Automaticity to Autonomy: The Frontier of Artificial Agents. In Agent Autonomy; Springer: Berlin, Germany, 2003; pp. 103–136. [Google Scholar] [CrossRef]
  120. Brewka, G. Artificial Intelligence—A Modern Approach by Stuart Russell and Peter Norvig; Series in Artificial Intelligence; Prentice Hall: Englewood Cliffs, NJ, USA, 1996; Volume 11, pp. 78–79. [Google Scholar] [CrossRef]
  121. Wooldridge, M. Intelligent Agents: The Key Concepts. In Proceedings of the 9th ECCAI-ACAI/EASSS 2001, AEMAS 2001, HoloMAS 2001 on Multi-Agent-Systems and Applications II-Selected Revised Papers; Springer: Berlin, Germany, 2002; pp. 3–43. [Google Scholar]
  122. Holcombe, M. A General Framework for Agent-Based Modelling of Complex Systems; European Complex Systems Society: Paris, France, 2006; pp. 1–6. [Google Scholar]
  123. Sakellariou, I. Agent based modelling and simulation using state machines. In Proceedings of the 2nd International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2012), Rome, Italy, 28–31 July 2012; pp. 270–279. [Google Scholar] [CrossRef]
  124. Miao, C.Y.; Goh, A.; Miao, Y.; Yang, Z.H. Agent that models, reasons and makes decisions. Knowl. Based Syst. 2002, 15, 203–211. [Google Scholar] [CrossRef]
  125. Laclavík, M.; Balogh, Z.; Babík, M.; Hluchý, L. Agentowl: Semantic knowledge model and agent architecture. Comput. Inf. 2006, 25, 421–439. [Google Scholar]
  126. Dibley, M.; Li, H.; Rezgui, Y.; Miles, J. An integrated framework utilising software agent reasoning and ontology models for sensor based building monitoring. J. Civ. Eng. Manag. 2015, 21, 356–375. [Google Scholar] [CrossRef] [Green Version]
  127. González, E.J.; Hamilton, A.F.; Moreno, L.; Marichal, R.L.; Muñoz, V. Software experience when using ontologies in a multi-agent system for automated planning and scheduling. Softw. Pract. Exp. 2006, 36, 667–688. [Google Scholar] [CrossRef]
  128. Ward, J.A.; Evans, A.J.; Malleson, N.S. Dynamic calibration of agent-based models using data assimilation. R. Soc. Open Sci. 2016, 3, 150703. [Google Scholar] [CrossRef] [Green Version]
  129. Dennett, D.C. The Intentional Stance 1987; MIT Press: Cambridge, MA, USA, 1987. [Google Scholar]
  130. Kennedy, W.G. Modelling human behaviour in agent-based models. In Agent-Based Models of Geographical Systems; Springer: Berlin, Germany, 2012; pp. 167–179. [Google Scholar]
  131. Wooldridge, M.; Jennings, N.R. Agent theories, architectures, and languages: A survey. Lect. Notes Comput. Sci. 1995, 890, 1–39. [Google Scholar] [CrossRef] [Green Version]
  132. Rao, A.; Georgeff, M. BDI Agents: From Theory to Practice. In Proceedings of the First International Conference on Multi-Agent Systems (ICMAS-95), San Francisco, CA, USA, 12–14 June 1995. [Google Scholar]
  133. Consoli, A.; Tweedale, J.; Jain, L. The link between agent coordination and cooperation. IFIP Int. Fed. Inf. Proces. 2006, 228, 11–19. [Google Scholar] [CrossRef] [Green Version]
  134. Foundation For Intelligent Physical Agents. FIPA ACL Message Structure Specification. 2002. Available online: http://www.fipa.org/specs/fipa00061/SC00061G.html (accessed on 8 March 2020).
  135. Kibble, R. Speech acts, commitment and multi-agent communication. Comput. Math. Organ. Theory 2006, 12, 127–145. [Google Scholar] [CrossRef]
  136. Valckenaers, P.; Kollingbaum, M.; Van Brussel, H. Multi-agent coordination and control using stigmergy. Comput. Ind. 2004, 53, 75–96. [Google Scholar] [CrossRef]
  137. Olfati-Saber, R.; Fax, J.A.; Murray, R.M. Consensus and cooperation in networked multi-agent systems. Proc. IEEE 2007, 95, 215–233. [Google Scholar] [CrossRef] [Green Version]
  138. Gulzar, M.M.; Rizvi, S.T.H.; Javed, M.Y.; Munir, U.; Asif, H. Multi-Agent Cooperative Control Consensus: A Comparative Review. Electronics 2018, 7, 22. [Google Scholar] [CrossRef] [Green Version]
  139. Nwana, H.; Lee, L.; Jennings, N.; Mary, Q.; College, W. Coordination in Software Agent Systems. BT Technol. J. 1996, 14, 79–89. [Google Scholar]
  140. Bedrouni, A.; Mittu, R.; Boukhtouta, A.; Berger, J. Distributed Intelligent Systems: A Coordination Perspective; Springer Science & Business Media: Berlin, Germany, 2009. [Google Scholar]
  141. Zambonelli, F.; Omicini, A.; Anzengruber, B.; Castelli, G.; De Angelis, F.L.; Serugendo, G.D.M.; Dobson, S.; Fernandez-Marquez, J.L.; Ferscha, A.; Mamei, M.; et al. Developing pervasive multi-agent systems with nature-inspired coordination. Pervasive Mob. Comput. 2015, 17, 236–252. [Google Scholar] [CrossRef] [Green Version]
  142. Crooks, A.T.; Castle, C.J. The integration of agent-based modelling and geographical information for geospatial simulation. In Agent-Based Models of Geographical Systems; Springer: Berlin, Germany, 2012; pp. 219–251. [Google Scholar]
  143. Severins, M.; Klinkenberg, D.; Heesterbeek, H. Effects of heterogeneity in infection-exposure history and immunity on the dynamics of a protozoan parasite. J. R. Soc. Interface 2007, 4, 841–849. [Google Scholar] [CrossRef]
  144. Šperka, R.; Spišák, M. Transaction costs influence on the stability of financial market: Agent-based simulation. J. Bus. Econ. Manag. 2013, 14, 1–12. [Google Scholar] [CrossRef] [Green Version]
  145. Bellifemine, F.L.; Caire, G.; Poggi, A.; Rimassa, G. Jade A White Paper; Technical Report; Telecom Italia Lab: Torino, Italy, 2003. [Google Scholar]
  146. Jong, J.D.; Stellingwerff, L.; Pazienza, G.E. Eve: A Novel Open-Source Web-Based Agent Platform. In Proceedings of the 2013 IEEE International Conference on Systems, Man, and Cybernetics, Manchester, UK, 13–16 October 2013; pp. 1537–1541. [Google Scholar] [CrossRef]
  147. Al-Sakran, H.O. Intelligent traffic information system based on integration of Internet of Things and Agent technology. Int. J. Adv. Comput. Sci. Appl. 2015, 6, 37–43. [Google Scholar]
  148. Singh, M.P.; Chopra, A.K. The Internet of Things and Multiagent Systems: Decentralized Intelligence in Distributed Computing. In Proceedings of the 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), Atlanta, GA, USA, 5–8 June 2017; pp. 1738–1747. [Google Scholar]
  149. Kilkki, O.; Kangasrääsiö, A.; Nikkilä, R.; Alahäivälä, A.; Seilonen, I. Agent-based modeling and simulation of a smart grid: A case study of communication effects on frequency control. Eng. Appl. Artif. Intell. 2014, 33, 91–98. [Google Scholar] [CrossRef]
  150. Malik, F.H.; Lehtonen, M. A review: Agents in smart grids. Electr. Power Syst. Res. 2016, 131, 71–79. [Google Scholar] [CrossRef]
  151. Bernhardt, K. Agent-based modeling in transportation. Artif. Intell. Transp. 2007, 72. [Google Scholar]
  152. Wise, S.; Crooks, A.; Batty, M. Transportation in agent-based urban modelling. In International Workshop on Agent Based Modelling of Urban Systems; Springer: Berlin, Germany, 2016; pp. 129–148. [Google Scholar]
  153. Izquierdo, J.; Herrera, M.; Montalvo, I.; Pérez-García, R. Agent-based Division of Water Distribution Systems into District Metered Areas. In Proceedings of the ICSOFT, Sofia, Bulgaria, 26–29 July 2009; pp. 83–90. [Google Scholar]
  154. Nikolic, I.; Dijkema, G. On the development of Agent-Based Models for infrastructure evolution. Int. J. Crit. Infrastruct. 2010, 6. [Google Scholar] [CrossRef]
  155. Cardellini, V.; Casalicchio, E.; Galli, E. Agent-based modeling of interdependencies in critical infrastructures through UML. In Proceedings of the 2007 Spring Simulation Multiconference; Society for Computer Simulation International: San Diego, CA, USA, 2007; Volume 2, pp. 119–126. [Google Scholar]
  156. Setola, R.; Bologna, S.; Casalicchio, E.; Masucci, V. An integrated approach for simulating interdependencies. In International Conference on Critical Infrastructure Protection; Springer: Berlin, Germany, 2008; pp. 229–239. [Google Scholar]
  157. Iturriza, M.; Labaka, L.; Sarriegi, J.M.; Hernantes, J. Modelling methodologies for analysing critical infrastructures. J. Simul. 2018, 12, 128–143. [Google Scholar] [CrossRef]
  158. Miciolino, E.E.; Bernieri, G.; Pascucci, F.; Setola, R. Communications network analysis in a SCADA system testbed under cyber-attacks. In Proceedings of the 23rd IEEE Telecommunications Forum Telfor (TELFOR), Belgrade, Serbia, 24–26 November 2015; pp. 341–344. [Google Scholar]
  159. Yao, J.; Venkitasubramaniam, P.; Kishore, S.; Snyder, L.V.; Blum, R.S. Network topology risk assessment of stealthy cyber attacks on advanced metering infrastructure networks. In Proceedings of the IEEE 2017 51st Annual Conference on Information Sciences and Systems (CISS), Baltimore, MD, USA, 22–24 March 2017; pp. 1–6. [Google Scholar]
  160. Zhu, B.; Joseph, A.; Sastry, S. A taxonomy of cyber attacks on SCADA systems. In Proceedings of the IEEE 2011 International Conference on Internet of Things and 4th International Conference on Cyber, Physical and Social Computing, Dalian, China, 19–22 October 2011; pp. 380–388. [Google Scholar]
  161. Ryu, D.H.; Kim, H.; Um, K. Reducing security vulnerabilities for critical infrastructure. J. Loss Prev. Process Ind. 2009, 22, 1020–1024. [Google Scholar] [CrossRef]
  162. Parvez, B.; Ali, J.; Ahmed, U.; Farhan, M. Framework for implementation of AGA 12 for secured SCADA operation in Oil and Gas Industry. In Proceedings of the 2nd IEEE International Conference on Computing for Sustainable Global Development (INDIACom), New Delhi, India, 11–13 March 2015; pp. 1281–1284. [Google Scholar]
  163. Bernieri, G.; Miciolino, E.E.; Pascucci, F.; Setola, R. Monitoring system reaction in cyber-physical testbed under cyber-attacks. Comput. Electr. Eng. 2017, 59, 86–98. [Google Scholar] [CrossRef]
  164. Taormina, R.; Galelli, S.; Tippenhauer, N.O.; Salomons, E.; Ostfeld, A.; Eliades, D.G.; Aghashahi, M.; Sundararajan, R.; Pourahmadi, M.; Banks, M.K.; et al. Battle of the Attack Detection Algorithms: Disclosing Cyber Attacks on Water Distribution Networks. J. Water Resour. Plan. Manag. 2018, 144, 04018048. [Google Scholar] [CrossRef] [Green Version]
  165. Sgouras, K.I.; Birda, A.D.; Labridis, D.P. Cyber attack impact on critical smart grid infrastructures. In Proceedings of the 2014 IEEE Innovative Smart Grid Technologies Conference (ISGT), Washington, DC, USA, 19–22 February 2014; pp. 1–5. [Google Scholar]
  166. Bretas, A.S.; Bretas, N.G.; Carvalho, B.; Baeyens, E.; Khargonekar, P.P. Smart grids cyber-physical security as a malicious data attack: An innovation approach. Electr. Power Syst. Res. 2017, 149, 210–219. [Google Scholar] [CrossRef]
  167. Cui, L.; Hu, J.; Park, B.B.; Bujanovic, P. Development of a simulation platform for safety impact analysis considering vehicle dynamics, sensor errors, and communication latencies: Assessing cooperative adaptive cruise control under cyber attack. Transp. Res. Part C Emerg. Technol. 2018, 97, 1–22. [Google Scholar] [CrossRef]
  168. Liang, G.; Weller, S.R.; Zhao, J.; Luo, F.; Dong, Z.Y. A Framework for Cyber-topology Attacks: Line-switching and New Attack Scenarios. Trans. Smart Grid 2017, 10, 1704–1712. [Google Scholar] [CrossRef]
  169. He, D.; Chan, S.; Guizani, M. Mobile application security: Malware threats and defenses. IEEE Wirel. Commun. 2015, 22, 138–144. [Google Scholar] [CrossRef]
  170. Silk, H.; Homer, M.; Gross, T. Design of self-organizing networks: Creating specified degree distributions. IEEE Trans. Netw. Sci. Eng. 2016, 3, 147–158. [Google Scholar] [CrossRef] [Green Version]
  171. Chen, Y.; Guo, Z.; Yang, X.; Hu, Y.; Zhu, Q. Optimization of Coverage in 5G Self-Organizing Small Cell Networks. Mob. Netw. Appl. 2017, 23, 1502–1512. [Google Scholar] [CrossRef]
  172. Yang, W.; Fung, C. A survey on security in network functions virtualization. In Proceedings of the 2016 IEEE NetSoft Conference and Workshops (NetSoft), Seoul, Korea, 6–10 June 2016; pp. 15–19. [Google Scholar]
  173. Kuo, T.W.; Liou, B.H.; Lin, K.C.J.; Tsai, M.J. Deploying chains of virtual network functions: On the relation between link and server usage. IEEE/ACM Trans. Netw. (TON) 2018, 26, 1562–1576. [Google Scholar] [CrossRef]
  174. Bernini, G.; Giardina, P.G.; Carrozzo, G.; Celdrán, A.H.; Pérez, M.G.; Calero, J.M.A.; Wang, Q.; Koutsopoulos, K.; Neves, P. Combined NFV and SDN Applications for Mitigation of Cyber-Attacks Conducted by Botnets in 5G Mobile Networks. In Proceedings of the ICN 2017, Berlin, Germany, 26–28 September 2017; p. 159. [Google Scholar]
  175. Liang, C.; Wen, F.; Wang, Z. Trust-based distributed Kalman filtering for target tracking under malicious cyber attacks. Inf. Fus. 2019, 46, 44–50. [Google Scholar] [CrossRef] [Green Version]
  176. Zañudo, J.G.T.; Yang, G.; Albert, R. Structure-based control of complex networks with nonlinear dynamics. Proc. Natl. Acad. Sci. USA 2017, 114, 7234–7239. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  177. Ding, J.; Wen, C.; Li, G.; Chen, Z. Key Nodes Selection in Controlling Complex Networks via Convex Optimization. IEEE Trans. Cybern. 2019, 1–12. [Google Scholar] [CrossRef] [PubMed]
  178. Venkatesh, S.; Ramesh, A.; Shyama, U.; Iyengar, S. Landmark Identification in Complex Networks. In Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Istanbul, Turkey, 26–29 August 2012; pp. 1335–1340. [Google Scholar]
  179. Tretyakov, K.; Armas-Cervantes, A.; García-Bañuelos, L.; Vilo, J.; Dumas, M. Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In Proceedings of the 20th ACM International Conference on Information and Knowledge Management, Glasgow, UK, 24–28 October 2011; pp. 1785–1794. [Google Scholar]
  180. Fushimi, T.; Saito, K.; Ikeda, T.; Kazama, K. Estimating node connectedness in spatial network under stochastic link disconnection based on efficient sampling. Appl. Netw. Sci. 2019, 4, 1–24. [Google Scholar] [CrossRef] [Green Version]
  181. Giudicianni, C.; di Nardo, A.; Scala, A.; Herrera, M. Multiscale shortest path algorithm for big-size utility networks. arXiv 2019, arXiv:1903.11710. [Google Scholar]
  182. Zhang, X.; Mahadevan, S.; Sankararaman, S.; Goebel, K. Resilience-based network design under uncertainty. Reliab. Eng. Syst. Saf. 2018, 169, 364–379. [Google Scholar] [CrossRef]
  183. Fu, C.; Wang, Y.; Gao, Y.; Wang, X. Complex networks repair strategies: Dynamic models. Phys. A Stat. Mech. Appl. 2017, 482, 401–406. [Google Scholar] [CrossRef]
  184. Gu, J.; Zhu, Y.; Guo, L.; Jiang, J.; Chi, L.; Li, W.; Wang, Q.; Cai, X. Recent Progress in Some Active Topics on Complex Networks. J. Phys. Conf. Ser. 2015, 604, 012007. [Google Scholar] [CrossRef] [Green Version]
  185. Van Mieghem, P. Performance Analysis of Complex Networks and Systems; Cambridge University Press: Cambridge, UK, 2014. [Google Scholar]
  186. Li, G.; Deng, L.; Xiao, G.; Tang, P.; Wen, C.; Hu, W.; Pei, J.; Shi, L.; Stanley, H.E. Enabling controlling complex networks with local topological information. Sci. Rep. 2018, 8, 4593. [Google Scholar] [CrossRef]
  187. Dilts, D.; Boyd, N.; Whorms, H. The evolution of control architectures for automated manufacturing systems. J. Manuf. Syst. 1991, 10, 79–93. [Google Scholar] [CrossRef]
  188. Van Brussel, H.; Wyns, J.; Valckenaers, P.; Bongaerts, L.; Peeters, P. Reference architecture for holonic manufacturing systems: PROSA. Comput. Ind. 1998, 37, 255–274. [Google Scholar] [CrossRef]
  189. Bongaerts, L.; Monostori, L.; McFarlane, D.; Kádár, B. Hierarchy in distributed shop floor control. Comput. Ind. 2000, 43, 123–137. [Google Scholar] [CrossRef]
  190. Cai, K.; Wonham, W.M. Supervisor Localization: A top-down approach to distributed control of discrete-event systems. IEEE Trans. Autom. Control 2015, 55, 605–618. [Google Scholar] [CrossRef]
  191. Neil, D.; Rex, P. Non-Hierarchical Control of A Flexible Manufacturing Cell. Robot. Comput. Integr. Manuf. 1987, 3, 175–179. [Google Scholar]
  192. McFarlane, D.C.; Bussmann, S. Holonic Manufacturing Control: Rationales, Developments and Open Issues. Agent-Based Manuf. 2003, 303–326. [Google Scholar] [CrossRef] [Green Version]
  193. Koestler, A. The Ghost in the Machine; Macmillan: Oxford, UK, 1968; p. xvi-384. [Google Scholar]
  194. Ottens, B.; Faltings, B. Global optimization for multiple agents. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, Hong Kong, China, 1–6 June 2012. [Google Scholar]
  195. Kollingbaum, M.; Heikkilä, T.; Peeters, P.; Matson, J.; Valckenaers, P.; McFarlane, D.; Bluemink, G.J. Emergent flow shop control based on MASCADA agents. IFAC Proc. Vol. 2000, 33, 187–192. [Google Scholar] [CrossRef]
  196. McFarlane, D.; Chirn, J.; Jarvis, D.; Matson, J.; Jarvis, J. Holonic Production Control to Support Mass Customisation. Technical Report Mass Customisation; Institute for Manufacturing: Cambridge, UK, 2002. [Google Scholar]
  197. McFarlane, D.; Sarma, S.; Chirn, J.L.; Wong, C.; Ashton, K. Auto ID systems and intelligent manufacturing control. Eng. Appl. Artif. Intell. 2003, 16, 365–376. [Google Scholar] [CrossRef]
  198. Leitão, P. Agent-based distributed manufacturing control: A state-of-the-art survey. Eng. Appl. Artif. Intell. 2009, 22, 979–991. [Google Scholar] [CrossRef]
  199. Brintrup, A.; McFarlane, D.; Ranasinghe, D.; Sánchez López, T.; Owens, K. Will intelligent assets take off? Toward self-serving aircraft. IEEE Intell. Syst. 2011, 26, 66–75. [Google Scholar] [CrossRef]
  200. Bussmann, S.; Jennings, N.R.; Wooldridge, M. Multiagent Systems for Manufacturing Control: A Design Methodology; Springer Science & Business Media: Berlin, Germany, 2013. [Google Scholar]
  201. Brintrup, A.; Ledwoch, A. Supply network science: Emergence of a new perspective on a classical field. Chaos Interdiscipl. J. Nonlinear Sci. 2018, 28, 033120. [Google Scholar] [CrossRef]
  202. Ledwoch, A.; Brintrup, A.; Mehnen, J.; Tiwari, A. Systemic risk assessment in complex supply networks. IEEE Syst. J. 2016, 12, 1826–1837. [Google Scholar] [CrossRef] [Green Version]
  203. Hearnshaw, E.J.; Wilson, M.M. A complex network approach to supply chain network theory. Int. J. Oper. Prod. Manag. 2013, 33, 442–469. [Google Scholar] [CrossRef]
  204. Marik, V.; McFarlane, D. Industrial adoption of agent-based technologies. IEEE Intell. Syst. 2005, 20, 27–35. [Google Scholar] [CrossRef]
  205. Leitão, P.; Karnouskos, S.; Ribeiro, L.; Lee, J.; Strasser, T.; Colombo, A.W. Smart Agents in Industrial Cyber-Physical Systems. Proc. IEEE 2016, 104, 1086–1101. [Google Scholar] [CrossRef] [Green Version]
  206. Suda, H. Future factory System formulated in Japan. J. Adv. Autom. Technol. 1989, 1, 15–25. [Google Scholar]
  207. Mcfarlane, D.; Sarma, S.; Chirn, J.L.; Wong, C.Y.; Ashton, K. The Intelligent Product in Manufacturing Control. In Proceedings of the 15th Triennial World Congress, Barcelona, Spain, 21 July 2002; pp. 49–54. [Google Scholar]
  208. McFarlane, D.; Giannikas, V.; Wong, A.C.; Harrison, M. Product intelligence in industrial control: Theory and practice. Annu. Rev. Control 2013, 37, 69–88. [Google Scholar] [CrossRef]
  209. Pagani, G.A.; Aiello, M. The power grid as a complex network: A survey. Phys. A Stat. Mech. Appl. 2013, 392, 2688–2700. [Google Scholar] [CrossRef] [Green Version]
  210. Albert, R.; Albert, I.; Nakarado, G.L. Structural vulnerability of the North American power grid. Phys. Rev. E 2004, 69, 025103. [Google Scholar] [CrossRef] [Green Version]
  211. Pagani, G.A.; Aiello, M. Power grid complex network evolutions for the smart grid. Phys. A Stat. Mech. Appl. 2014, 396, 248–266. [Google Scholar] [CrossRef] [Green Version]
  212. Moussawi, A.; Derzsy, N.; Lin, X.; Szymanski, B.K.; Korniss, G. Limits of predictability of cascading overload failures in spatially-embedded networks with distributed flows. Sci. Rep. 2017, 7, 11729. [Google Scholar] [CrossRef] [Green Version]
  213. Das, H.; Jena, A.; Rath, P.; Muduli, B.; Das, S. Grid computing-based performance analysis of power system: A graph theoretic approach. In Intelligent Computing, Communication and Devices; Springer: Berlin, Germany, 2015; pp. 259–266. [Google Scholar]
  214. Roche, R.; Blunier, B.; Miraoui, A.; Hilaire, V.; Koukam, A. Multi-agent systems for grid energy management: A short review. In Proceedings of the IECON Proceedings (Industrial Electronics Conference), Glendale, AZ, USA, 7–10 November; pp. 3341–3346. [CrossRef]
  215. Dimeas, A.; Hatziargyriou, N. A multi-agent system for microgrids. In Hellenic Conference on Artificial Intelligence; Springer: Berlin, Germany, 2004; pp. 447–455. [Google Scholar]
  216. Dimeas, A.L.; Hatziargyriou, N.D. Operation of a multiagent system for microgrid control. IEEE Trans. Power Syst. 2005, 20, 1447–1455. [Google Scholar] [CrossRef]
  217. Jiang, Z. Agent-Based Control Framework for Distributed Energy Resources Microgrids. In Proceedings of the International Conference on Intelligent Agent Technology, Hong Kong, China, 18–22 December 2006. [Google Scholar]
  218. Lin, J.; Ban, Y. Complex network topology of transportation systems. Transp. Rev. 2013, 33, 658–685. [Google Scholar] [CrossRef]
  219. Lordan, O.; Sallan, J.M.; Simo, P. Study of the topology and robustness of airline route networks from the complex network approach: A survey and research agenda. Transp. Geogr. 2014, 37, 112–120. [Google Scholar] [CrossRef]
  220. Crucitti, P.; Latora, V.; Porta, S. Centrality measures in spatial networks of urban streets. Phys. Rev. E 2006, 73, 036125. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  221. Scellato, S.; Cardillo, A.; Latora, V.; Porta, S. The backbone of a city. Eur. Phys. J. B-Condens. Matter Complex Syst. 2006, 50, 221–225. [Google Scholar] [CrossRef] [Green Version]
  222. Boeing, G. OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks. Comput. Environ. Urb. Syst. 2017, 65, 126–139. [Google Scholar] [CrossRef] [Green Version]
  223. Zheng, J.F.; Gao, Z.Y.; Zhao, X.M. Clustering and congestion effects on cascading failures of scale-free networks. Europhys. Lett. 2007, 79, 58002. [Google Scholar] [CrossRef]
  224. Jiménez, J.A. Smart Transportation Systems. In Smart Cities; Springer: Berlin, Germany, 2018; pp. 123–133. [Google Scholar]
  225. Tian, W.; Dai, X.; Hu, M. Systemic Congestion Propagation in the Airspace Network. Math. Probl. Eng. 2018, 2018, 7171486. [Google Scholar] [CrossRef] [Green Version]
  226. Baronti, F.; Vazquez, S.; Chow, M.Y. Modeling, Control, and Integration of Energy Storage Systems in E-Transportation and Smart Grid. IEEE Trans. Ind. Electron. 2018, 65, 6548–6551. [Google Scholar] [CrossRef] [Green Version]
  227. Lygeros, J.; Godbole, D.N.; Broucke, M. A Fault Tolerant Control Architecture for Automated Highway Systems. Control 2000, 8, 205–219. [Google Scholar] [CrossRef]
  228. Herrera, M. Improving Water Network Management by Efficient Division Into Supply Clusters. Ph.D. Thesis, Universitat Politècnica de València (Spain), Valencia, Spain, 2011. [Google Scholar]
  229. Herrera, M.; Abraham, E.; Stoianov, I. A graph-theoretic framework for assessing the resilience of sectorised water distribution networks. Water Resour. Manag. 2016, 30, 1685–1699. [Google Scholar] [CrossRef] [Green Version]
  230. di Nardo, A.; Giudicianni, C.; Greco, R.; Herrera, M.; Santonastaso, G.F. Applications of graph spectral techniques to water distribution network management. Water 2018, 10, 45. [Google Scholar] [CrossRef] [Green Version]
  231. Candelieri, A.; Archetti, F. Smart water in urban distribution networks: limited financial capacity and Big Data analytics. WIT Trans. Built Environ. 2014, 139. [Google Scholar] [CrossRef] [Green Version]
  232. Herrera, M.; Izquierdo, J.; Pérez-García, R.; Montalvo, I. Multi-agent adaptive boosting on semi-supervised water supply clusters. Adv. Eng. Softw. 2012, 50, 131–136. [Google Scholar] [CrossRef]
  233. Herrera, M.; Izquierdo, J.; Pérez-García, R.; Ayala-Cabrera, D. Water supply clusters by multi-agent based approach. In Water Distribution Systems Analysis 2010; ASCE: Reston, VI, USA, 2010; pp. 861–869. [Google Scholar]
  234. Hajebi, S.; Barrett, S.; Clarke, A.; Clarke, S. Multi-agent simulation to support water distribution network partitioning. In Proceedings of the 27th European Simulation and Modelling Conference—ESM’2013, Lancaster, UK, 23–25 October 2013. [Google Scholar]
  235. Ayala-Cabrera, D.; Herrera, M.; Izquierdo, J.; Pérez-García, R. GPR data analysis using multi-agent and clustering approaches: A tool for technical management of water supply systems. Dig. Signal Process. 2014, 27, 140–149. [Google Scholar] [CrossRef]
  236. Figueiredo, J.; Botto, M.A.; Rijo, M. SCADA system with predictive controller applied to irrigation canals. Control Eng. Pract. 2013, 21, 870–886. [Google Scholar] [CrossRef]
  237. Garcia, C.E.; Prett, D.M.; Morari, M. Model predictive control: Theory and practice—A survey. Automatica 1989, 25, 335–348. [Google Scholar] [CrossRef]
  238. Szoplik, J. The Gas Transportation in a Pipeline Network. In Advances in Natural Gas Technology; InTech: London, UK, 2012; pp. 339–358. [Google Scholar]
  239. Crisostomi, E.; Raugi, M.; Franco, A.; Giunta, G. The smart gas grid: State of the art and perspectives. In Proceedings of the 2013 IEEE 4th Innovative Smart Grid Technologies Europe (ISGT EUROPE), Lyngby, Denmark, 6–9 October 2013; pp. 1–5. [Google Scholar]
  240. Bliek, F.W.; van den Noort, A.; Roossien, B.; Kamphuis, R.; de Wit, J.; van der Velde, J.; Eijgelaar, M. The role of natural gas in smart grids. J. Nat. Gas Sci. Eng. 2011, 3, 608–616. [Google Scholar] [CrossRef]
  241. Brown, H.E.; Suryanarayanan, S.; Heydt, G.T. Some characteristics of emerging distribution systems considering the smart grid initiative. Electr. J. 2010, 23, 64–75. [Google Scholar] [CrossRef]
  242. Chacón, E.; Besembel, I.; Hennet, J.C. Coordination and optimization in oil and gas production complexes. Comput. Ind. 2004, 53, 17–37. [Google Scholar] [CrossRef]
  243. Ameli, H.; Qadrdan, M.; Strbac, G. Value of gas network infrastructure flexibility in supporting cost effective operation of power systems. Appl. Energy 2017, 202, 571–580. [Google Scholar] [CrossRef]
  244. Newman, M.E. Analysis of weighted networks. Phys. Rev. E 2004, 70, 056131. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  245. Holme, P.; Saramäki, J. Temporal networks. Phys. Rep. 2012, 519, 97–125. [Google Scholar] [CrossRef] [Green Version]
  246. Schaub, M.T.; Delvenne, J.C.; Lambiotte, R.; Barahona, M. Multiscale dynamical embeddings of complex networks. Phys. Rev. E 2019, 99, 062308. [Google Scholar] [CrossRef] [Green Version]
  247. D’Agostino, G.; Scala, A. Networks of Networks: The Last Frontier of Complexity; Springer: Berlin, Germany, 2014; Volume 340. [Google Scholar]
  248. Pilo, F.; Lama, R.; Valtorta, G. Special Report—Session 5, Planning of power distribution systems. In 25th International Conference on Electricity Distribution; Technical Report; IET: London, UK, 2019. [Google Scholar]
  249. Raab, A.F.; Lauth, E.; Strunz, K.; Göhlich, D. Implementation schemes for electric bus fleets at depots with optimized energy procurements in virtual power plant operations. World Electr. Veh. J. 2019, 10, 5. [Google Scholar] [CrossRef] [Green Version]
  250. Giudicianni, C.; Herrera, M.; di Nardo, A.; Carravetta, A.; Ramos, H.M.; Adeyeye, K. Zero-net energy management for the monitoring and control of dynamically-partitioned smart water systems. J. Clean. Prod. 2020, 252, 119745. [Google Scholar] [CrossRef]
  251. Xie, R.; Wang, Z.; Bai, S.; Ma, P.; Zhong, W. Online decentralized leverage score sampling for streaming multidimensional time series. Proc. Mach. Learn. Res. 2019, 89, 2301. [Google Scholar]
  252. Porto, S.; Quiles, M.G. Clustering Data Streams: A Complex Network Approach. In International Conference on Computational Science and Its Applications; Springer: Berlin, Germany, 2019; pp. 52–65. [Google Scholar]
  253. Zhang, S.; Tong, H.; Xu, J.; Maciejewski, R. Graph convolutional networks: A comprehensive review. Comput. Soc. Netw. 2019, 6, 11. [Google Scholar] [CrossRef] [Green Version]
  254. Manessi, F.; Rozza, A.; Manzo, M. Dynamic graph convolutional networks. Pattern Recognit. 2020, 97, 107000. [Google Scholar] [CrossRef]
  255. Chen, S.H.; Venkatachalam, R. Agent-based modelling as a foundation for big data. J. Econ. Methodol. 2017, 24, 362–383. [Google Scholar] [CrossRef] [Green Version]
  256. Kavak, H.; Padilla, J.J.; Lynch, C.J.; Diallo, S.Y. Big data, agents, and machine learning: Towards a data-driven agent-based modeling approach. In Proceedings of the Annual Simulation Symposium; Society for Computer Simulation International: San Diego, CA, USA, 2018; p. 12. [Google Scholar]
  257. Omidshafiei, S.; Kim, D.K.; Liu, M.; Tesauro, G.; Riemer, M.; Amato, C.; Campbell, M.; How, J.P. Learning to teach in cooperative multiagent reinforcement learning. In Proceedings of the AAAI Conference on Artificial Intelligence, Honolulu, HI, USA, 29 January–1 February 2019; Volume 33, pp. 6128–6136. [Google Scholar]
  258. Da Silva, F.L.; Warnell, G.; Costa, A.H.R.; Stone, P. Agents teaching agents: A survey on inter-agent transfer learning. Auton. Agents Multi-Agent Syst. 2020, 34, 9. [Google Scholar] [CrossRef]
  259. Leitao, P.; Colombo, A.W.; Karnouskos, S. Industrial automation based on cyber-physical systems technologies: Prototype implementations and challenges. Comput. Ind. 2016, 81, 11–25. [Google Scholar] [CrossRef] [Green Version]
  260. Yao, X.; Zhou, J.; Lin, Y.; Li, Y.; Yu, H.; Liu, Y. Smart manufacturing based on cyber-physical systems and beyond. J. Intell. Manuf. 2019, 30, 2805–2817. [Google Scholar] [CrossRef] [Green Version]
  261. Airlangga, G.; Liu, A. Initial Machine Learning Framework Development of Agriculture Cyber Physical Systems. J. Phys. Conf. Ser. 2019, 1196, 012065. [Google Scholar] [CrossRef]
  262. Whyte, J.; Coca, D.; Fitzgerald, J.; Mayfield, M.; Pierce, K.; Shah, N.; Chen, L.; Gamble, C.; Genes, C.; Babovic, F.; et al. Analysing Systems Interdependencies Using a Digital Twin; Technical Report; Centre for Digital Built Britain: Cambridge, UK, 2019. [Google Scholar]
  263. Crosby, M.; Pattanayak, P.; Verma, S.; Kalyanaraman, V. Blockchain technology: Beyond bitcoin. Appl. Innov. 2016, 2, 71. [Google Scholar]
  264. Salah, K.; Rehman, M.H.U.; Nizamuddin, N.; Al-Fuqaha, A. Blockchain for AI: Review and open research challenges. IEEE Access 2019, 7, 10127–10149. [Google Scholar] [CrossRef]
Figure 1. Key components of multi-agent models.
Figure 1. Key components of multi-agent models.
Processes 08 00312 g001
Figure 2. Common coordination models found in literature.
Figure 2. Common coordination models found in literature.
Processes 08 00312 g002
Figure 3. London underground scheme as example of complex network: The layout shows a quasi-planar (few crosses between links) as well as a core-periphery (more densely connected at the centre) structure.
Figure 3. London underground scheme as example of complex network: The layout shows a quasi-planar (few crosses between links) as well as a core-periphery (more densely connected at the centre) structure.
Processes 08 00312 g003
Figure 4. Geographical and functional infrastructure interdependence between the national electricity grid (left) and the gas transmission infrastructure (right) for Great Britain. Figure adapted from Reference [243].
Figure 4. Geographical and functional infrastructure interdependence between the national electricity grid (left) and the gas transmission infrastructure (right) for Great Britain. Figure adapted from Reference [243].
Processes 08 00312 g004
Table 1. Elements related to nodes and links for a variety of engineering systems.
Table 1. Elements related to nodes and links for a variety of engineering systems.
NodesLinksTopologyFlowQuality of ServiceChallenges
Electricitytransformers, userspower linesquasi-planar, radialelectric loadcontinue servicepeak demand
substationscablessmall-world, core-p.Ohm’s, Kirchhoffmeeting demandenergy cuts
Gastransformers, userstransmission linesquasi-planarliquid gascompositionsafety
gas stationspipelines, valvessmall-world, core-p.Floyd algorithmmeeting demandenergy cuts
Watertanks, userspump stationsquasi-planarwaterdrinking waterlow pressure
reservoirspipes, valvescore-peripheryhydraulic lawsquantity, pressurecontamination
Transportationcitiesrailwaysquasi-planar, radialvehicles, commoditiessafetyaccidents
stationsroads, streetsqcore-peripherycirculation rulessynchronisationdelays
Telecom.computers, routerscablesquasi-planar, radialvoice, data, videoqualitydisruption
peripheral deviceswirelesscore-peripherymany-to-manyspeedubiquity
Table 2. Some general properties (randomness, mean path length, and clustering coefficient) of main theoretical graph structures: Summary of parts of Albert and Barabási [59].
Table 2. Some general properties (randomness, mean path length, and clustering coefficient) of main theoretical graph structures: Summary of parts of Albert and Barabási [59].
Graph StructureRandomnessMean PathClustering Coeff.
Regular graphOrderedLongHigh
Small worldMediumMediumHigh
Scale freeMedium-highShortMedium
Random graphDisorderedShortLow
Table 3. Summary of main agent properties.
Table 3. Summary of main agent properties.
CriteriaPropertyDescriptionRelevance
LocationSituatednessAgent is situated within and is a part of an environment [117].Essential
MobilityAble to travel across networks [104] and transport itself among different machines [117]Optional
AbilitiesAutonomyDifferent views.
Absolute: the ability to manipulate its own capabilities [118].
Relative to other entities, subjects or functions, ability to perform an action with independence of others [119], e.g., operate with no human guidance [104].
Essential
PerceptionAbility to perceive environment through sensors, with a perception referring to an instant input and a perception sequence to the complete history [120].Essential
CommunicationAgents communicate with other agents, even people [117]Essential
AdaptationAgent learns, i.e., uses previous experience to change environment [117]Optional
BehaviourReactivityAgent responds in timely fashion to changes in environment [117,121]Essential
Pro-activenessAgents have a purpose (goal) beyond acting in response to environment [117]; they take the initiative to satisfy these goals [121].
Agents follow a deliberation process that includes reasoning, planning, negotiating, and coordinating with other agents [104].
Optional
RationalityAgents are expected to choose actions that maximise their expected performance [120]Optional
SocialAgents have dynamic interactions with others that influence their behaviour [106].Essential
Table 4. Swarms and formations; differences according to Reference [107].
Table 4. Swarms and formations; differences according to Reference [107].
SwarmFormation
StructureLowHigh
Quantity of agentsHighLow
Motion dynamicsUncertaintyDeterministic

Share and Cite

MDPI and ACS Style

Herrera, M.; Pérez-Hernández, M.; Kumar Parlikad, A.; Izquierdo, J. Multi-Agent Systems and Complex Networks: Review and Applications in Systems Engineering. Processes 2020, 8, 312. https://doi.org/10.3390/pr8030312

AMA Style

Herrera M, Pérez-Hernández M, Kumar Parlikad A, Izquierdo J. Multi-Agent Systems and Complex Networks: Review and Applications in Systems Engineering. Processes. 2020; 8(3):312. https://doi.org/10.3390/pr8030312

Chicago/Turabian Style

Herrera, Manuel, Marco Pérez-Hernández, Ajith Kumar Parlikad, and Joaquín Izquierdo. 2020. "Multi-Agent Systems and Complex Networks: Review and Applications in Systems Engineering" Processes 8, no. 3: 312. https://doi.org/10.3390/pr8030312

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop