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ę "87.55.kd" wg kryterium: Temat


Wyświetlanie 1-4 z 4
Tytuł:
An Advanced Particle Swarm Optimization Algorithm for MPPTs in PV Systems
Autorzy:
Erdem, Z.
Powiązania:
https://bibliotekanauki.pl/articles/1031910.pdf
Data publikacji:
2017-09
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
87.55.de
88.40.mp
87.55.kd
Opis:
Maximum power point trackers are in charge of absorbing the maximum potential power from the photovoltaic panels. Thus, this makes the maximum power point trackers the fundamental parts of the photovoltaic panel systems. The conventional maximum power point tracker algorithms are working well under balanced insolation conditions, however when the partial shade condition occurs, those algorithms are trapped at the local maxima. Hence, under partial shade conditions, the need for a global maximum power point tracking algorithm arises. Particle swarm optimization is a preferential algorithm of maximum power point trackers in literature, especially in partial shade conditions. This paper is focused on improving the existing particle swarm optimization algorithm for maximum power point trackers. The proposed advanced particle swarm optimization algorithm aims to catch the global maximum power point much faster, accurately and to reduce the chatter in the power curve. The proposed method accelerates the global maximum tracking time with gridding the initial search area. The effectiveness of the proposed method is demonstrated with simulation results and these results are compared with a conventional particle swarm optimization method under step changes in irradiance and partial shade conditions of an array of photovoltaic panels.
Źródło:
Acta Physica Polonica A; 2017, 132, 3; 1134-1139
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Validation of the usefulness of dose calculation algorithms in radiotherapy planning system
Autorzy:
Kiełtyka, B.
Rawojć, K.
Kisielewicz, K.
Markiewicz, I.
Powiązania:
https://bibliotekanauki.pl/articles/1065171.pdf
Data publikacji:
2016-02
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
87.55.km
87.55.kd
87.10.Rt
87.10.Vg
Opis:
One of the main goals of radiotherapy is to achieve tumor control and minimize probability of normal-tissue complications. For this reason radiation oncology requires high accuracy, which implies no more than 2-3% uncertainty levels in the treatment planning calculations. That is challenging, when heterogeneous tissues such as lungs and bones are involved. To verify the accuracy of the dose calculation algorithms numerous approaches might be performed. The most common are point dose, one-dimensional profile and two-dimensional isodose line comparison with experimental measurements. In presented study, results of transport modeling and the deposited spatial distribution of the dose, obtained by anisotropic analytical algorithm and pencil beam convolution algorithm, were compared to measurements recorded during the experiment. To achieve meaningful conclusions, three parameters: dose difference, distance to agreement and gamma parameter (γ) were taken into consideration and examined. The irradiation was performed using CIRS anthropomorphic phantom. For dose detection gafchromic EBT films were used and scanned after exposure using Epson Scanner. Measured and planned dose distributions were analyzed via FilmQA software. Preliminary results showed that the anisotropic analytical algorithm, with its complex accounting of heterogeneities, provides more accurate dose calculation within an area of a high density gradient, than pencil beam convolution does. The level of the data accuracy derived from the experiment was: dose difference (5%) - 83.4% and 68% pixels passing, distance to agreement (3 mm) - 99.0% and 96.7%, gamma parameter (for dose difference (3%), distance to agreement (3 mm)) - 90% and 75.5%, respectively, for anisotropic analytical algorithm and pencil beam convolution algorithms. The comparison between studied parameters dose difference, distance to agreement and γ for both algorithms implicated anisotropic analytical algorithm as an appropriate approach in radiotherapy treatment planning.
Źródło:
Acta Physica Polonica A; 2016, 129, 2; 219-221
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Review of MPPT Algorithms for Partial Shading Conditions
Autorzy:
Erdem, Z.
Powiązania:
https://bibliotekanauki.pl/articles/1031934.pdf
Data publikacji:
2017-09
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
87.55.kd
02.60.Gf
84.60.Jt
Opis:
Maximum power point tracker in a photovoltaic system allows to maximize the energy drawn from the connected photovoltaic modules. In the partial shade conditions there can be more than one maximum point in photovoltaic output power curve. The solution for this situation is a maximum power point tracker algorithm, which finds the global maximum. In literature, there is a large number of studies on maximum power point trackers. Therefore designers are drowning in a sea of knowledge. This study eliminates similar studies and classified them into groups, and at the end of the study a comparison table is given to guide the designers in the performance information of the selected studies. This study aims to guide the designers to make a sensible selection of a maximum power point tracker algorithm for partial shade conditions.
Źródło:
Acta Physica Polonica A; 2017, 132, 3; 1128-1133
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Path Planning for Multiple Mobile Robots Using A* Algorithm
Autorzy:
Batik Garip, Z.
Karayel, D.
Ozkan, S.
Atali, G.
Powiązania:
https://bibliotekanauki.pl/articles/1031599.pdf
Data publikacji:
2017-09
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
42.30.Tz
45.40.Ln
87.85.St
87.55.de
87.55.K-
87.55.kd
Opis:
One of the main problems in path planning for multiple mobile robots is to find the optimal path between two points so that robots can follow the shortest path and consume the least energy. Also, motion planning is important to avoid collisions if multiple mobile robots are running together within environments with obstacles. In this study, motion planning for multiple robots has been proposed. It is desired that robots could move in coordination with each other from the starting point to the destination point on a plane. The coordinates of the objects and mobile robots have been acquired using image processing with a single ceiling camera. The path planning for the shortest distance has been performed using A* algorithm in dynamic frame between robot-object and object-target point, respectively. A graphical user interface has been developed based on MATLAB GUI. It is hoped that the developed system will have a wide area of applications in industry and will make important contributions for the improvement of manufacturing, assembly, transportation and storage technologies.
Źródło:
Acta Physica Polonica A; 2017, 132, 3; 685-688
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    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