Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "swarm" wg kryterium: Temat


Tytuł:
Quantifying swarm resilience with simulated exploration of maze-like environments
Autorzy:
Emmons, Megan
Maciejewski, Anthony A.
Powiązania:
https://bibliotekanauki.pl/articles/27314244.pdf
Data publikacji:
2023
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
swarm robotics
Opis:
Artificial swarms have the potential to provide robust, efficient solutions for a broad range of applications from assisting search and rescue operations to exploring remote planets. However, many fundamental obstacles still need to be overcome to bridge the gap between theory and application. In this characterization work, we demonstrate how a human rescuer can leverage mini‐ mal local observations of emergent swarm behavior to locate a lone survivor in a maze‐like environment. The simulated robots and rescuer have limited sensing and no communication capabilities to model a worst‐case scenario. We then explore the impact of fundamental properties at the individual robot level on the utility of the emergent behavior to direct swarm design choices. We further demonstrate the relative robustness of the simulated robotic swarm by quantifying how reasonable probabilistic failure affects the rescue time in a complex environment. These results are compared to the theo‐ retical performance of a single wall‐following robot to further demonstrate the potential benefits of utilizing robotic swarms for rescue operations.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2023, 17, 2; 3--11
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The effect of the state of the sea on the occurrence of krills swarms in the region of the South Orkney Islands
Autorzy:
Moczydłowski, Eugeniusz
Powiązania:
https://bibliotekanauki.pl/articles/2058269.pdf
Data publikacji:
1980
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Antarctic
krill swarm
Źródło:
Polish Polar Research; 1980, 1, 2-3; 147-153
0138-0338
2081-8262
Pojawia się w:
Polish Polar Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improvements to Glowworm Swarm Optimization algorithm
Ulepszenia algorytmu Glowworm Swarm Optimization
Autorzy:
Oramus, P.
Powiązania:
https://bibliotekanauki.pl/articles/305567.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
inteligencja roju
optymalizacja
swarm intelligence
glowworm swarm optimization
multimodal function optimization
Opis:
Glowworm Swarm Optimization algorithm is applied for the simultaneous capture of multiple optima of multimodal functions. The algorithm uses an ensemble of agents, which scan the search space and exchange information concerning a fitness of their current position. The fitness is represented by a level of a luminescent quantity called luciferin. An agent moves in direction of randomly chosen neighbour, which broadcasts higher value of the luciferin. Unfortunately, in the absence of neighbours, the agent does not move at all. This is an unwelcome feature, because it diminishes the performance of the algorithm. Additionally, in the case of parallel processing, this feature can lead to unbalanced loads. This paper presents simple modifications of the original algorithm, which improve performance of the algorithm by limiting situations, in which the agent cannot move. The paper provides results of comparison of an original and modified algorithms calculated for several multimodal test functions.
Algorytm Glowworm Swarm Optimization jest stosowany do równoczesnego odnajdywania wielu optimów funkcji multimodalnych. Algorytm używa zespołu agentów przeszukujących przestrzeń poszukiwań i wymieniających się informacjami o wartości funkcji przystosowania w danym położeniu. Funkcja przystosowania jest reprezentowana przez poziom emitującego światło pigmentu - lucyferyny. Agenci poruszają się w kierunku losowo wybranego sąsiada, który rozgłasza wyższą wartość poziomu lucyferyny. Niestety w przypadku braku sąsiadów agent nie porusza się wcale. Stanowi to niepożądaną cechę algorytmu ograniczającą jego wydajność. W przypadku przetwarzania równoległego cecha ta może prowadzić do niezrównoważenia obciążenia. Praca ta przedstawia proste modyfikacje oryginalnego algorytmu zwiększające jego wydajność poprzez ograniczanie liczby takich sytuacji, w których agent nie może się poruszyć. Przedstawione zostały wyniki porównania pracy oryginalnego i zmodyfikowanych algorytmów dla kilku funkcji testowych.
Źródło:
Computer Science; 2010, 11; 7-20
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparative study on multi-swarm optimisation and bat algorithm for unconstrained non linear optimisation problems
Autorzy:
Baidoo, E.
Opoku Oppong, S
Powiązania:
https://bibliotekanauki.pl/articles/117918.pdf
Data publikacji:
2016
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
swarm intelligence
bio-inspired
bat algorithm
multi-swarm optimisation
nonlinear optimisation
Opis:
A study branch that mocks-up a population of network of swarms or agents with the ability to self-organise is Swarm intelligence. In spite of the huge amount of work that has been done in this area in both theoretically and empirically and the greater success that has been attained in several aspects, it is still ongoing and at its infant stage. An immune system, a cloud of bats, or a flock of birds are distinctive examples of a swarm system. In this study, two types of meta-heuristics algorithms based on population and swarm intelligence - Multi Swarm Optimization (MSO) and Bat algorithms (BA) – are set up to find optimal solutions of continuous non-linear optimisation models. In order to analyze and compare perfect solutions at the expense of performance of both algorithms, a chain of computational experiments on six generally used test functions for assessing the accuracy and the performance of algorithms, in swarm intelligence fields are used. Computational experiments show that MSO algorithm seems much superior to BA.
Źródło:
Applied Computer Science; 2016, 12, 4; 59-77
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Ant Algorithm for the Sudoku Problem
Autorzy:
Schiff, K.
Powiązania:
https://bibliotekanauki.pl/articles/384822.pdf
Data publikacji:
2015
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
swarm optimization
Sudoku puzzle
Opis:
In this paper an ant algorithm for the Sudoku problem is presented. This is the first ant algorithm enabling discovery of an optimal solution to the Sudoku puzzle for 100% of investigated cases. The Sudoku is a one of many combinatorial optimisation problems, as well as an NPcomplete problem, hence an ant algorithm which constructs an optimal solution as a meta-heuristic method is important for this problem.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2015, 9, 2; 24-27
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Exit selection process during crowd evacuation, modelled on the cockroach emergent behaviour
Autorzy:
Zajdel, M.
Filipowicz, B.
Powiązania:
https://bibliotekanauki.pl/articles/200905.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
swarm
crowd
cockroach
ethology
behaviour
Opis:
Groups of living creatures are often faced with searching for resources and choosing between one or more alternatives of resource site. Such a process is connected either with calm food acquirement or looking for a safe place to hide from danger. The question is, what kind of criteria are taken into consideration and what induces the collective decision, when all individuals in a swarm are equal. This paper identifies a simple mechanism of shelter selection by cockroach herd, whereby an emergent decision is made with limited information and without centralization of information processing or comparison of available solutions. The mechanism leads to the optimal benefit for both a group and an individual. The proposed model activates swarm self-organization and is independent of species, therefore, a possible application to human crowd control has been studied.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 3; 557-563
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Controlling a robot swarm with EV3 modules for mobile indoor mapping
Autorzy:
Pawłowicz, B.
Sierpiński, M.
Trybus, B.
Powiązania:
https://bibliotekanauki.pl/articles/114160.pdf
Data publikacji:
2016
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
robot swarm
RFID
WinRT
EV3
Opis:
The goal of the paper is to present a lab application controlling a swarm of mobile robots built with Lego Mindstorms bricks of EV3 series. The application named BrickCenter is based on Windows Runtime (WinRT) architecture and allows the user to manage robots by controlling selected motors through a keyboard or a gamepad. The application is able to read measurements acquired from standard sensors connected to EV3 controllers. It is a basis for a concept of supervisory control of a robot swarm designed for indoor mapping with RFID readers.
Źródło:
Measurement Automation Monitoring; 2016, 62, 8; 274-277
2450-2855
Pojawia się w:
Measurement Automation Monitoring
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Overhead vision system for testing swarms and groups of wheeled robots
Autorzy:
Wiech, Jakub
Hendzel, Zenon
Powiązania:
https://bibliotekanauki.pl/articles/384852.pdf
Data publikacji:
2019
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
swarm robotics
vision system
wheeled robots
Opis:
The paper describes how to use ArUco markers to determine the position and orientation of wheeled robots in 3D space. it is preceded by a general description on the testbed and a detailed description on the marker detection algorithm along with the camera calibration using the ChaArUco markers. The camera has been described and calibrated using the pinhole camera model, taking into account distortion on the lens. The second part oo the article describes the wheeled robots with their mechanical construction.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2019, 13, 2; 15-22
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Swarm intelligence for network routing optimization
Autorzy:
Dempsey, P.
Schuster, A.
Powiązania:
https://bibliotekanauki.pl/articles/309012.pdf
Data publikacji:
2005
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
network routing
swarm intelligence
ant algorithms
Opis:
This paper presents the results of a comparative study of network routing approaches. Recent advances in the field suggest that swarm intelligence may offer a robust, high quality solution. The overall aim of the study was to develop a framework to facilitate the empirical evaluation of a swarm intelligence routing approach compared to a conventional static and dynamic routing approach. This paper presents a framework for the simulation of computer networks, collection of performance statistics, generation and reuse of network topologies and traffic patterns.
Źródło:
Journal of Telecommunications and Information Technology; 2005, 3; 24-28
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Swarm intelligence integrated approach for experimental investigation in milling of multiwall carbon nanotube/polymer nanocomposites
Autorzy:
Kharwar, Prakhar Kumar
Verma, Rajesh Kumar
Mandal, Nirmal Kumar
Mondal, Arpan Kumar
Powiązania:
https://bibliotekanauki.pl/articles/139582.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
nanocomposites
epoxy
particle
swarm
Pareto front
Opis:
In manufacturing industries, the selection of machine parameters is a very complicated task in a time-bound manner. The process parameters play a primary role in confirming the quality, low cost of manufacturing, high productivity, and provide the source for sustainable machining. This paper explores the milling behavior of MWCNT/epoxy nanocomposites to attain the parametric conditions having lower surface roughness (Ra) and higher materials removal rate (MRR). Milling is considered as an indispensable process employed to acquire highly accurate and precise slots. Particle swarm optimization (PSO) is very trendy among the nature-stimulated metaheuristic method used for the optimization of varying constraints. This article uses the non-dominated PSO algorithm to optimize the milling parameters, namely, MWCNT weight% (Wt.), spindle speed (N), feed rate (F), and depth of cut (D). The first setting confirmatory test demonstrates the value of Ra and MRR that are found as 1.62 µm and 5.69 mm3/min, respectively and for the second set, the obtained values of Ra and MRR are 3.74 µm and 22.83 mm3/min respectively. The Pareto set allows the manufacturer to determine the optimal setting depending on their application need. The outcomes of the proposed algorithm offer new criteria to control the milling parameters for high efficiency.
Źródło:
Archive of Mechanical Engineering; 2020, LXVII, 3; 353-376
0004-0738
Pojawia się w:
Archive of Mechanical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-swarm that learns
Autorzy:
Trojanowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/969816.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
particle swarm optimization (PSO)
multi-swarm
dynamic optimization
memory
clusters
clustering evolving data streams
quantum particles
Opis:
This paper studies particle swarm optimization approach enriched by two versions of an extension aimed at gathering information during the optimization process. Application of these extensions, called memory mechanisms, increases computational cost, but it is spent to a benefit by incorporating the knowledge about the problem into the algorithm and this way improving its search abilities. The first mechanism is based on the idea of storing explicit solutions while the second one applies one-pass clustering algorithm to build clusters containing search experiences. The main disadvantage of the former mechanism is lack of good rules for identification of outdated solutions among the remembered ones and as a consequence unlimited growth of the memory structures as the optimization process goes. The latter mechanism uses other form of knowledge representation and thus allows us to control the amount of allocated resources more efficiently than the former one. Both mechanisms have been experimentally verified and their advantages and disadvantages in application for different types of optimized environments are discussed.
Źródło:
Control and Cybernetics; 2010, 39, 2; 359-375
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A hybrid PSO approach for solving non-convex optimization problems
Autorzy:
Ganesan, T.
Vasant, P.
Elamvazuthy, I.
Powiązania:
https://bibliotekanauki.pl/articles/229756.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Kuhn-Tucker conditions (KT)
non-convex optimization
particle swarm optimization (PSO)
semi-classical particle swarm optimization (SPSO)
Opis:
The aim of this paper is to propose an improved particle swarm optimization (PSO) procedure for non-convex optimization problems. This approach embeds classical methods which are the Kuhn-Tucker (KT) conditions and the Hessian matrix into the fitness function. This generates a semi-classical PSO algorithm (SPSO). The classical component improves the PSO method in terms of its capacity to search for optimal solutions in non-convex scenarios. In this work, the development and the testing of the refined the SPSO algorithm was carried out. The SPSO algorithm was tested against two engineering design problems which were; ‘optimization of the design of a pressure vessel’ (P1) and the ‘optimization of the design of a tension/compression spring’ (P2). The computational performance of the SPSO algorithm was then compared against the modified particle swarm optimization (PSO) algorithm of previous work on the same engineering problems. Comparative studies and analysis were then carried out based on the optimized results. It was observed that the SPSO provides a better minimum with a higher quality constraint satisfaction as compared to the PSO approach in the previous work.
Źródło:
Archives of Control Sciences; 2012, 22, 1; 87-105
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of the Bee Swarm Optimization BSO to the Knapsack Problem
Autorzy:
Sotelo-Figueroa, M. A.
Baltazar, B.
Carpio, J. M.
Powiązania:
https://bibliotekanauki.pl/articles/384879.pdf
Data publikacji:
2011
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
swarm optimization
PSO
BA
BSO
knapsack problem
Opis:
Swarm Intelligence is the part of Artificial Intelligence based on study of actions of individuals in various decentralized systems. The optimization algorithms which are inspired from intelligent behavior of honey bees are among the most recently introduced population based techniques. In this paper, a novel hybrid algorithm based in Bees Algorithm and Particle Swarm Optimization is applied to the Knapsack Problem. The Bee Algorithm is a new population-based search algorithm inspired by the natural foraging behavior of honey bees, it performs a kind of exploitative neighborhood search combined with random explorative search to scan the solution, but the results obtained with this algorithm in the Knapsack Problem are not very good. Although the combination of BA and PSO is given by BSO, Bee Swarm Optimization, this algorithm uses the velocity vector and the collective memories of PSO and the search based on the BA and the results are much better. We use the Greedy Algorithm, which it's an approximate algorithm, to compare the results from these metaheuristics and thus be able to tell which is which gives better results.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 1; 101-114
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
3D sound intensity variability in shallow water in presence of internal waves in SWARM95 experiments
Autorzy:
Badiey, M.
Katsnelson, B.
Lynch, J.
Pereselkov, S.
Siegmann, W.
Powiązania:
https://bibliotekanauki.pl/articles/332334.pdf
Data publikacji:
2003
Wydawca:
Polskie Towarzystwo Akustyczne
Tematy:
3D sound
SWARM'95 experiment
acoustic
Opis:
Broadband shot signal data are analyzed from the SWARM'95 experiment to investigate acoustic variability in presence of internal solitons. A 10 to 15 minute temporal variations in the intensity of the received signals were observed. These temporal variations are azimuthally dependent on variability of water column in the presence of internal solitary waves. These fluctuations should be explained by significant horizontal refraction (3D-effects) taking place when orientation of acoustic track is close to direction of the wave front of internal solitons. Analysis on the base of both equation of vertical modes/horizontal rays and PE in horizontal plane is carried out, good agreement between theoretical calculations and experimental data is obtained.
Źródło:
Hydroacoustics; 2003, 6; 101-112
1642-1817
Pojawia się w:
Hydroacoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Study of the lightning activity over Poland for different solar activity
Autorzy:
Błęcki, Jan
Iwański, Rafał
Wronowski, Roman
Jujeczko, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/2174942.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Centrum Badań Kosmicznych PAN
Tematy:
thunderstorm
solar activity
ionosphere
PERUN
DEMETER
Swarm
Opis:
The question of the connection between solar and thunderstorm activity is not new. The discussion among scientists began before the cosmic era. The correlations of the ground-based registration of the cosmic ray flux and meteorological observations have been performed since the 50s of the 20th century. The discussed problem is related to the influence of cosmic rays on the creation of clouds, particularly thunderstorm clouds. The intensity of the galactic cosmic ray flux is controlled by the density and velocity of the solar wind. The increase in the solar wind flux during high solar activity leads to decreasing galactic cosmic ray flux, but on the other hand, the solar activity creates solar cosmic rays. Using data from the PERUN system and the DEMETER satellite, we tried to estimate the connection between the thunderstorm activity in Poland and solar activity during the period of the DEMETER operational activity (2004-2010). The influence of thunderstorms on the ionosphere and its dependence on solar activity is also discussed. However, due to the short time interval of the available data covering an insignificant part of the solar cycle, close to the minimum activity, our findings are not fully conclusive. No correlation was found between the cosmic ray flux and lightning activity given by the number of the discharges. However, some of the most energetic lightning discharges in the analyzed period occurred close to the minimum of the solar activity and their appearance is discussed.
Źródło:
Artificial Satellites. Journal of Planetary Geodesy; 2022, 57, 4; 194--209
2083-6104
Pojawia się w:
Artificial Satellites. Journal of Planetary Geodesy
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies