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ę "approximate dynamic programming" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-7 z 7
    Tytuł:
    An Algorithm for Construction of varepsilon-Value Functions for the Bolza Control Problem
    Autorzy:
    Jacewicz, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/908335.pdf
    Data publikacji:
    2001
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    optymalizacja nieliniowa
    sterowanie optymalne
    nonlinear optimization
    Bolza problem
    optimal control
    Hamilton-Jacobi equation
    dynamic programming
    varepsilon-value function
    approximate minimum
    Opis:
    The problem considered is that of approximate numerical minimisation of the non-linear control problem of Bolza. Starting from the classical dynamic programming method of Bellman, an varepsilon-value function is defined as an approximation for the value function being a solution to the Hamilton-Jacobi equation. The paper shows how an varepsilon-value function which maintains suitable properties analogous to the original Hamilton-Jacobi value function can be constructed using a stable numerical algorithm. The paper shows the numerical closeness of the approximate minimum to the infimum of the Bolza functional.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2001, 11, 2; 391-428
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Method for Constructing ε-value Functions for The Bolza Problem of Optimal Control
    Autorzy:
    Pustelnik, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/911140.pdf
    Data publikacji:
    2005
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    optymalizacja nieliniowa
    sterowanie optymalne
    równanie Hamiltona-Jacobiego
    programowanie dynamiczne
    wartość funkcji
    nonlinear optimization
    Bolza problem
    optimal control
    Hamilton-Jacobi equation
    dynamic programming
    value function
    approximate minimum
    Opis:
    The problem considered is that of approximate minimisation of the Bolza problem of optimal control. Starting from Bellman's method of dynamic programming, we define the ε-value function to be an approximation to the value function being a solution to the Hamilton-Jacobi equation. The paper shows an approach that can be used to construct an algorithm for calculating the values of an ε-value function at given points, thus approximating the respective values of the value function.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2005, 15, 2; 177-186
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Approximating the solution of a dynamic, stochastic multiple knapsack problem
    Autorzy:
    Hartman, J. C.
    Perry, T. C.
    Powiązania:
    https://bibliotekanauki.pl/articles/970874.pdf
    Data publikacji:
    2006
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    programowanie liniowe
    dualność
    stochastic dynamic programming
    approximate dynamic programming
    linear programming
    duality
    Opis:
    We model an environment where orders arrive probabilistically over time, with their revenues and capacity requirements becoming known upon arrival. The decision is whether to accept an order, receiving a reward and reserving capacity, or reject an order, freeing capacity for possible future arrivals. We model the dynamic, stochastic multiple knapsack problem (DSMKP) with stochastic dynamic programming (SDP). Multiple knapsacks are used as orders may stay in the system for multiple periods. As the state space grows exponentially in the number of knapsacks and the number of possible orders per period, we utilize linear programming and duality to quickly approximate the end-of-horizon values for the SDP. This helps mitigate end-of-study effects when solving the SDP directly, allowing for the solution of larger problems and leading to increased quality in solutions.
    Źródło:
    Control and Cybernetics; 2006, 35, 3; 535-550
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An approximate dynamic programming approach for semi-cooperative multi-agent resource management
    Autorzy:
    Boukhtouta, A.
    Berger, J.
    George, A.
    Powell, W. B.
    Powiązania:
    https://bibliotekanauki.pl/articles/1396741.pdf
    Data publikacji:
    2012
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    approximate dynamic programming
    agent
    semi-cooperative
    multi-agent
    resource management
    Opis:
    Complex problems involving multiple agents exhibit varying degrees of cooperation. The levels of cooperation might reflect both differences in information as well as differences in goals. In this research, we develop a general mathematical model for distributed, semicooperative planning and suggest a solution strategy which involves decomposing the system into subproblems, each of which is specified at a certain period in time and controlled by an agent. The agents communicate marginal values of resources to each other, possibly with distortion. We design experiments to demonstrate the benefits of communication between the agents and show that, with communication, the solution quality approaches that of the ideal situation where the entire problem is controlled by a single agent.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 3; 201-214
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Application of differential games in mechatronic control system
    Autorzy:
    Hendzel, Z.
    Penar, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/264495.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    gry różniczkowe
    optymalna kontrola
    programowanie dynamiczne
    differential games
    optimal control
    approximate dynamic programming
    Opis:
    Differential games are a combination of game theory and optimum control methods. Their solutions are based on Bellman's principle of optimality. In this paper, the zero-sum differential game theory has been used for the purposes of controlling a mechatronic object: a single-link manipulator. In this case, analytical solutions are unavailable, thus approximate solutions were used. Two approximation methods were compared with the use of numerical simulations and selected quality indicators. The results confirm previous assumptions and the connection between the differential game theory and H∞ control problems.
    Źródło:
    International Journal of Applied Mechanics and Engineering; 2016, 21, 4; 867-878
    1734-4492
    2353-9003
    Pojawia się w:
    International Journal of Applied Mechanics and Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A linear programming methodology for approximate dynamic programming
    Autorzy:
    Díaz, Henry
    Sala, Antonio
    Armesto, Leopoldo
    Powiązania:
    https://bibliotekanauki.pl/articles/330082.pdf
    Data publikacji:
    2020
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    linear programming
    approximate dynamic programming
    control applications
    neural network
    programowanie liniowe
    programowanie dynamiczne
    sieć neuronowa
    Opis:
    The linear programming (LP) approach to solve the Bellman equation in dynamic programming is a well-known option for finite state and input spaces to obtain an exact solution. However, with function approximation or continuous state spaces, refinements are necessary. This paper presents a methodology to make approximate dynamic programming via LP work in practical control applications with continuous state and input spaces. There are some guidelines on data and regressor choices needed to obtain meaningful and well-conditioned value function estimates. The work discusses the introduction of terminal ingredients and computation of lower and upper bounds of the value function. An experimental inverted-pendulum application will be used to illustrate the proposal and carry out a suitable comparative analysis with alternative options in the literature.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2020, 30, 2; 363-375
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analysis of pandemic with game methodology and numerical approximation
    Autorzy:
    Matusik, Radosław
    Nowakowski, Andrzej
    Powiązania:
    https://bibliotekanauki.pl/articles/29432416.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    COVID-19
    game model of pandemic
    approximate dual dynamic programming
    sufficient approximate optimality conditions for Nash equilibrium
    numerical algorithm
    Opis:
    We build a mathematical game model of pandemic transmission, including vaccinations of population and budget costs of different acting to eliminate pandemic. We assume the interactions among different groups: vaccinated, susceptible, exposed, infectious, super-spreaders, hospitalized and fatality, defining a system of ordinary differential equations, which describes compartment model of disease and costs of the treatment. The goal of the game is to describe the development disease under different types of treatment, but including costs of them and social restrictions, during the shortest time period. To this effect we construct a dual dynamic programming method to describe open-loop Nash equilibrium for treatment, a group of people having antibodies and budget costs. Next, we calculate numerically an approximate open-loop Nash equilibrium.
    Źródło:
    Archives of Control Sciences; 2023, 33, 3; 651--680
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-7 z 7

      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