Search

The use of the Chinese Remainder Theorem (CRT) with non-coprime moduli in constructing error-correcting codes is studied. The applicability and advantages of the codes are shown by comparing them to both CRT codes with coprime moduli and repetition codes.

We present a method for constructing reduced-order state observers for linear systems with unknown inputs. Our approach provides a characterization of observers with delay, which eases the established necessary conditions for existence of unknown input observers with zero-delay. We develop a parameterization of the observer gain that decouples the unknown inputs from the estimation error, and we use the remaining freedom to ensure stability of the error dynamics. Our procedure is quite general in that it encompasses the design of full-order observers via appropriate choices of design matrices. Index Terms--State estimation, system inversion, unknown input observer.

We consider the problem of distributed inference where agents in a network observe a stream of private signals generated by an unknown state, and aim to uniquely identify this state from a finite set of hypotheses. We focus on scenarios where communication between agents is costly, and takes place over channels with finite bandwidth. To reduce the frequency of communication, we develop a novel event-triggered distributed learning rule that is based on the principle of diffusing low beliefs on each false hypothesis. Building on this principle, we design a trigger condition under which an agent broadcasts only those components of its belief vector that have adequate innovation, to only those neighbors that require such information. We prove that our rule guarantees convergence to the true state exponentially fast almost surely despite sparse communication, and that it has the potential to significantly reduce information flow from uninformative agents to informative agents. Next, to deal with finite-precision communication channels, we propose a distributed learning rule that leverages the idea of adaptive quantization. We show that by sequentially refining the range of the quantizers, every agent can learn the truth exponentially fast almost surely, while using just 1 bit to encode its belief on each hypothesis. For both our proposed algorithms, we rigorously characterize the trade-offs between communication-efficiency and the learning rate. [ABSTRACT FROM AUTHOR]

Consider a set of vectors in Rn, partitioned into two classes: normal vectors and malicious vectors, for which the number of malicious vectors is bounded but their identities are unknown. The paper provides an efficient way for achieving a resilient convex combination, which is a convex combination of only normal vectors. Compared with existing approaches based on Tverberg points, the proposed method based on the intersection of convex hulls has lower computational complexity. Simulations suggest that the proposed method can be applied to achieve resilience of consensus-based distributed algorithms against Byzantine attacks based only on agents' locally available information. [ABSTRACT FROM AUTHOR]

Reliable estimation of vehicle speed is an active topic of research in the automotive industry and academia due to its technical challenges as well as applications to vehicle traction and stability control. In this direction, the emergence of new generations of communication technologies has brought new perspectives to traditional studies on vehicle speed estimation and control. To this end, this paper introduces a cooperative vehicle speed fault diagnosis and correction algorithm. The distributed part of the algorithm is based on a distributed function calculation algorithm for vehicle networks. The introduced algorithm enables each vehicle to gather some information from other vehicles in the network in a distributed manner and is robust to communication failures. A procedure to use such information for a single vehicle to diagnose and correct a possible fault in its own speed estimation/measurement is discussed. The functionality and performance of the proposed algorithms are verified via illustrative examples and simulation results. [ABSTRACT FROM AUTHOR]

We introduce a network design game where the objective of the players is to design the interconnections between the nodes of two different networks G1 and G2 in order to maximize certain local utility functions. In this setting, each player is associated with a node in G1 and has functional dependencies on certain nodes in G2 . We use a distance-based utility for the players in which the goal of each player is to purchase a set of edges (incident to its associated node) such that the sum of the distances between its associated node and the nodes it depends on G2 is minimized. We consider a heterogeneous set of players (i.e., players have their own costs and benefits for constructing edges). We show that finding a best response of a player in this game is NP-hard. Despite this, we characterize some properties of the best response actions, which are helpful in determining a Nash equilibrium for certain instances of this game. In particular, we prove the existence of pure Nash equilibria in this game when G2 contains a star subgraph, and provide an algorithm that outputs such an equilibrium for any set of players. Finally, we show that the price of anarchy in this game can be arbitrarily large. [ABSTRACT FROM AUTHOR]

Online learning has become increasingly popular on handling massive data. The sequential nature of online learning, however, requires a centralized learner to store data and update parameters. In this paper, we consider online learning with distributed data sources. The autonomous learners update local parameters based on local data sources and periodically exchange information with a small subset of neighbors in a communication network. We derive the regret bound for strongly convex functions that generalizes the work by Ram et al. for convex functions. More importantly, we show that our algorithm has intrinsic privacy-preserving properties, and we prove the sufficient and necessary conditions for privacy preservation in the network. These conditions imply that for networks with greater-than-one connectivity, a malicious learner cannot reconstruct the subgradients (and sensitive raw data) of other learners, which makes our algorithm appealing in privacy-sensitive applications. [ABSTRACT FROM AUTHOR]

We study the problem of stabilizing a linear system over a wireless network using a simple in-network computation method. Specifically, we study an architecture called the "Wireless Control Network" (WCN), where each wireless node maintains a state, and periodically updates it as a linear combination of neighboring plant outputs and node states. This architecture has previously been shown to have low computational overhead and beneficial scheduling and compositionality properties. In this paper we characterize fundamental topological conditions to allow stabilization using such a scheme. To achieve this, we exploit the fact that the WCN scheme causes the network to act as a linear dynamical system, and analyze the coupling between the plant's dynamics and the dynamics of the network. We show that stabilizing control inputs can be computed in-network if the vertex connectivity of the network is larger than the geometric multiplicity of any unstable eigenvalue of the plant. This condition is analogous to the typical min-cut condition required in classical information dissemination problems. Furthermore, we specify equivalent topological conditions for stabilization over a wired (or point-to-point) network that employs network coding in a traditional way — as a communication mechanism between the plant's sensors and decentralized controllers at the actuators. [ABSTRACT FROM PUBLISHER]

