Workspace Partitioning and Topology Discovery Algorithms for Heterogeneous Multi-Agent Networks
In this paper, we consider a class of workspace partitioning problems that arise in the context of area coverage and spatial load balancing for spatially distributed heterogeneous multi-agent networks. It is assumed that each agent has certain directions of motion or directions for sensing and exploration that are more preferable than others. These preferences are measured by means of convex and anisotropic (direction-dependent) quadratic proximity metrics which are, in general, different for each agent. These proximity metrics induce Voronoi-like partitions of the network's workspace that are comprised of cells which may not always be convex (or even connected) sets but are necessarily contained in ellipsoids that are known to their corresponding agents. The main contributions of this work are 1) a distributed algorithm for the computation of a Voronoi-like partition of the workspace of a heterogeneous multi-agent network and 2) a systematic process to discover the network topology induced by the latter Voronoi-like partition. Numerical simulations that illustrate the efficacy of the proposed algorithms are also presented.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Unsupervised Place Discovery for Place-Specific Change Classifier
In this study, we address the problem of supervised change detection for robotic map learning applications, in which the aim is to train a place-specific change classifier (e.g., support vector machine (SVM)) to predict …
Change DetectionOpen-Ended Question AnsweringVisual Place RecognitionDataSpace: Benchmarking Data Agents for Verifiable Analytics over Heterogeneous Workspaces
Data agents enable natural-language analytics over organizational workspaces, where relevant evidence may be scattered across databases, structured files, long documents, and multimedia. Existing benchmarks largely isola…
RCD-SGD: Resource-Constrained Distributed SGD in Heterogeneous Environment via Submodular Partitioning
The convergence of SGD based distributed training algorithms is tied to the data distribution across workers. Standard partitioning techniques try to achieve equal-sized partitions with per-class population distribution …
Differentiable Mathematical Programming for Object-Centric Representation Learning
We propose topology-aware feature partitioning into $k$ disjoint partitions for given scene features as a method for object-centric representation learning. To this end, we propose to use minimum $s$-$t$ graph cuts as a …
ObjectObject DiscoveryRepresentation LearningLocal Discovery by Partitioning: Polynomial-Time Causal Discovery Around Exposure-Outcome Pairs
Causal discovery is crucial for causal inference in observational studies, as it can enable the identification of valid adjustment sets (VAS) for unbiased effect estimation. However, global causal discovery is notoriousl…
Causal DiscoveryCausal Inferencevalid