Analysis of a Swarm Approach to Building Voronoi Diagrams

نویسندگان

  • Ryan McCune
  • Greg Madey
چکیده

Big Data is challenging traditional methods of engineering. The dramatic increases in information volume, velocity, and variety are rendering centralized approaches less practical. Swarm intelligence describes multi-agent systems that utilize emergent behavior to solve complex problems. Such systems exhibit desirable traits like scalability and robustness, but are not yet well understood. To begin formulating universal properties of swarms and to identify design methodologies, we can solve traditionally centralized problems using swarms to draw comparisons and filter distinctions. In this paper, we engineer a biologically-inspired swarm system that solves two spatial problems. First, we introduce a novel ant colony system adapted for clustering based on k-means. Second, we demonstrate how a simple modification to ant foraging behavior can yield the Voronoi Diagram for the chosen clusters. The system is modeled with an agent-based simulation. Analysis of swarm runtimes will be discussed. Through these two examples of swarm problem solving, we aim to further distinguish general swarm properties and swarm engineering design methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CoDA: Collaborative Data Aggregation in Emerging Sensor Networks Using Bio-Level Voronoi Diagrams

To implement minimum power consumption of the link, cluster heads adopt the multi-hop manner for inter-cluster communication so as to forward the aggregation data to the relay nodes. This paper proposes a collaborative data aggregation in emerging sensor networks using a bio-level Voronoi diagram, which is an energy-efficient data aggregation protocol that integrates topology control, Multiple ...

متن کامل

Bregman Voronoi Diagrams: Properties, Algorithms and Applications

The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define many variants of Voronoi diagrams depending on the class of objects, the distance functions and the embedding space. In this paper, we investigate a framework...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

A Heuristic Approach for Optimization of Gearbox Dimension

A powerful optimization method is proposed in this study for the minimal dimensional design problem of gearbox. It is a general model that is suitable to use for any series of gear drives system and can extract both dimensional and layout of components-limited optimization design together. The objective function in this study has many local extremes so for avoiding this situation, various const...

متن کامل

Hierarchical Data Representations Based on Planar Voronoi Diagrams

Multiresolution representation of high-dimensional scattered data is a fundamental problem in scientific visualization. This paper introduces a data hierarchy of Voronoi diagrams as a versatile solution. Given an arbitrary set of points in the plane, our goal is the construction of an approximation hierarchy using the Voronoi diagram as the essential building block. We have implemented two Voro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013