To deploy a large group of autonomous robots in dynamic multi-tasking environments, a suitable multi-robot task-allocation (MRTA) solution is required. This must be scalable to variable number of robots and tasks. Recent studies show that biology-inspired self-organized approaches can effectively handle task-allocation in large multi-robot systems. However most existing MRTA approaches have overlooked the role of different communication and sensing strategies found in selfregulated biological societies. This dissertation proposes to solve the MRTA problem using a set of previously published generic rules for division of labour derived from the observation of ant,human and robotic social systems. The concrete form of these rules, the attractive field model (AFM), provides sufficient abstraction to local communication and sensing which is uncommon in existing MRTA solutions. This dissertation validates the effectiveness of AFM to address MRTA using two bio-inspired communication and sensing strategies: "global sensing - no communication" and "local sensing - local communication". The former is realized using a centralized communication system and the latter is emulated under a peer-topeer local communication scheme. They are applied in a manufacturing shop-floor scenario using 16 e-puck robots. A robotic interpretation of AFM is presented that maps the generic parameters of AFM to the properties of a manufacturing shopfloor. A flexible multi-robot control architecture, hybrid event-driven architecture on D-Bus, has been outlined which uses the state-of-the-art D-Bus interprocess communication to integrate heterogeneous software components. Based-on the organization of task-allocation, communication and interaction among robots, a novel taxonomy of MRTA solutions has been proposed to remove the ambiguities found in existing MRTA solutions. Besides, a set of domainindependent metrics, e.g., plasticity, task-specialization and energy usage, has been formalized to compare the performances of the above two strategies. The presented comparisons extend our general understanding of the role of information exchange strategies to achieve the distributed task-allocations among various social groups.

This thesis analyzes the implementation of a testing algorithm, Particle Swarm Optimization, biologically inspired optimization method. Introduce us briefly with evolutionary algorithms, analyzes in detail the PSO algorithm and its parameters. Testing is performed on numerical, nominal, and binary data. The application contains graphical user interface. The algorithm is compared with genetic algorithm at the end and results are appropriately discussed.

No description available.

Approved for public release; distribution is unlimited. / An autonomously guided rocket-powered delivery vehicle has been under development at the Naval Postgraduate School. Designed to eventually counter UAV swarm attacks, the vehicle made advances toward reaching a target in the sky. These advances reduced the time needed to launch, modify, and relaunch the rocket, while adding capabilities such as data transfer along the vehicle axis and the rapid download of flight data. Improving the vehicle included reconfiguring the guidance, navigation, and control (GNC) strategy. Advancements included the design, implementation, and evaluation of electronic servo control, actuating fins, and the mechanical coupling design. The forward compartment in the vehicle’s nose cone was structurally modified for the GNC equipment and to support electronics under high-g launch conditions. Modifications included innovative designs for managing heat transfer requirements. Using off-the-shelf subsystem components kept the advancements fiscally mindful. After implementing the design features, two final test launches were performed: one demonstrated a control spin rate of 8.5 rad/sec; the other showed the vehicle’s ability to execute pitch maneuvers on a single axis. The test results can be used to improve the GNC software and servo control parameters. Continued development will allow the system to become a viable option for countering UAV swarms. / Ensign, United States Navy

No description available.

Real-world optimisation problems often are of a dynamic nature. Recently, much research has been done to apply particle swarm optimisation (PSO) to dynamic environments (DE). However, these research efforts generally focused on optimising one variation of the PSO algorithm for one type of DE. The aim of this work is to develop a more comprehensive view of PSO for DEs. This thesis studies different schemes of characterising and taxonomising DEs, performance measures used to quantify the performance of optimisation algorithms applied to DEs, various adaptations of PSO to apply PSO to DEs, and the effectiveness of these approaches on different DE types. The standard PSO algorithm has shown limitations when applied to DEs. To overcome these limitations, the standard PSO can be modi ed using personal best reevaluation, change detection and response, diversity maintenance, or swarm sub-division and parallel tracking of optima. To investigate the strengths and weaknesses of these approaches, a representative sample of algorithms, namely, the standard PSO, re-evaluating PSO, reinitialising PSO, atomic PSO (APSO), quantum swarm optimisation (QSO), multi-swarm, and self-adapting multi-swarm (SAMS), are empirically analysed. These algorithms are analysed on a range of DE test cases, and their ability to detect and track optima are evaluated using performance measures designed for DEs. The experiments show that QSO, multi-swarm and reinitialising PSO provide the best results. However, the most effective approach to use depends on the dimensionality, modality and type of the DEs, as well as on the objective of the algorithm. A number of observations are also made regarding the behaviour of the swarms, and the influence of certain control parameters of the algorithms evaluated. Copyright / Dissertation (MSc)--University of Pretoria, 2012. / Computer Science / unrestricted

