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ę "optimization problem" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    Tytuł:
    Artificial bee colony based state feedback position controller for PMSM servo-drive – the efficiency analysis
    Autorzy:
    Tarczewski, T.
    Niewiara, L. J.
    Grzesiak, L. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/200239.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    tuning
    PMSM servo-drive
    artificial bee colony algorithm
    linear-quadratic optimization problem
    pole placement
    Opis:
    This paper presents a state feedback controller (SFC) for position control of PMSM servo-drive. Firstly, a short review of the commonly used swarm-based optimization algorithms for tuning of SFC is presented. Then designing process of current control loop as well as of SFC with feedforward path is depicted. Next, coefficients of controller are tuned by using an artificial bee colony (ABC) optimization algorithm. Three of the most commonly applied tuning methods (i.e. linear-quadratic optimization, pole placement technique and direct selection of coefficients) are used and investigated in terms of positioning performance, disturbance compensation and robustness against plant parameter changes. Simulation analysis is supported by experimental tests conducted on laboratory stand with modern PMSM servo-drive.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 5; 997-1007
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Graph based discrete optimization in structural dynamics
    Autorzy:
    Blachowski, B.
    Gutkowski, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/200069.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    discrete structural optimization
    combinatorial optimization
    structural dynamics
    stochastic loading
    problem oriented optimization
    graphs
    Opis:
    In this study, a relatively simple method of discrete structural optimization with dynamic loads is presented. It is based on a tree graph, representing discrete values of the structural weight. In practical design, the number of such values may be very large. This is because they are equal to the combination numbers, arising from numbers of structural members and prefabricated elements. The starting point of the method is the weight obtained from continuous optimization, which is assumed to be the lower bound of all possible discrete weights. Applying the graph, it is possible to find a set of weights close to the continuous solution. The smallest of these values, fulfilling constraints, is assumed to be the discrete minimum weight solution. Constraints can be imposed on stresses, displacements and accelerations. The short outline of the method is presented in Sec. 2. The idea of discrete structural optimization by means of graphs. The knowledge needed to apply the method is limited to the FEM and graph representation. The paper is illustrated with two examples. The first one deals with a transmission tower subjected to stochastic wind loading. The second one with a composite floor subjected to deterministic dynamic forces, coming from the synchronized crowd activities, like dance or aerobic.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 1; 91-102
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Repetitive neurocontroller with disturbance feedforward path active in the pass-to-pass direction for a VSI inverter with an output LC filter
    Autorzy:
    Ufnalski, B.
    Grzesiak, L. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/200017.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    repetitive control
    feedforward neural network
    dynamic optimization problem
    repetitive disturbance rejection
    voltage source inverter
    disturbance dual feedforward path
    sterowanie powtarzalne
    sieci neuronowe
    problem optymalizacji dynamicznej
    przetwornica napięcia
    odrzucanie zakłóceń
    Opis:
    An enhancement to the previously developed repetitive neurocontroller (RNC) is discussed and investigated in the paper. Originally, the time-base generator (TBG) has been used to produce the only input signal for the neural approximator. The resulting search space makes the dynamic optimization problem (DOP) of shaping the control signal solvable with the help of a function approximator such as the feed-forward neural network (FFNN). The plant under consideration, i.e. a constant-amplitude constant-frequency voltage-source inverter (CACF VSI) with an output LC filter, is assumed to be equipped with the disturbance load current sensor to enable implementation of the disturbance feed-forward (pDFF) path as a part of the non-repetitive subsystem acting in the along the pass p-direction. An investigation has been undertaken to explore potential benefits of using this signal also as an additional input for the RNC to augment the approximation space and potentially enhance the convergence rate of the real-time search process. It is numerically demonstrated in the paper that the disturbance feed-forward path active in the pass-to-pass k-direction (kDFF) improves the dynamics of the repetitive part as well indeed.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2016, 64, 1; 115-125
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Plug-in direct particle swarm repetitive controller with a reduced dimensionality of a fitness landscape – a multi-swarm approach
    Autorzy:
    Ufnalski, B.
    Grzesiak, L. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/202046.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    repetitive process control
    dynamic optimization problem
    particle swarm optimizer
    repetitive disturbance rejection
    noninteracting subswarms
    dimension-reduced fitness functional
    powtarzalne sterowanie procesem
    problem optymalizacji dynamicznej
    optymalizator rojem cząstek
    odrzucanie zakłóceń
    sprawność funkcjonalna
    Opis:
    The paper describes a modification to the recently developed plug-in direct particle swarm repetitive controller (PDPSRC) for the sine-wave constant-amplitude constant-frequency (CACF) voltage-source inverter (VSI). The original PDPSRC algorithm assumes that the particle swarm optimizer (PSO) takes into account a performance index defined over the whole reference signal period. Each particle stores all the samples of the control signal, e.g. α = 200 samples for a controller working at 10 kHz and the reference frequency equal to 50 Hz. Therefore, the fitness landscape (i.e. the performance index) is -dimensional ( D), which makes optimization challenging. That solution can be categorized as the single-swarm one. It has been previously shown that the swarm controller does not suffer from long-term stability issues encountered in the classic iterative learning controllers (ILC). However, the convergence of the swarm has to be kept at a relatively low rate to enable successful exploitation in the D search space, which in turn results in slow responsiveness of the PDPSRC. Here a multi-swarm approach is proposed in which we divide a dynamic optimization problem (DOP) among less dimensional swarms. The reference signal period is segmented into shorter intervals and the control signal is optimized in each interval independently by separate swarms. The effectiveness of the proposed approach is illustrated with the help of numerical experiments on the CACF VSI with an output LC filter operating under nonlinear loads.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 4; 857-866
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Rack cell configuration problem: a mathematical model and effective combined heuristic
    Autorzy:
    Ratkiewicz, Andrzej
    Lewczuk, Konrad
    Powiązania:
    https://bibliotekanauki.pl/articles/2090699.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    combinatorial optimization
    rack cell configuration
    space utilisation
    storage
    cutting problem
    packing problem
    optymalizacja kombinatoryczna
    konfiguracja stelaża
    wykorzystanie przestrzeni
    przechowywanie
    problem z pakowaniem
    problem z cięciem
    Opis:
    This paper discusses the configuration of a space-effective rack cell for storing a given set of heterogeneous items. Rack cells are the primary components of rack storage areas. A rack cell configuration problem (RCCP) for heterogeneous storage is formulated as a combinatorial mathematical model. An effective heuristic for solving the RCCP in practical cases is presented. The proposed heuristic consists of multistage brute force searching of defined sets of feasible solutions and solving linear integer assignment problems by the branch-and-bound method. The developed algorithm was implemented and tested, and the rack cell obtained meets the modularity requirements in the design and operation of heterogeneous storage areas.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 1; e135836, 1--11
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Rack cell configuration problem: a mathematical model and effective combined heuristic
    Autorzy:
    Ratkiewicz, Andrzej
    Lewczuk, Konrad
    Powiązania:
    https://bibliotekanauki.pl/articles/2173543.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    combinatorial optimization
    rack cell configuration
    space utilisation
    storage
    cutting problem
    packing problem
    optymalizacja kombinatoryczna
    konfiguracja stelaża
    wykorzystanie przestrzeni
    przechowywanie
    problem z pakowaniem
    problem z cięciem
    Opis:
    This paper discusses the configuration of a space-effective rack cell for storing a given set of heterogeneous items. Rack cells are the primary components of rack storage areas. A rack cell configuration problem (RCCP) for heterogeneous storage is formulated as a combinatorial mathematical model. An effective heuristic for solving the RCCP in practical cases is presented. The proposed heuristic consists of multistage brute force searching of defined sets of feasible solutions and solving linear integer assignment problems by the branch-and-bound method. The developed algorithm was implemented and tested, and the rack cell obtained meets the modularity requirements in the design and operation of heterogeneous storage areas.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 1; art. no. e135836
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-6 z 6

      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