This paper addresses the problem of resilient in-network consensus in the presence of misbehaving nodes. Secure and fault-tolerant consensus algorithms typically assume knowledge of nonlocal information; however, this assumption is not suitable for large-scale dynamic networks. To remedy this, we focus on local strategies that provide resilience to faults and compromised nodes. We design a consensus protocol based on local information that is resilient to worst-case security breaches, assuming the compromised nodes have full knowledge of the network and the intentions of the other nodes. We provide necessary and sufficient conditions for the normal nodes to reach asymptotic consensus despite the influence of the misbehaving nodes under different threat assumptions. We show that traditional metrics such as connectivity are not adequate to characterize the behavior of such algorithms, and develop a novel graph-theoretic property referred to as network robustness. Network robustness formalizes the notion of redundancy of direct information exchange between subsets of nodes in the network, and is a fundamental property for analyzing the behavior of certain distributed algorithms that use only local information. [ABSTRACT FROM PUBLISHER]

Given an arbitrary network of interconnected nodes, we develop and analyze a distributed strategy that enables a subset of the nodes to calculate any given function of the node values. Our scheme utilizes a linear iteration where, at each time-step, each node updates its value to be a weighted average of its own previous value and those of its neighbors. We show that this approach can be viewed as a linear dynamical system, with dynamics that are given by the weight matrix of the linear iteration, and with outputs for each node that are captured by the set of values that are available to that node at each time-step. In connected networks with time-invariant topologies, we use observability theory to show that after running the linear iteration for a finite number of time-steps with almost any choice of weight matrix, each node obtains enough information to calculate any arbitrary function of the initial node values. The problem of distributed consensus via linear iterations, where all nodes in the network calculate the same function, is treated as a special case of our approach. In particular, our scheme allows nodes in connected networks with time-invariant topologies to reach consensus on any arbitrary function of the initial node values in a finite number of steps for almost any choice of weight matrix. [ABSTRACT FROM AUTHOR]

This article investigates the problem of communication-efficient and resilient multiagent reinforcement learning (MARL). Specifically, we consider a setting where a set of agents are interconnected over a given network, and can only exchange information with their neighbors. Each agent observes a common Markov Decision Process and has a local cost which is a function of the current system state and the applied control action. The goal of MARL is for all agents to learn a policy that optimizes the infinite horizon discounted average of all their costs. Within this general setting, we consider two extensions to existing MARL algorithms. First, we provide an event-triggered learning rule where agents only exchange information with their neighbors if a certain triggering condition is satisfied. We show that this enables learning while reducing the amount of communication. Next, we consider the scenario where some of the agents can be adversarial (as captured by the Byzantine attack model), and arbitrarily deviate from the prescribed learning algorithm. We establish a fundamental trade-off between optimality and resilience when Byzantine agents are present. We then create a resilient algorithm and show almost sure convergence of all reliable agents' value functions to the neighborhood of the optimal value function of all reliable agents, under certain conditions on the network topology. When the optimal Q -values are sufficiently separated for different actions, we show that all reliable agents can learn the optimal policy under our algorithm.

Precision livestock farming (PLF) offers a strategic solution to enhance the management capacity of large animal groups, while simultaneously improving profitability, efficiency, and minimizing environmental impacts associated with livestock production systems. Additionally, PLF contributes to optimizing the ability to manage and monitor animal welfare while providing solutions to global grand challenges posed by the growing demand for animal products and ensuring global food security. By enabling a return to the "per animal" approach by harnessing technological advancements, PLF enables cost-effective, individualized care for animals through enhanced monitoring and control capabilities within complex farming systems. Meeting the nutritional requirements of a global population exponentially approaching ten billion people will likely require the density of animal proteins for decades to come. The development and application of digital technologies are critical to facilitate the responsible and sustainable intensification of livestock production over the next several decades to maximize the potential benefits of PLF. Real-time continuous monitoring of each animal is expected to enable more precise and accurate tracking and management of health and well-being. Importantly, the digitalization of agriculture is expected to provide collateral benefits of ensuring auditability in value chains while assuaging concerns associated with labor shortages. Despite notable advances in PLF technology adoption, a number of critical concerns currently limit the viability of these state-of-the-art technologies. The potential benefits of PLF for livestock management systems which are enabled by autonomous continuous monitoring and environmental control can be rapidly enhanced through an Internet of Things approach to monitoring and (where appropriate) closed-loop management. In this paper, we analyze the multilayered network of sensors, actuators, communication, networking, and analytics currently used in PLF, focusing on dairy farming as an illustrative example. We explore the current state-of-the-art, identify key shortcomings, and propose potential solutions to bridge the gap between technology and animal agriculture. Additionally, we examine the potential implications of advancements in communication, robotics, and artificial intelligence on the health, security, and welfare of animals., (© The Author(s) 2023. Published by Oxford University Press on behalf of the American Society of Animal Science. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.)