Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "hybrid algorithm" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 23
Tytuł:
Multi-population-based algorithm with an exchange of training plans based on population evaluation
Autorzy:
Łapa, Krystian
Cpałka, Krzysztof
Kisiel-Dorohinicki, Marek
Paszkowski, Józef
Dębski, Maciej
Le, Van-Hung
Powiązania:
https://bibliotekanauki.pl/articles/2147148.pdf
Data publikacji:
2022
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
population-based algorithm
multi-population algorithm
hybrid algorithm
island algorithm
subpopulation evaluation
training plan
Opis:
Population Based Algorithms (PBAs) are excellent search tools that allow searching space of parameters defined by problems under consideration. They are especially useful when it is difficult to define a differentiable evaluation criterion. This applies, for example, to problems that are a combination of continuous and discrete (combinatorial) problems. In such problems, it is often necessary to select a certain structure of the solution (e.g. a neural network or other systems with a structure usually selected by the trial and error method) and to determine the parameters of such structure. As PBAs have great application possibilities, the aim is to develop more and more effective search formulas used in them. An interesting approach is to use multiple populations and process them with separate PBAs (in a different way). In this paper, we propose a new multi-population-based algorithm with: (a) subpopulation evaluation and (b) replacement of the associated PBAs subpopulation formulas used for their processing. In the simulations, we used a set of typical CEC2013 benchmark functions. The obtained results confirm the validity of the proposed concept.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2022, 12, 4; 239--253
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the hybridization of the artificial Bee Colony and Particle Swarm Optimization Algorithms
Autorzy:
El-Abd, M.
Powiązania:
https://bibliotekanauki.pl/articles/91658.pdf
Data publikacji:
2012
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
Artificial Bee Colony Algorithm
ABC
particle swarm optimization (PSO)
PSO
hybridization
hybrid algorithm
CEC05
Opis:
In this paper we investigate the hybridization of two swarm intelligence algorithms; namely, the Artificial Bee Colony Algorithm (ABC) and Particle Swarm Optimization (PSO). The hybridization technique is a component-based one, where the PSO algorithm is augmented with an ABC component to improve the personal bests of the particles. Three different versions of the hybrid algorithm are tested in this work by experimenting with different selection mechanisms for the ABC component. All the algorithms are applied to the well-known CEC05 benchmark functions and compared based on three different metrics, namely, the solution reached, the success rate, and the performance rate.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 2; 147-155
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A machine learning method for soil conditioning automated decision-making of EPBM : hybrid GBDT and Random Forest Algorithm
Autorzy:
Lin, Lin
Guo, Hao
Lv, Yancheng
Liu, Jie
Tong, Changsheng
Yang, Shuqin
Powiązania:
https://bibliotekanauki.pl/articles/2087007.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
soil conditioning
automated decision-making
hybrid algorithm
geological parameters
drive parameters
feature selection
Opis:
There lacks an automated decision-making method for soil conditioning of EPBM with high accuracy and efficiency that is applicable to changeable geological conditions and takes drive parameters into consideration. A hybrid method of Gradient Boosting Decision Tree (GBDT) and random forest algorithm to make decisions on soil conditioning using foam is proposed in this paper to realize automated decision-making. Relevant parameters include decision parameters (geological parameters and drive parameters) and target parameters (dosage of foam). GBDT, an efficient algorithm based on decision tree, is used to determine the weights of geological parameters, forming 3 parameters sets. Then 3 decision-making models are established using random forest, an algorithm with high accuracy based on decision tree. The optimal model is obtained by Bayesian optimization. It proves that the model has obvious advantages in accuracy compared with other methods. The model can realize real-time decision-making with high accuracy under changeable geological conditions and reduce the experiment cost.
Źródło:
Eksploatacja i Niezawodność; 2022, 24, 2; 237--247
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithm CFP-SFPwith parallel processing
Autorzy:
Kujawiak, M.
Powiązania:
https://bibliotekanauki.pl/articles/92930.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
association rules
data mining
web logs
a priori
a priori TID
a priori hybrid algorithm
FP-Tree
Opis:
Existing algorithms for finding association rules do not implement parallel processing. This paper proposes CFP-SFP (Creating Frequent Patterns with Set from Frequent Patterns) algorithm with parallel processing. The research involves running CEP-SEP algorithm with one thread and a dozen or so threads that are executed simultaneously. The research was conducted on a computer with one processor and dual-core processor.
Źródło:
Studia Informatica : systems and information technology; 2008, 1(10); 87-93
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Inverse and direct optimization shape of airfoil using hybrid algorithm Big Bang-Big Crunch and Particle Swarm Optimization
Autorzy:
Masoumi, Heidar
Jalili, Farhad
Powiązania:
https://bibliotekanauki.pl/articles/281379.pdf
Data publikacji:
2019
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
hybrid optimization algorithm
airfoil
inverse and direct optimization approaches
Euler’s equations
Opis:
In this paper, Big Bang-Big Crunch and Particle Swarm Optimization algorithms are combined and used for the first time to optimize airfoil geometry as a aerodynamic cross section. The optimization process is carried out both in reverse and direct directions. In the reverse approach, the object function is the difference between pressure coefficients of the optimized and target airfoils, which must be minimized. In the direct approach, three objective functions are introduced, the first of which is the drag to lift (D/L) ratio. It is minimized considering four different initial geometries, ultimately, all four geometries converge to the same final geometry. In other cases, maximizing lift the coefficient with the fixed drag coefficient constraint and minimizing the drag coefficient while the lift coefficient is fixed are defined as purposes. The results show that by changing the design parameters of the initial airfoil geometry, the proposed hybrid optimization algorithm as a powerful method satisfies the needs with proper accuracy and finally reaches the desired geometry.
Źródło:
Journal of Theoretical and Applied Mechanics; 2019, 57, 3; 697-711
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Inverse Problem of Textile Material Design at Low Temperature Solved by a Hybrid Stochastic Algorithm
Rozwiązanie problemu inwersyjnego projektowania materiałów włókienniczych stosowanych w niskich temperaturach za pomocą hybrydowego algorytmu stochastycznego
Autorzy:
Weng, M
Xu, D
Zhou, X
Powiązania:
https://bibliotekanauki.pl/articles/232769.pdf
Data publikacji:
2015
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Biopolimerów i Włókien Chemicznych
Tematy:
inverse problem
textile design
hybrid stochastic algorithm
optimisation method
problem inwersyjny
projektowanie tkanin
hybrydowy algorytm stochastyczny
metody optymalizacji
Opis:
The inverse problem of textile material design (IPTMD) aims to determine textile materials with optimum thermal conductivities for the thickness designed in terms of the thermal comfort requirements of the wearer. In this paper, an IPTMD is presented on the basis of the physical nature of steady heat and moisture transfer in a human body-clothing-environment system. A globally convergent algorithm, the modified particle collision algorithm (MPCA), is proposed and its validity is verified. The MPCA is applied to solve the IPTMD for single-layer textile materials at low temperature. Numerical simulation results of the IPTMD proved the suitability of the IPTMD and effectiveness of the MPCA in solving complex global optimisation problems. The encouraging results indicate that the modelling method above and optimisation algorithm can be used for further applications.
Problem inwersyjny projektowania materiałów włókienniczych ma na celu określenie materiałów włókienniczych z optymalną przewodnością cieplną dla grubości zaprojektowanej z uwzględnieniem komfortu termicznego i wygody użytkownika. W pracy przedstawiono problem na podstawie stałego przepływu ciepła i wilgotności pomiędzy ciałem człowieka, odzieżą a środowiskiem zewnętrznym. Zaprezentowano i zweryfikowano prawidłowość algorytmu zbieżnego, algorytmu zderzenia cząstek modyfikowanych, który jest stosowany w celu rozwiązania problemu dla jednowarstwowych materiałów włókienniczych w niskich temperaturach. Wyniki symulacji numerycznych problemu dowodzą jego przydatności i skuteczności algorytmu w rozwiązywaniu złożonych problemów optymalizacji. Zachęcające rezultaty wskazują, że powyższy sposób modelowania i algorytm optymalizacji mogą być używane do różnych zastosowań.
Źródło:
Fibres & Textiles in Eastern Europe; 2015, 2 (110); 40-43
1230-3666
2300-7354
Pojawia się w:
Fibres & Textiles in Eastern Europe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Strong convergence theorem of a hybrid projection algorithm for a family of quasi-φ-asymptotically nonexpansive mappings
Autorzy:
Tang, J. F.
Chang, S. S.
Liu, M.
Liu, J. A.
Powiązania:
https://bibliotekanauki.pl/articles/255543.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
quasi-phi-asymptotically nonexpansive mapping
asymptotically regular mapping
hybrid projection iterative algorithm
strong convergence theorem
Opis:
The main purpose of this paper is by using a new hybrid projection iterative algorithm to prove some strong convergence theorems for a family of quasi-φ-asymptotically nonexpansive mappings. The results presented in the paper improve and extend the corresponding results announced by some authors.
Źródło:
Opuscula Mathematica; 2010, 30, 3; 341-348
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-objective optimization of in-situ bioremediation of groundwater using a hybrid metaheuristic technique based on differential evolution, genetic algorithms and simulated annealing
Wielozadaniowa optymalizacja bioremediacji wód gruntowych in situ z zastosowaniem hybrydowej techniki metaheurystycznej opartej na zróżnicowanej ewolucji, algorytmach genetycznych i symulowanym wyżarzaniu
Autorzy:
Kumar, D.
Ch, S.
Mathur, S.
Adamowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/292714.pdf
Data publikacji:
2015
Wydawca:
Instytut Technologiczno-Przyrodniczy
Tematy:
differential evolution
fuzzy logic
genetic algorithm
groundwater
hybrid algorithm
in situ bioremediation
simulated annealing
support vector machine (SVM)
bioremediacja in situ
algorytm hybrydowy
algorytm genetyczny
logika rozmyta
maszyna wektorów nośnych SVM
wyżarzanie symulowane
wody gruntowe
zróżnicowana ewolucja
Opis:
Groundwater contamination due to leakage of gasoline is one of the several causes which affect the groundwater environment by polluting it. In the past few years, In-situ bioremediation has attracted researchers because of its ability to remediate the contaminant at its site with low cost of remediation. This paper proposed the use of a new hybrid algorithm to optimize a multi-objective function which includes the cost of remediation as the first objective and residual contaminant at the end of the remediation period as the second objective. The hybrid algorithm was formed by combining the methods of Differential Evolution, Genetic Algorithms and Simulated Annealing. Support Vector Machines (SVM) was used as a virtual simulator for biodegradation of contaminants in the groundwater flow. The results obtained from the hybrid algorithm were compared with Differential Evolution (DE), Non Dominated Sorting Genetic Algorithm (NSGA II) and Simulated Annealing (SA). It was found that the proposed hybrid algorithm was capable of providing the best solution. Fuzzy logic was used to find the best compromising solution and finally a pumping rate strategy for groundwater remediation was presented for the best compromising solution. The results show that the cost incurred for the best compromising solution is intermediate between the highest and lowest cost incurred for other non-dominated solutions.
Zanieczyszczenie wód gruntowych wyciekami benzyny jest jedną z kilku przyczyn wpływających na środowisko wód podziemnych. W ostatnich latach bioremediacja in situ przyciągała uwagę badaczy z powodu jej zdolności do usuwania zanieczyszczeń w ich siedlisku i niskich kosztów procesu. Przedstawiona praca proponuje użycie nowego algorytmu hybrydowego do optymalizacji wielozadaniowej funkcji, która obejmuje koszty remediacji jako pierwsze zadanie i resztową zawartość zanieczyszczeń po zakończeniu procesu jako drugie z zadań. Algorytm hybrydowy powstał z połączenia metod różnicowej ewolucji, algorytmu genetycznego i symulowanego wyżarzania. Maszyna wektorów nośnych (SVM) została użyta jako wirtualny symulator biologicznej degradacji zanieczyszczeń w wodach gruntowych. Wyniki uzyskane z algorytmy hybrydowego porównano z wynikami zróżnicowanej ewolucji (DE), algorytmu genetycznego (NSGA II) i symulowanego wyżarzania (SA). Stwierdzono, że proponowany algorytm był w stanie zapewnić najlepsze rozwiązanie. Użyto metody z zakresu logiki rozmytej dla znalezienia najlepszego rozwiązania kompromisowego i na końcu przedstawiono dla tego rozwiązania strategię szybkości pompowania celem remediacji wód gruntowych. Wyniki pokazały, że koszty ponoszone na rozwiązanie kompromisowe są pośrednie między najwyższymi i najniższymi kosztami innych rozwiązań.
Źródło:
Journal of Water and Land Development; 2015, 27; 29-40
1429-7426
2083-4535
Pojawia się w:
Journal of Water and Land Development
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
SIDH Hybrid Schemes with Classical Component Based on the Discrete Logarithm Problem over Finite Field Extension
Autorzy:
Wroński, Michał
Burek, Elżbieta
Dzierzkowski, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/226917.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
SIDH
Diffie-Hellman algorithm
hybrid schemes
Opis:
The concept of a hybrid scheme with connection of SIDH and ECDH is nowadays very popular. In hardware implementations it is convenient to use a classical key exchange algorithm, which is based on the same finite field as SIDH. Most frequently used hybrid scheme is SIDH-ECDH. On the other hand, using the same field as in SIDH, one can construct schemes over Fpn, like Diffie-Hellman or XTR scheme, whose security is based on the discrete logarithm problem. In this paper, idea of such schemes will be presented. The security of schemes, which are based on the discrete logarithm problem over fields Fp; Fp2 ; Fp4 ; Fp6 and Fp8 , for primes p used in SIDH, will be analyzed. At the end, the propositions of practical applications of these schemes will be presented.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 3; 431-441
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Research on hybrid modified pathfinder algorithm for optimal reactive power dispatch
Autorzy:
Suresh, V.
Senthil Kumar, S.
Powiązania:
https://bibliotekanauki.pl/articles/2086822.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
optimal reactive power dispatch
ORPD
real-power losses
pathfinder algorithm
PFA
modified pathfinder algorithm
mPFA
hybrid pathfinder algorithm
HPFA
optymalna dyspozycja mocy biernej
strata mocy rzeczywistej
algorytm wyszukiwania najkrótszej drogi
algorytm wyszukiwania najkrótszej drogi zmodyfikowany
algorytm wyszukiwania najkrótszej drogi hybrydowy
Opis:
Hybridization of meta-heuristic algorithms plays a major role in the optimization problem. In this paper, a new hybrid meta-heuristic algorithm called hybrid pathfinder algorithm (HPFA) is proposed to solve the optimal reactive power dispatch (ORPD) problem. The superiority of the Differential Evolution (DE) algorithm is the fast convergence speed, a mutation operator in the DE algorithm incorporates into the pathfinder algorithm (PFA). The main objective of this research is to minimize the real power losses and subject to equality and inequality constraints. The HPFA is used to find optimal control variables such as generator voltage magnitude, transformer tap settings and capacitor banks. The proposed HPFA is implemented through several simulation cases on the IEEE 118-bus system and IEEE 300-bus power system. Results show the superiority of the proposed algorithm with good quality of optimal solutions over existing optimization techniques, and hence confirm its potential to solve the ORPD problem.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 4; e137733, 1--8
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The number of clusters in hybrid predictive models: does it really matter?
Autorzy:
Łapczyński, Mariusz
Jefmański, Bartłomiej
Powiązania:
https://bibliotekanauki.pl/articles/1046637.pdf
Data publikacji:
2020
Wydawca:
Główny Urząd Statystyczny
Tematy:
hybrid predictive model
k-means algorithm
decision trees
Opis:
For quite a long time, research studies have attempted to combine various analytical tools to build predictive models. It is possible to combine tools of the same type (ensemble models, committees) or tools of different types (hybrid models). Hybrid models are used in such areas as customer relationship management (CRM), web usage mining, medical sciences, petroleum geology and anomaly detection in computer networks. Our hybrid model was created as a sequential combination of a cluster analysis and decision trees. In the first step of the procedure, objects were grouped into clusters using the k-means algorithm. The second step involved building a decision tree model with a new independent variable that indicated which cluster the objects belonged to. The analysis was based on 14 data sets collected from publicly accessible repositories. The performance of the models was assessed with the use of measures derived from the confusion matrix, including the accuracy, precision, recall, F-measure, and the lift in the first and second decile. We tried to find a relationship between the number of clusters and the quality of hybrid predictive models. According to our knowledge, similar studies have not been conducted yet. Our research demonstrates that in some cases building hybrid models can improve the performance of predictive models. It turned out that the models with the highest performance measures require building a relatively large number of clusters (from 9 to 15).
Źródło:
Przegląd Statystyczny; 2019, 66, 3; 228-238
0033-2372
Pojawia się w:
Przegląd Statystyczny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization Design of Hybrid Mufflers on Broadband Frequencies Using the Genetic Algorithm
Autorzy:
Chiu, M-C.
Powiązania:
https://bibliotekanauki.pl/articles/177052.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
dissipative
reactive
hybrid muffler
genetic algorithm
space constraints
Opis:
Recently, there has been research on high frequency dissipative mufflers. However, research on shape optimization of hybrid mufflers that reduce broadband noise within a constrained space is sparse. In this paper, a hybrid muffler composed of a dissipative muffler and a reactive muffler within a constrained space is assessed. Using the eigenvalues and eigenfunctions, a coupling wave equation for the perforated dissipative chamber is simplified into a four-pole matrix form. To efficiently find the optimal shape within a constrained space, a four-pole matrix system used to evaluate the acoustical performance of the sound transmission loss (STL) is eval- uated using a genetic algorithm (GA). A numerical case for eliminating a broadband venting noise is also introduced. To verify the reliability of a GA optimization, optimal noise abatements for two pure tones (500 Hz and 800 Hz) are exemplified. Before the GA operation can be carried out, the accuracy of the mathematical models has been checked using experimental data. Results indicate that the maximal STL is precisely located at the desired target tone. The optimal result of case studies for eliminating broadband noise also reveals that the overall sound power level (SWL) of the hybrid muffler can be reduced from 138.9 dB(A) to 84.5 dB(A), which is superior to other mufflers (a one-chamber dissipative and a one-chamber reactive muffler). Consequently, a successful approach used for the optimal design of the hybrid mufflers within a constrained space has been demonstrated.
Źródło:
Archives of Acoustics; 2011, 36, 4; 795-822
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary algorithm for selecting dynamic signatures partitioning approach
Autorzy:
Zalasiński, Marcin
Laskowski, Łukasz
Niksa-Rynkiewicz, Tacjana
Cpałka, Krzysztof
Byrski, Aleksander
Przybyszewski, Krzysztof
Trippner, Paweł
Dong, Shi
Powiązania:
https://bibliotekanauki.pl/articles/2147146.pdf
Data publikacji:
2022
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
identity verification
dynamic signature
hybrid partitions
partitions’ selection
evolutionary algorithm
Opis:
In the verification of identity, the aim is to increase effectiveness and reduce involvement of verified users. A good compromise between these issues is ensured by dynamic signature verification. The dynamic signature is represented by signals describing the position of the stylus in time. They can be used to determine the velocity or acceleration signal. Values of these signals can be analyzed, interpreted, selected, and compared. In this paper, we propose an approach that: (a) uses an evolutionary algorithm to create signature partitions in the time and velocity domains; (b) selects the most characteristic partitions in terms of matching with reference signatures; and (c) works individually for each user, eliminating the need of using skilled forgeries. The proposed approach was tested using Biosecure DS2 database which is a part of the DeepSignDB, a database with genuine dynamic signatures. Our simulations confirmed the correctness of the adopted assumptions.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2022, 12, 4; 267--279
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimizing the Makespan and Total Tardiness in Hybrid Flow Shop Scheduling with Sequence-Dependent Setup Times
Autorzy:
Mousavi, Seyyed Mostafa
Shahnazari-Shahrezaei, Parisa
Powiązania:
https://bibliotekanauki.pl/articles/2201180.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
dispatching rule
genetic algorithm
hybrid flow shop
neighborhood search structure
Opis:
The paper considers the production scheduling problem in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimizing both the makespan and the total tardiness. The multi-objective genetic algorithm is applied to solve this problem, which belongs to the non-deterministic polynomial-time (NP)-hard class. In the structure of the proposed algorithm, the initial population, neighborhood search structures and dispatching rules are studied to achieve more efficient solutions. The performance of the proposed algorithm compared to the efficient algorithm available in literature (known as NSGA-II) is expressed in terms of the data envelopment analysis method. The computational results confirm that the set of efficient solutions of the proposed algorithm is more efficient than the other algorithm.
Źródło:
Management and Production Engineering Review; 2023, 14, 1; 13--24
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Analysis of Influence of Sensors’ Failure on the Performance of Mobile Robot Autonomy
Autorzy:
Bigaj, P.
Bartoszek, J.
Trojnacki, M.
Powiązania:
https://bibliotekanauki.pl/articles/385037.pdf
Data publikacji:
2014
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
mobile robot
semiautonomy algorithm
sensors failure
matlab/Simulink
simulation research
algorithm sensitivity analysis
hybrid reactive approach
Opis:
This work is concerned on sensitivity analysis of semiautonomy algorithm of a mobile robot to environmental sensors’ failures. Construction of the robot, semiautonomy algorithm and used sensors have been described. The algorithm bases on a reactive hybrid approach that merges data from different types of sensors and calculates resulting velocities. This algorithm also takes into account environmental sensors’ damage by modifying the behavior of robot in accordance to actual sensors’ set state of health. Simulation research using Matlab/ Simulink package and experimental tests’ results of semiautonomy algorithm were presented. The experimental tests were carried out in outdoor conditions. The research and tests are performed for normal environmental sensors’ operation and for selected sensors’ damage. On that basis, sensitivity of semiautonomy algorithm to selected environmental sensors damage was tested.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2014, 8, 4; 31-39
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 23

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