Special Issue "Algorithms for Systems of Autonomous and Mobile Computational Entities"

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Analysis of Algorithms and Complexity Theory".

Deadline for manuscript submissions: 31 May 2021.

Special Issue Editors

Dr. Mattia D'Emidio
E-Mail Website
Guest Editor
Department of Information Engineering, Computer Science and Mathematics, University of L’Aquila, Via Vetoio, I–67100 L’Aquila, Italy
Interests: design and efficient implementation of algorithms; experimental algorithmics; algorithms for massive datasets; distributed algorithms
Special Issues and Collections in MDPI journals
Prof. Dr. Alfredo Navarra
E-Mail Website
Guest Editor
Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, via Vanvitelli 1, I-06123 Perugia, Italy
Interests: algorithms; complexity; distributed computing; networking

Special Issue Information

Dear Colleagues,

This Special Issue aims to attract original research contributions on modeling, computability, and algorithmic aspects of Multi-entity Computing Systems (MCSs).

In their most general acceptation, MCSs can be characterized as a set of autonomous and mobile entities, i.e., both equipped with some form of computational power and motion capabilities, that operate in a shared environment, such as, e.g., Euclidean space or graphs, to accomplish some global (computational) tasks.

Several real-world technologies of prominent practical impact can be modeled as MCSs, examples of which include, among others, the following: multi-robot computing systems, robotic swarms, networks of software agents, web crawlers, viruses, flocks of drones or UAVs, ant colonies, mobile wireless sensor networks, and systems of programmable particles.

Due to the increasing importance of MCSs applications, in the last decade, we have witnessed the rise of an essentially entirely new field of computer science and engineering, dedicated to research on the algorithmic properties of MCSs.

In fact, despite the very different nature of the specific application domains, these systems share several features from both the abstraction and the computational viewpoints that make them suited for being studied by a systematic rigorous approach.

Specifically, proper design, analysis, and deployment of algorithms for MCSs require a combination of efforts from various consolidated areas such as distributed computing, computational geometry, computability theory, algorithm engineering, control theory, and combinatorics.

The main objectives of this very active research field are identifying effective modeling methodologies and determining which tasks can be performed by the entities, under which conditions, and, if possible, at what cost.

In particular, the central question is to determine the minimal set of assumptions that allow tasks of practical relevance to be accomplished, and to accordingly design robust, reliable, and efficient algorithmic solutions.

We solicit the submission of original contributions and new scientific results on MCSs, broadly speaking, including the following: design and analysis of algorithms for MCSs, engineering of MCSs, theoretical advancements on the analysis of the computational properties of MCSs, experimental evaluation of MCSs, and simulation platforms. High-quality survey contributions are also welcome.

Topics of interest related to MCSs include (but are not limited to) the following:

  • Algorithms, complexity, and computability;
  • Algorithm Engineering;
  • Impossibility results;
  • Mobile computing;
  • Distributed algorithms;
  • Self-organization of mobile entities;
  • Dynamic algorithms and data structures;
  • Self-stabilization;
  • Experimental algorithmics and heuristics;
  • Multi-robot computing systems;
  • Multi-agent systems;
  • Sensors and ad-hoc networks;
  • Population protocols;
  • Programmable particles and nanoscale robots (programmable matter);
  • Entities in adversarial settings;
  • Networked systems and distributed robotics;
  • Empirical studies and industrial experience;
  • Programming frameworks, languages, models, and abstractions;
  • Swarm and collective behavior;
  • Precision agriculture and smart farming;
  • Delivery by drones;
  • Localization and synchronization;
  • Simulation techniques, tools, and platforms;
  • Cyber-physical systems;
  • Algorithmic game theory;
  • Internet of things;
  • Data aggregation and fusion;
  • Large-scale multi-entity computing systems;
  • Fault-tolerance and dependability.

Prof. Dr. Mattia D'Emidio
Prof. Dr. Alfredo Navarra
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 papers will be 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. Algorithms 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 1400 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.

Published Papers (1 paper)

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


Open AccessArticle
k-Circle Formation and k-epf by Asynchronous Robots
Algorithms 2021, 14(2), 62; https://doi.org/10.3390/a14020062 - 18 Feb 2021
Viewed by 523
For a given positive integer k, the k-circle formation problem asks a set of autonomous, asynchronous robots to form disjoint circles having k robots each at distinct locations, centered at a set of fixed points in the Euclidean plane. The robots [...] Read more.
For a given positive integer k, the k-circle formation problem asks a set of autonomous, asynchronous robots to form disjoint circles having k robots each at distinct locations, centered at a set of fixed points in the Euclidean plane. The robots are identical, anonymous, oblivious, and they operate in Look–Compute–Move cycles. This paper studies the k-circle formation problem and its relationship with the k-epf problem, a generalized version of the embedded pattern formation problem, which asks exactly k robots to reach and remain at each fixed point. First, the k-circle formation problem is studied in a setting where the robots have an agreement on the common direction and orientation of one of the axes. We have characterized all the configurations and the values of k, for which the k-circle formation problem is deterministically unsolvable in this setting. For the remaining configurations and the values of k, a deterministic distributed algorithm has been proposed, in order to solve the problem. It has been proved that for the initial configurations with distinct robot positions, if the k-circle formation problem is deterministically solvable then the k-epf problem is also deterministically solvable. It has been shown that by modifying the proposed algorithm, the k-epf problem can be solved deterministically. Full article
Show Figures

Figure 1

Back to TopTop