Modern Trends in Multi-Agent Systems II

A special issue of Future Internet (ISSN 1999-5903). This special issue belongs to the section "Smart System Infrastructure and Applications".

Deadline for manuscript submissions: closed (31 January 2024) | Viewed by 1579

Special Issue Editors

Department of Engineering and Architecture, University of Parma, I-43124 Parma, Italy
Interests: distributed systems; software engineering; multi-agent systems; agent-based simulation
Special Issues, Collections and Topics in MDPI journals
Institute of Informatics, Slovak Academy of Sciences, Dúbravská cesta 9, 845 07 Bratislava, Slovakia
Interests: data aggregation; distributed computing; consensus; information fusion; multi-agent systems; wireless sensor networks
Special Issues, Collections and Topics in MDPI journals
Institute of Informatics, Slovak Academy of Sciences, Dúbravská cesta 9, 845 07 Bratislava, Slovakia
Interests: applied informatics; discrete systems modeling and simulation; multi agent systems; artificial intelligence; ontology engineering
Special Issues, Collections and Topics in MDPI journals
Institute of Informatics, Slovak Academy of Sciences, Dúbravská cesta 9, 845 07 Bratislava 45, Slovakia
Interests: grid architecture and grid computing; multi-agent systems and virtual networking; HPCN applications; parallel and distributed computing; architecture models; software technologies
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues, 

In general, the term "multi-agent system" (referred to as MAS) is understood to refer to an interconnected set of independent entities that are able to effectively solve complex and time-consuming problems exceeding the individual abilities of common problem solvers. The coordinated entities forming MAS regularly interact with each other in order to solve various problems in numerous technical/non-technical applications. In many modern MASs, the entities are required to be fully autonomous, to provide global decisions based on local knowledge, and to be able to work effectively in a decentralized way. The design of robust, energy-efficient, and high-performance algorithms for MASs therefore poses a demanding challenge for the wider scientific community. Thus, in recent decades, significant attention has been paid by many scientists to the optimization of the operation of MASs in many respects (routing, data aggregation, communication, coordination, consensus achievement, synchronization, etc.). This Special Issue is dedicated to the analysis and optimization of MASs from a broad perspective (including branches that are potentially applicable in MASs); therefore, potential topics include but are not limited to the following:

  • Wireless networks;
  • Internet of Things;
  • Distributed and parallel computing;
  • Cloud computing;
  • Data aggregation, sensor fusion;
  • Signal processing;
  • Modeling using big data from the multi-sensor systems;
  • Possibility theory;
  • Remote sensing data processing;
  • Artificial intelligence for multi-sensor fusion systems;
  • Routing protocols;
  • Communication protocols;
  • Optical systems.

Prof. Dr. Agostino Poggi
Dr. Martin Kenyeres
Dr. Ivana Budinská
Dr. Ladislav Hluchy
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Future Internet is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • multi-agent systems
  • Internet of Things
  • wireless sensor networks
  • data aggregation
  • remote sensing
  • distributed computing
  • parallel computing
  • cloud computing
  • artificial intelligence

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

24 pages, 3478 KiB  
Article
Distributed Average Consensus Algorithms in d-Regular Bipartite Graphs: Comparative Study
Future Internet 2023, 15(5), 183; https://doi.org/10.3390/fi15050183 - 16 May 2023
Viewed by 1253
Abstract
Consensus-based data aggregation in d-regular bipartite graphs poses a challenging task for the scientific community since some of these algorithms diverge in this critical graph topology. Nevertheless, one can see a lack of scientific studies dealing with this topic in the literature. [...] Read more.
Consensus-based data aggregation in d-regular bipartite graphs poses a challenging task for the scientific community since some of these algorithms diverge in this critical graph topology. Nevertheless, one can see a lack of scientific studies dealing with this topic in the literature. Motivated by our recent research concerned with this issue, we provide a comparative study of frequently applied consensus algorithms for distributed averaging in d-regular bipartite graphs in this paper. More specifically, we examine the performance of these algorithms with bounded execution in this topology in order to identify which algorithm can achieve the consensus despite no reconfiguration and find the best-performing algorithm in these graphs. In the experimental part, we apply the number of iterations required for consensus to evaluate the performance of the algorithms in randomly generated regular bipartite graphs with various connectivities and for three configurations of the applied stopping criterion, allowing us to identify the optimal distributed consensus algorithm for this graph topology. Moreover, the obtained experimental results presented in this paper are compared to other scientific manuscripts where the analyzed algorithms are examined in non-regular non-bipartite topologies. Full article
(This article belongs to the Special Issue Modern Trends in Multi-Agent Systems II)
Show Figures

Figure 1

Back to TopTop