Searcharxiv⌕ Search

arXiv subjects

Antonia Maria Masucci

Publications and source records attributed to Antonia Maria Masucci.

4 recordsLinked to original sources

CoAdapt: An LLM-based Framework for Adaptive Collaborative Perception in IIoT Robotic Swarms

Industrial IoT environments increasingly deploy autonomous mobile robots for tasks such as material handling, product assembly, or infrastructure inspection. In such deployments, collaborative perception enables robots to share LiDAR observations and collectively construct a richer model of their environment than an individual agent could produce alone. However, industrial environments are dynamic spaces where robot positions shift continuously, network bandwidth fluctuates, and the marginal contribution of robots to perception quality varies at runtime. Existing collaborative perception approaches are designed for static participation assumptions and cannot adapt to these dynamics without sacrificing either detection precision or communication efficiency. This paper presents CoAdapt, an adaptive collaborative perception framework for IIoT robotic swarms in which a Large Language Model (LLM) serves as a runtime fusion controller, jointly deciding which robots participate in the fusion process and which fusion algorithm to apply based on the current spatial configuration and network state. The LLM reasons over structured natural language descriptions of the scene derived from raw LiDAR point clouds, requiring no taskspecific training and generalizing to unseen swarm topologies. Evaluated on the OPV2V benchmark across 25 scenarios, our approach achieves a 38% reduction in communication cost while maintaining detection precision comparable to static baseline approaches.

cs.AI↗

Defensive Resource Allocation in Social Networks

In this work, we are interested on the analysis of competing marketing campaigns between an incumbent who dominates the market and a challenger who wants to enter the market. We are interested in (a) the simultaneous decision of how many resources to allocate to their potential customers to advertise their products for both marketing campaigns, and (b) the optimal allocation on the situation in which the incumbent knows the entrance of the challenger and thus can predict its response. Applying results from game theory, we characterize these optimal strategic resource allocations for the voter model of social networks.

cs.SI↗

Strategic Resource Allocation for Competitive Influence in Social Networks

One of the main objectives of data mining is to help companies determine to which potential customers to market and how many resources to allocate to these potential customers. Most previous works on competitive influence in social networks focus on the first issue. In this work, our focus is on the second issue, i.e., we are interested on the competitive influence of marketing campaigns who need to simultaneously decide how many resources to allocate to their potential customers to advertise their products. Using results from game theory, we are able to completely characterize the optimal strategic resource allocation for the voter model of social networks and prove that the price of competition of this game is unbounded. This work is a step towards providing a solid foundation for marketing advertising in more general scenarios.

cs.SI↗

Information Spreading on Almost Torus Networks

Epidemic modeling has been extensively used in the last years in the field of telecommunications and computer networks. We consider the popular Susceptible-Infected-Susceptible spreading model as the metric for information spreading. In this work, we analyze information spreading on a particular class of networks denoted almost torus networks and over the lattice which can be considered as the limit when the torus length goes to infinity. Almost torus networks consist on the torus network topology where some nodes or edges have been removed. We find explicit expressions for the characteristic polynomial of these graphs and tight lower bounds for its computation. These expressions allow us to estimate their spectral radius and thus how the information spreads on these networks.

cs.SI↗