An exploratory analysis in low-dimensional objective space of the vector evaluated particle swarm optimization (VEPSO) algorithm is presented. A novel visualization technique is presented and applied to perform the exploratory analysis. The exploratory analysis together with a quantitative analysis revealed that the VEPSO algorithm continues to explore without exploiting the well-performing areas of the search space. A detailed investigation into the influence that the choice of archive implementation has on the performance of the VEPSO algorithm is presented. Both the Pareto-optimal front (POF) solution diversity and convergence towards the true POF is considered during the investigation. Attainment surfaces are investigated for their suitability in efficiently comparing two multi-objective optimization (MOO) algorithms. A new measure to objectively compare algorithms in multi-dimensional objective space, based on attainment surfaces, is presented. This measure, referred to as the porcupine measure, adapts the attainment surface measure by using a statistical test along with weighted intersection lines. Loosely based on the VEPSO algorithm, the multi-guided particle swarm optimization (MGPSO) algorithm is presented and evaluated. The results indicate that the MGPSO algorithm overcomes the weaknesses of the VEPSO algorithm and also outperforms a number of state of the art MOO algorithms on at least two benchmark test sets. / Thesis (PhD)--University of Pretoria, 2017. / Computer Science / PhD / Unrestricted

Finding safe trajectories for multiagent autonomous systems can be difficult, especially as multiple robots and obstacles are added to the system. Control barrier functions (CBFs) have been effective in addressing this problem. Although the use of CBFs for guaranteeing safe operation is well established, there is no standard software implementation to simplify the integration of these techniques into robotic systems. We present a CBF Toolbox to fill this void. Although the CBF Toolbox can be used to ensure safety based on local control decisions, it may not be sufficient to guide a robots to their goals in certain environments. In these cases, path planning algorithms are required. We present one such algorithm, which is the multiagent extension of the CBF guided rapidly-exploring random trees (CBF-RRT) to demonstrate how the CBF Toolbox can be applied. This work addresses the theory behind the CBF Toolbox, as well as presenting examples of how it is applied to multiagent systems. Examples are shown for its use in both simulation and hardware experiments. Details are provided on CBF guided rapidly-exploring random trees (CBF-RRT), and its application to multiagent systems with multiagent CBF-RRT (MA-CBF-RRT) that streamlines safe path planning for teams of robots.

The goal of the research activities presented in this thesis is the design of intelligent behaviours for a complex robotic system, which is composed of a swarm of autonomous units. Inspired by the organisational skills of social insects, we are particularly interested in the study of collective behaviours based on self-organisation.<p><p>The problem of designing self-organising behaviours for a swarm of robots is tackled resorting to artificial evolution, which proceeds in a bottom-up direction by first defining the controllers at the individual level and then testing their effect at the collective level. In this way, it is possible to bypass the difficulties encountered in the decomposition of the global behaviour into individual ones, and the further encoding of the individual behaviours into the controllers' rules. In the experiments presented in this thesis, we show that this approach is viable, as it produces efficient individual controllers and robust self-organising behaviours. To the best of our knowledge, our experiments are the only example of evolved self-organising behaviours that are successfully tested on a physical robotic platform.<p><p>Besides the engineering value, the evolution of self-organising behaviours for a swarm of robots also provides a mean for the understanding of those biological processes that were a fundamental source of inspiration in the first place. In this perspective, the experiments presented in this thesis can be considered an interesting instance of a synthetic approach to the study of collective intelligence and, more in general, of Cognitive Science.<p> / Doctorat en sciences appliquées / info:eu-repo/semantics/nonPublished

No description available.