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ę "a* algorithm" wg kryterium: Wszystkie pola


Tytuł:
Sequential Classification of Palm Gestures Based on A* Algorithm and MLP Neural Network for Quadrocopter Control
Autorzy:
Wodziński, M.
Krzyżanowska, A.
Powiązania:
https://bibliotekanauki.pl/articles/221525.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
machine learning
shortest path
sequential data
quadrocopter
GPU
CUDA
Opis:
This paper presents an alternative approach to the sequential data classification, based on traditional machine learning algorithms (neural networks, principal component analysis, multivariate Gaussian anomaly detector) and finding the shortest path in a directed acyclic graph, using A* algorithm with a regression-based heuristic. Palm gestures were used as an example of the sequential data and a quadrocopter was the controlled object. The study includes creation of a conceptual model and practical construction of a system using the GPU to ensure the realtime operation. The results present the classification accuracy of chosen gestures and comparison of the computation time between the CPU- and GPU-based solutions.
Źródło:
Metrology and Measurement Systems; 2017, 24, 2; 265-276
0860-8229
Pojawia się w:
Metrology and Measurement Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new algorithm for a CFE-approximated solution of a discrete-time noninteger-order state equation
Autorzy:
Oprzędkiewicz, K.
Stanisławski, R.
Gawin, E.
Mitkowski, W.
Powiązania:
https://bibliotekanauki.pl/articles/199796.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
fractional order calculus
discrete-time noninteger-order state equation
continuous fraction expansion
Al-Alaoui operator
równanie dyskretne
aproksymacja Al-Alaoui
CFE
Opis:
In the paper, a new method for solution of linear discrete-time fractional-order state equation is presented. The proposed method is simpler than other methods using directly discrete-time version of the Grünwald-Letnikov operator. The method is dedicated to use with any approximator to the operator expressed by a discrete transfer function, e.g. CFE-based Al-Alaoui approximation. A simulation example confirms the usefulness of the method.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 4; 429-437
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Acoustical Assessment of Automotive Mufflers Using FEM, Neural Networks, and a Genetic Algorithm
Autorzy:
Chang, Y.-C.
Chiu, M.-C.
Wu, M.-R.
Powiązania:
https://bibliotekanauki.pl/articles/177901.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
acoustics
finite element method
genetic algorithm
muffler optimization
polynomial neural network model
Opis:
In order to enhance the acoustical performance of a traditional straight-path automobile muffler, a multi-chamber muffler having reverse paths is presented. Here, the muffler is composed of two internally parallel/extended tubes and one internally extended outlet. In addition, to prevent noise transmission from the muffler’s casing, the muffler’s shell is also lined with sound absorbing material. Because the geometry of an automotive muffler is complicated, using an analytic method to predict a muffler’s acoustical performance is difficult; therefore, COMSOL, a finite element analysis software, is adopted to estimate the automotive muffler’s sound transmission loss. However, optimizing the shape of a complicated muffler using an optimizer linked to the Finite Element Method (FEM) is time-consuming. Therefore, in order to facilitate the muffler’s optimization, a simplified mathematical model used as an objective function (or fitness function) during the optimization process is presented. Here, the objective function can be established by using Artificial Neural Networks (ANNs) in conjunction with the muffler’s design parameters and related TLs (simulated by FEM). With this, the muffler’s optimization can proceed by linking the objective function to an optimizer, a Genetic Algorithm (GA). Consequently, the discharged muffler which is optimally shaped will improve the automotive exhaust noise.
Źródło:
Archives of Acoustics; 2018, 43, 3; 517-529
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A New Algorithm for Phased Array Radar Search Function Improvement in Overload Situations
Autorzy:
Fatemi Mofrad, R. F.
Sadeghzadeh, R. A.
Powiązania:
https://bibliotekanauki.pl/articles/226581.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
phased array radar
radar resource allocation
radar modeling
radar simulation
radar performance evaluation
Opis:
A new algorithm is proposed for phased array radar search function resource allocation. The proposed algorithm adaptively priorities radar search regions and in overload situations, based on available resources, radar characteristics, maximum range and search regions, optimally allocates radar resources in order to maximize probability of detection. The performance of new algorithm is evaluated by the multifunction phased array radar simulation test bed. This simulation test bed provides capability to design and evaluate the performance of different radar resource management, target tracking and beam forming algorithms. Some results are presented that show capabilities of this simulation software for multifunction radar algorithms design and performance evaluation.
Źródło:
International Journal of Electronics and Telecommunications; 2011, 57, 1; 55-63
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Obstacle avoidance method of autonomous vehicle based on fusion improved A*APF algorithm
Autorzy:
Qian, Yubin
Sun, Hongtao
Feng, Song
Powiązania:
https://bibliotekanauki.pl/articles/2204535.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
obstacle avoidance
path planning
fuzzy control
tracking control
unikanie przeszkód
planowanie ścieżki
kontroler rozmyty
kontroler śledzenia
Opis:
This paper proposes an autonomous obstacle avoidance method combining improved A-star (A*) and improved artificial potential field (APF) to solve the planning and tracking problems of autonomous vehicles in a road environment. The A*APF algorithm to perform path planning tasks, and based on the longitudinal braking distance model, a dynamically changing obstacle influence range is designed. When there is no obstacle affecting the controlled vehicle, the improved A* algorithm with angle constraint combined with steering cost can quickly generate the optimal route and reduce turning points. If the controlled vehicle enters the influence domain of obstacle, the improved artificial potential field algorithm will generate lane changing paths and optimize the local optimal locations based on simulated annealing. Pondering the influence of surrounding participants, the four-mode obstacle avoidance process is established, and the corresponding safe distance condition is analyzed. A particular index is introduced to comprehensively evaluate speed, risk warning, and safe distance factors, so the proposed method is designed based on the fuzzy control theory. In the tracking task, a model predictive controller in the light of the kinematics model is devised to make the longitudinal and lateral process of lane changing meet comfort requirements, generating a feasible autonomous lane-change path. Finally, the simulation was performed in the Matlab/Simulink and Carsim combined environment. The proposed fusion path generation algorithm can overcome the shortcomings of the traditional single method and better adapt to the dynamic environment. The feasibility of the obstacle avoidance algorithm is verified in the three-lane simulation scenario to meet safety and comfort requirements.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 2; art. no. e144624
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of a PSO algorithm for identification of the parameters of Jiles-Atherton hysteresis model
Autorzy:
Knypiński, Ł.
Nowak, L.
Sujka, P.
Radziuk, K.
Powiązania:
https://bibliotekanauki.pl/articles/141610.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
optymalizacja
histereza
model Jilesa-Athertona
optimization
hysteresis
Jiles-Atherton model
particle swarm optumization method
Opis:
In the paper an algorithm and computer code for the identification of the hysteresis parameters of the Jiles-Atherton model have been presented. For the identification the particle swarm optimization method (PSO) has been applied. In the optimization procedure five design variables has been assumed. The computer code has been elaborated using Delphi environment. Three types of material have been examined. The results of optimization have been compared to experimental ones. Selected results of the calculation for different material are presented and discussed.
Źródło:
Archives of Electrical Engineering; 2012, 61, 2; 139-148
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
AH Method: a Novel Routine for Vicinity Examination of the Optimum Found with a Genetic Algorithm
Autorzy:
Piętak, Daniel Andrzej
Bilski, Piotr
Napiorkowski, Paweł Jan
Powiązania:
https://bibliotekanauki.pl/articles/2200688.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
heuristics
evolutionary computations
genetic algorithms
uncertainty estimation
parameter study
Opis:
The paper presents a novel heuristic procedure (further called the AH Method) to investigate function shape in the direct vicinity of the found optimum solution. The survey is conducted using only the space sampling collected during the optimization process with an evolutionary algorithm. For this purpose the finite model of point-set is considered. The statistical analysis of the sampling quality based upon the coverage of the points in question over the entire attraction region is exploited. The tolerance boundaries of the parameters are determined for the user-specified increase of the objective function value above the found minimum. The presented test-case data prove that the proposed approach is comparable to other optimum neighborhood examination algorithms. Also, the AH Method requires noticeably shorter computational time than its counterparts. This is achieved by a repeated, second use of points from optimization without additional objective function calls, as well as significant repository size reduction during preprocessing.
Źródło:
International Journal of Electronics and Telecommunications; 2022, 68, 4; 695--708
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Controllability-oriented placement of actuators for active noise-vibration control of rectangular plates using a memetic algorithm
Autorzy:
Wrona, S.
Pawełczyk, M.
Powiązania:
https://bibliotekanauki.pl/articles/176577.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
active control
flexible structures
actuators placement
controllability Gramian
evolutionary algorithm
memetic algorithm
Opis:
For successful active control with a vibrating plate it is essential to appropriately place actuators. One of the most important criteria is to make the system controllable, so any control objectives can be achieved. In this paper the controllability-oriented placement of actuators is undertaken. First, a theoretical model of a fully clamped rectangular plate is obtained. Optimization criterion based on maximization of controllability of the system is developed. The memetic algorithm is used to find the optimal solution. Obtained results are compared with those obtained by the evolutionary algorithm. The configuration is also validated experimentally.
Źródło:
Archives of Acoustics; 2013, 38, 4; 529-536
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A genetic algorithm and B&B algorithm for integrated production scheduling, preventiveand corrective maintenance to save energy
Autorzy:
Sadiqi, Assia
El Abbassi, Ikram
El Barkany, Abdellah
Darcherif, Moumen
El Biyaali, Ahmed
Powiązania:
https://bibliotekanauki.pl/articles/1841396.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
scheduling
maintenance
genetic algorithm
branch
bound
MILP
modeling
optimization
CPLEX
Python
Opis:
The rapid global economic development of the world economy depends on the availability of substantial energy and resources, which is why in recent years a large share of non-renewable energy resources has attracted interest in energy control. In addition, inappropriate use of energy resources raises the serious problem of inadequate emissions of greenhouse effect gases, with major impact on the environment and climate. On the other hand, it is important to ensure efficient energy consumption in order to stimulate economic development and preserve the environment. As scheduling conflicts in the different workshops are closely associated with energy consumption. However, we find in the literature only a brief work strictly focused on two directions of research: the scheduling with PM and the scheduling with energy. Moreover, our objective is to combine both aspects and directions of in-depth research in a single machine. In this context, this article addresses the problem of integrated scheduling of production, preventive maintenance (PM) and corrective maintenance (CM) jobs in a single machine. The objective of this article is to minimize total energy consumption under the constraints of system robustness and stability. A common model for the integration of preventive maintenance (PM) in production scheduling is proposed, where the sequence of production tasks, as well as the preventive maintenance (PM) periods and the expected times for completion of the tasks are established simultaneously; this makes the theory put into practice more efficient. On the basis of the exact Branch and Bound method integrated on the CPLEX solver and the genetic algorithm (GA) solved in the Python software, the performance of the proposed integer binary mixed programming model is tested and evaluated. Indeed, after numerically experimenting with various parameters of the problem, the B&B algorithm works relatively satisfactorily and provides accurate results compared to the GA algorithm. A comparative study of the results proved that the model developed was sufficiently efficient.
Źródło:
Management and Production Engineering Review; 2020, 11, 4; 138-148
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Control system with a non-parametric predictive algorithm for a high-speed rotating machine with magnetic bearings
Autorzy:
Kurnyta-Mazurek, Paulina
Szolc, Tomasz
Henzel, Maciej
Falkowski, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/2086845.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
magnetic bearing
predictive algorithms
high speed rotating machine
łożysko magnetyczne
algorytm predykcyjny
maszyna wirująca dużej prędkości
Opis:
This paper deals with research on the magnetic bearing control systems for a high-speed rotating machine. Theoretical and experimental characteristics of the control systems with the model algorithmic control (MAC) algorithm and the proportional-derivative (PD) algorithm are presented. The MAC algorithm is the non-parametric predictive control method that uses an impulse response model. A laboratory model of the rotor-bearing unit under study consists of two active radial magnetic bearings and one active axial (thrust) magnetic bearing. The control system of the rotor position in air gaps consists of the fast prototyping control unit with a signal processor, the input and output modules, power amplifiers, contactless eddy current sensors and the host PC with dedicated software. Rotor displacement and control current signals were registered during investigations using a data acquisition (DAQ) system. In addition, measurements were performed for various rotor speeds, control algorithms and disturbance signals generated by the control system. Finally, the obtained time histories were presented, analyzed and discussed in this paper.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 6; e138998, 1--9
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A greedy algorithm for the DNA sequencing by hybridization with positive and negative errors and information about repetitions
Autorzy:
Kwarciak, K.
Formanowicz, P.
Powiązania:
https://bibliotekanauki.pl/articles/202322.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
DNA sequencing
l-mer multiplicity
greedy algorithm
combinatorial problems
Opis:
In this paper a greedy algorithm for some variants of the sequencing by hybridization method is presented. In the standard version of the method information about repetitions is not available. In the paper it is assumed that a partial information of this type is a part of the problem instance. Here two simple but realistic models of this information are taken into consideration. The first one assumes it is known if a given element of a spectrum appears in the target sequence once or more than once. The second model uses the knowledge is a given element of a spectrum occurs in the analyzed sequence once, twice or at least three times. The proposed greedy algorithm solves the variant of the problem with positive and negative errors. Results of a computational experiment are reported which, among others, confirm that the additional information leads to the improvement of the obtained solutions. They also show that the more precise model of information increases the quality of reconstructed sequences.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2011, 59, 1; 111-115
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Smart Substation Network Fault Classification Based on a Hybrid Optimization Algorithm
Autorzy:
Xia, Xin
Liu, Xiaofeng
Lou, Jichao
Powiązania:
https://bibliotekanauki.pl/articles/227220.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
smart substation
network fault classification
improved separation interval method (ISIM)
support vector
machine (SVM)
Anti-noise processing (ANP)
Opis:
Accurate network fault diagnosis in smart substations is key to strengthening grid security. To solve fault classification problems and enhance classification accuracy, we propose a hybrid optimization algorithm consisting of three parts: anti-noise processing (ANP), an improved separation interval method (ISIM), and a genetic algorithm-particle swarm optimization (GA-PSO) method. ANP cleans out the outliers and noise in the dataset. ISIM uses a support vector machine (SVM) architecture to optimize SVM kernel parameters. Finally, we propose the GA-PSO algorithm, which combines the advantages of both genetic and particle swarm optimization algorithms to optimize the penalty parameter. The experimental results show that our proposed hybrid optimization algorithm enhances the classification accuracy of smart substation network faults and shows stronger performance compared with existing methods.
Źródło:
International Journal of Electronics and Telecommunications; 2019, 65, 4; 657-663
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimizing management of the condensing heat and cooling of gases compression in oxy block using of a genetic algorithm
Autorzy:
Brzęczek, M.
Bartela, Ł.
Powiązania:
https://bibliotekanauki.pl/articles/240478.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
CO2 capture
CO2 compression
air separation unit
flue gas conditioning
genetic algorithm
usuwanie CO2
sprężanie CO2
separator powietrza
kondycjonowanie spalin
algorytm genetyczny
Opis:
This paper presents the parameters of the reference oxy combustion block operating with supercritical steam parameters, equipped with an air separation unit and a carbon dioxide capture and compression installation. The possibility to recover the heat in the analyzed power plant is discussed. The decision variables and the thermodynamic functions for the optimization algorithm were identified. The principles of operation of genetic algorithm and methodology of conducted calculations are presented. The sensitivity analysis was performed for the best solutions to determine the effects of the selected variables on the power and efficiency of the unit. Optimization of the heat recovery from the air separation unit, flue gas condition and CO2 capture and compression installation using genetic algorithm was designed to replace the low-pressure section of the regenerative water heaters of steam cycle in analyzed unit. The result was to increase the power and efficiency of the entire power plant.
Źródło:
Archives of Thermodynamics; 2013, 34, 4; 199-214
1231-0956
2083-6023
Pojawia się w:
Archives of Thermodynamics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A reactive algorithm for deducing nodal forwarding behavior in a multihop ad-hoc wireless network in the presence of errors
Autorzy:
Rydzewski, Karol
Konorski, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/225979.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
ad hoc
networks
reputation
errors
Opis:
A novel algorithm is presented to deduce individual nodal forwarding behavior from standard end-to-end acknowledgments. The algorithm is based on a well-established mathematical method and is robust to network related errors and nodal behavior changes. The proposed solution was verified in a network simulation, during which it achieved sound results in a challenging multihop ad-hoc network environment.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 1; 193-199
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling of the Manufacturing Cell Work with the Use of a Genetic Algorithm on the Example of a Flexible Production System
Autorzy:
Matuszny, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/2201163.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
production planning
production control
production scheduling
genetic algorithm
production engineering
production process
Opis:
The article is to present the application of genetic algorithm in production scheduling in a production company. In the research work the assumptions of the methodology were described and the operation of the proposed genetic algorithm was presented in details. Genetic algorithms are useful in complex large scale combinatorial optimisation tasks and in the engineering tasks with numerous limitations in the production engineering. Moreover, they are more reliable than the existing direct search algorithms. The research is focused on the effectivity improvement and on the methodology of scheduling of a manufacturing cell work. The genetic algorithm used in the work appeared to be robust and fast in finding accurate solutions. It was shown by experiment that using this method enables obtaining schedules suitable for a model. It gives a group of solutions that are at least as good as those created by the heuristic rules.
Źródło:
Management and Production Engineering Review; 2022, 13, 4; 98--106
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
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