Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 81 for “"Heuristic programming."”.

  1. Training Strategies for Critic and Action Neural Networks in Dual Heuristic Programming Method

    … and details of training procedures for the Dual Heuristic Programming (DHP) methodology. This and other approximate dynamic programming approaches (HDP, DHP, GDHP) have been discussed in some detail in the literature, all being members of the Adaptive Critic Design (ACD) family. The example …

    portland-state Repository record for Training Strategies for Critic and Action Neural Networks in Dual Heuristic Programming Method (opens in a new tab)

  2. Control of a nonlinear multivariable system with adaptive critic designs

    … function from the Bellman equation of dynamic programming or some function related to it, and then find the optimal solution of the problem by applying a reinforcement learning technique. In ACD we have two networks called critic and action (a substitute name for "controller" in the ACD …

    ttu Repository record for Control of a nonlinear multivariable system with adaptive critic designs (opens in a new tab)

  3. A New Gravitational Approach to Least Transportation Cost Warehouse Location

    … because the approaches involving linear programming, simulation, or heuristic programming do not by definition generate an optimal location.

    unt Repository record for A New Gravitational Approach to Least Transportation Cost Warehouse Location (opens in a new tab)

  4. Control of ball and beam with neural networks

    … uses a form of approximate dynamic programming called an adaptive critic design. A hierarchy of such designs exists. Our system uses Dual Heuristic Programming (DHP), an upper-level design. To our best knowledge, our results are the first use of DHP to control a physical system. It …

    ttu Repository record for Control of ball and beam with neural networks (opens in a new tab)

  5. O problema do caixeiro viajante alugador : um estudo algorítmico

    … algorithmic implementation of six metaheuristic solutions, representing adaptations of the best of state-of-the-art heuristic programming. New neighborhoods, construction procedures, search operators, evolutionary agents, cooperation by multi-pheromone are created for this problem. …

    brazil-ufrn Repository record for O problema do caixeiro viajante alugador : um estudo algorítmico (opens in a new tab)

  6. Adaptive dynamic programming with eligibility traces and complexity reduction of high-dimensional systems

    … particularly clustering and adaptive dynamic programming (ADP) designs especially heuristic dynamic programming (HDP) and dual heuristic programming (DHP). Moreover, a one-step temporal-difference (TD(0)) and <em>n</em>-step TD (TD(λ)) with their gradients are utilized as learning algorithms …

    must-thes Repository record for Adaptive dynamic programming with eligibility traces and complexity reduction of high-dimensional systems (opens in a new tab)

  7. Value-Gradient Learning

    This thesis presents an Adaptive Dynamic Programming method, Value-Gradient Learning, for solving a control optimisation problem, using a neural network to represent a critic function in a large continuous-valued state space. The algorithm developed, called VGL(λ), requires a learned differentiable …

    city-london Download PDF for Value-Gradient Learning (opens in a new tab)

  8. A flexible construction and improvement heuristic for the quadratic assignment problem

    This thesis is concerned with the development of heuristic algorithms for the popular Quadratic Assignment Problem (QAP) which finds a wide variety of applications in various fields. This discrete optimization problem, which seeks the placement of m facilities on m locations in order to minimize a …

    vt Repository record for A flexible construction and improvement heuristic for the quadratic assignment problem (opens in a new tab)

  9. A group theoretic approach to metaheuristic local search for partitioning problems

    … the power of combining group theory with metaheuristic search methodologies to solve discrete optimization problems. Group theory provides tools to characterize the underlying structures in move neighborhoods, solution representations and solution landscapes. Exploiting these structures with …

    texas Repository record for A group theoretic approach to metaheuristic local search for partitioning problems (opens in a new tab)

  10. Software Cache in Global Heuristic Searches

    No abstract prepared.

    texas-state Repository record for Software Cache in Global Heuristic Searches (opens in a new tab)

Page 1 of 5