Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Serafino Cicerone"'
Publikováno v:
IEEE Access, Vol 11, Pp 15701-15724 (2023)
Research in theoretical swarm robotics focuses on models that assign to robots a minimal set of capabilities. One of the models well investigated is certainly $\mathcal {OBLOT}$ , addressing the case of distributed robots that are, anonymous, without
Externí odkaz:
https://doaj.org/article/cfb877334c5f4e7b941ed5ebae158e3f
Publikováno v:
IEEE Access, Vol 9, Pp 41540-41557 (2021)
The study of mobile entities that based on local information have to accomplish global tasks is of main interest for the scientific community. Classic models for the activation and synchronization of mobile entities are the fully-synchronous (FSync),
Externí odkaz:
https://doaj.org/article/7fc5d2f47e13415a90181eedbced89e6
Publikováno v:
IEEE Access, Vol 9, Pp 88177-88204 (2021)
Among fundamental problems in the context of distributed computing by mobile robots, the Pattern Formation (PF) is certainly the most representative. Given a multi-set $F$ of points in the Euclidean plane and a set $R$ of robots such that $|R|=|F|$ ,
Externí odkaz:
https://doaj.org/article/9ff05dbfbfc04b819c58f992d92fae8a
Autor:
Serafino Cicerone
Publikováno v:
IEEE Access, Vol 9, Pp 147855-147873 (2021)
Concerning the coordination of autonomous mobile robots, the main focus has been on the important class of Pattern Formation problems, where the robots are required to arrange themselves to form a given geometric shape. This class of problems has bee
Externí odkaz:
https://doaj.org/article/f0cedc8b802543eba4cbfa4d48a001e3
Autor:
Serafino Cicerone, Gabriele Di Stefano
Publikováno v:
PeerJ Computer Science, Vol 7, p e627 (2021)
In this paper, we consider the graph class denoted as Gen(∗;P3,C3,C5). It contains all graphs that can be generated by the split composition operation using path P3, cycle C3, and any cycle C5 as components. This graph class extends the well-known
Externí odkaz:
https://doaj.org/article/3575b035694d4613b37a265352e2e2df
Autor:
Serafino Cicerone, Gabriele Di Stefano
Publikováno v:
Algorithms, Vol 14, Iss 5, p 150 (2021)
The mixture of data in real life exhibits structure or connection property in nature. Typical data include biological data, communication network data, image data, etc. Graphs provide a natural way to represent and analyze these types of data and the
Externí odkaz:
https://doaj.org/article/4b116b8d92db4f22b7b76919fae0267b
Autor:
Serafino Cicerone
Publikováno v:
Algorithms, Vol 14, Iss 4, p 105 (2021)
Cicerone and Di Stefano defined and studied the class of k-distance-hereditary graphs, i.e., graphs where the distance in each connected induced subgraph is at most k times the distance in the whole graph. The defined graphs represent a generalizatio
Externí odkaz:
https://doaj.org/article/09180fdcc2144c0e860cfe602fdf8d66
Publikováno v:
Proceedings of the 24th International Conference on Distributed Computing and Networking.
Publikováno v:
Information Sciences. 574:111-132
Following the wide investigation in distributed computing issues by mobile entities of the last two decades, we consider the need of a structured methodology to tackle the arisen problems. The aim is to simplify both the design of the resolution algo
Publikováno v:
Applied Mathematics and Computation. 438:127619
Given a graph $G=(V(G), E(G))$ and a set $P\subseteq V(G)$, the following concepts have been recently introduced: $(i)$ two elements of $P$ are \emph{mutually visible} if there is a shortest path between them without further elements of $P$; $(ii)$ $