4 research outputs found
Heterogeneous Swarms for Maritime Dynamic Target Search and Tracking
Current strategies employed for maritime target search and tracking are
primarily based on the use of agents following a predetermined path to perform
a systematic sweep of a search area. Recently, dynamic Particle Swarm
Optimization (PSO) algorithms have been used together with swarming multi-robot
systems (MRS), giving search and tracking solutions the added properties of
robustness, scalability, and flexibility. Swarming MRS also give the end-user
the opportunity to incrementally upgrade the robotic system, inevitably leading
to the use of heterogeneous swarming MRS. However, such systems have not been
well studied and incorporating upgraded agents into a swarm may result in
degraded mission performances. In this paper, we propose a PSO-based strategy
using a topological k-nearest neighbor graph with tunable exploration and
exploitation dynamics with an adaptive repulsion parameter. This strategy is
implemented within a simulated swarm of 50 agents with varying proportions of
fast agents tracking a target represented by a fictitious binary function.
Through these simulations, we are able to demonstrate an increase in the
swarm's collective response level and target tracking performance by
substituting in a proportion of fast buoys.Comment: Accepted for IEEE/MTS OCEANS 2020, Singapor
Recommended from our members
Towards a swarm robotic approach for cooperative object recognition
Social insects have inspired the behaviours of swarm robotic systems for the last 20 years. Interactions of the simple individuals in these swarms form solutions to relatively complex problems. A novel swarm robotic method is investigated for future robotic cooperative object recognition tasks. Previous multi-agent systems involve cameras and image analyses to identify objects. They cooperate only to improve their hypotheses of the shape's identity. The system proposed uses agents whose interactions with each other around the physical boundaries of the object's shape allow the distinguishing features found. The agents are a physical embodiment of the vision system, making them suitable for environments where it would not be possible to use a camera. A Simplified Hexagonal Model was developed to simulate and examine the strategies. The hexagonal cells of which can be empty, contain an agent (hBot) or part of an object shape. Initially the hBots are required to identify the valid object shapes from a set of two types of known shapes. To do this the hBots change state when in contact with an object and when touching other hBots of the same state level, where some states are only achieved when neighbouring certain object shapes. The agents are oblivious, anonymous and homogeneous. They also do not know their position or orientation and cannot distinguish between object shapes alone due to their limited sensor range. Further work increased the number of object shapes to provide a range of scenarios
Using MapReduce Streaming for Distributed Life Simulation on the Cloud
Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp