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 164 for “"Monte-Carlo Tree Search"”.

  1. Scalable Methods For Monte Carlo Tree Search

    Monte-Carlo Tree Search (MCTS) is a versatile and adaptive heuristic tree-search algo-rithm, designed to uncover near-optimal actions by iteratively exploring decision-making points. Through its unique balance of exploration and exploitation, MCTS progressively constructs a search tree by gathering …

    wayne-thes Repository record for Scalable Methods For Monte Carlo Tree Search (opens in a new tab)

  2. Monte Carlo Tree Search: Analysis and Applications

    … to perform an analysis on variations of Monte Carlo Tree Search (MCTS). The goal is to demonstrate similarities and differences in capabilities among some of the more popular variations of MCTS. Additionally, three new applications of the MCTS algorithm are proposed and analyzed: dynamic …

    guelph Repository record for Monte Carlo Tree Search: Analysis and Applications (opens in a new tab)

  3. Real-time game agent using monte carlo tree search /

    This work investigates the application of Monte Carlo tree search (MCTS) to a real-time, high FPS Bomberman-like game, focusing on challenges such as continuous movement and simultaneous actions. The research implements a single-player MCTS tree, where opponent behaviour is simulated using …

    vilnius Repository record for Real-time game agent using monte carlo tree search / (opens in a new tab)

  4. RESOURCE CONSTRAINT COOPERATIVE GAME WITH MONTE CARLO TREE SEARCH

    A hybrid methodology of game theory and Monte Carlo Tree Search was developed and the hybrid methodology was tested with various case studies through the nurse scheduling problem to show that it was able to form Pareto front dominance solutions, finding feasible solutions that were optimal and …

    siu-theses Repository record for RESOURCE CONSTRAINT COOPERATIVE GAME WITH MONTE CARLO TREE SEARCH (opens in a new tab)

  5. INTRODUCING FUNCTIONAL MONTE CARLO TREE SEARCH METHOD FOR REINFORCEMENT LEARNING

    Monte Carlo Tree Search (MCTS) has become very influential in reinforcement learning (RL) and consequently artificial intelligence. However, these algorithms require large computational resources to generate good results and they are inflexible in terms of making dynamic corrections as decision …

    jhu Repository record for INTRODUCING FUNCTIONAL MONTE CARLO TREE SEARCH METHOD FOR REINFORCEMENT LEARNING (opens in a new tab)

  6. Neural network guided monte carlo tree search for liar's dice /

    This thesis investigates neural network guided Monte Carlo Tree Search (MCTS) for Liar's Dice. The game is a four-player imperfect-information game where players make bids while observing only their own dice and reasoning about their opponents' hidden dice. The aim of the thesis was to implement …

    vilnius Repository record for Neural network guided monte carlo tree search for liar's dice / (opens in a new tab)

  7. Nested Monte Carlo Tree Search as Applied to Samurai Sudoku

    … the game for interesting properties. The large search space presents a challenge for both generating and solving Sudoku puzzles without relying on techniques that simply permute a valid puzzle. These permutations result in puzzles that are essentially the same since they follow the same solution …

    govst Repository record for Nested Monte Carlo Tree Search as Applied to Samurai Sudoku (opens in a new tab)

  8. Path planning for autonomous aerial vehicles using Monte Carlo tree search

    … in civilian and defense applications, such as search and rescue operations, monitoring and surveillance, and aerial photography. This dissertation focuses on autonomous UAVs for tracking mobile ground targets. Our approach builds on optimization-based artificial intelligence for path planning …

    colostate Repository record for Path planning for autonomous aerial vehicles using Monte Carlo tree search (opens in a new tab)

  9. Accelerating Monte Carlo Tree Search for discrete action grand strategy games

    … costs are move generation, breadth-first search over maps, and repeated state cloning. This reduces the iterations for effective search in the time budget. Sequential Monte Carlo Tree Search addresses the move generation problem by decomposing the action space per territory, but the …

    gatech Repository record for Accelerating Monte Carlo Tree Search for discrete action grand strategy games (opens in a new tab)

  10. Monte Carlo Tree Search for games with Hidden Information and Uncertainty

    Monte Carlo Tree Search (MCTS) is an AI technique that has been successfully applied to many deterministic games of perfect information, leading to large advances in a number of domains, such as Go and General Game Playing. Imperfect information games are less well studied in the field of AI …

    whiterose Download PDF for Monte Carlo Tree Search for games with Hidden Information and Uncertainty (opens in a new tab)

  11. Procedural content generation of Angry Birds levels using Monte Carlo Tree Search

    Monte Carlo Tree Search is a method for searching a decision-making process, usually employed in domains such as general game playing, where an artificial intelligence agent must decide the next move to make in a game simulation. There have been other domains that have been explored for MCTS, one …

    texas Repository record for Procedural content generation of Angry Birds levels using Monte Carlo Tree Search (opens in a new tab)

  12. Multiagent Monte Carlo Tree Search with Difference Evaluations and Evolved Rollout Policy

    Monte Carlo Tree Search (MCTS) is a best-first search algorithm that has produced many breakthroughs in AI research. MCTS has been applied to a wide variety of domains including turn-based board games, real-time strategy games, multiagent systems, and optimization problems. In addition to its …

    unr Repository record for Multiagent Monte Carlo Tree Search with Difference Evaluations and Evolved Rollout Policy (opens in a new tab)

  13. Computer Go and Monte Carlo Tree Search: Opening Book and Parallel Solutions

    This work examines two aspects of Monte Carlo Tree Search (MCTS), a recent invention in the field of artificial intelligence. We propose a method to guide a Monte Carlo Tree Search in the initial moves of the game of Go. Our method matches the current state of a Go board against clusters of board …

    umn Repository record for Computer Go and Monte Carlo Tree Search: Opening Book and Parallel Solutions (opens in a new tab)

  14. Analysis and Enhancement of Monte Carlo Tree Search Techniques for Energy Applications

    … rol. Deze thesis onderzoekt de mogelijkheden van Monte Carlo Tree Search (MCTS) als veelzijdige regel- en planningsmethode voor DR-toepassingen in de energiesector. Aan de hand van vijf bijdragen toont de thesis aan dat MCTS de vooruitkijkende besluitvorming van Model Predictive Control combineert …

    ghent Repository record for Analysis and Enhancement of Monte Carlo Tree Search Techniques for Energy Applications (opens in a new tab)

  15. Monte-Carlo Tree Search Algorithm in the Graph of Convex Sets Trajectory Planner

    … in complex scenarios. By introducing an advanced search algorithm, such as the Monte-Carlo Tree Search (MCTS) algorithm, into the GCS planner, the optimal path through these complex and dynamic environments can be found quicker and more effectively. This paper introduces the MCTS-GCS Trajectory …

    tamu Repository record for Monte-Carlo Tree Search Algorithm in the Graph of Convex Sets Trajectory Planner (opens in a new tab) Embargoed until 2027-12-01

  16. Monte-Carlo Tree Search Algorithm in the Graph of Convex Sets Trajectory Planner

    … in complex scenarios. By introducing an advanced search algorithm, such as the Monte-Carlo Tree Search (MCTS) algorithm, into the GCS planner, the optimal path through these complex and dynamic environments can be found quicker and more effectively. This paper introduces the MCTS-GCS Trajectory …

    tamu Repository record for Monte-Carlo Tree Search Algorithm in the Graph of Convex Sets Trajectory Planner (opens in a new tab) Embargoed until 2027-12-01

  17. Monte-Carlo Tree Search Algorithm in the Graph of Convex Sets Trajectory Planner

    … in complex scenarios. By introducing an advanced search algorithm, such as the Monte-Carlo Tree Search (MCTS) algorithm, into the GCS planner, the optimal path through these complex and dynamic environments can be found quicker and more effectively. This paper introduces the MCTS-GCS Trajectory …

    tamu Repository record for Monte-Carlo Tree Search Algorithm in the Graph of Convex Sets Trajectory Planner (opens in a new tab) Embargoed until 2027-12-01

  18. Monte-Carlo Tree Search Algorithm in the Graph of Convex Sets Trajectory Planner

    … in complex scenarios. By introducing an advanced search algorithm, such as the Monte-Carlo Tree Search (MCTS) algorithm, into the GCS planner, the optimal path through these complex and dynamic environments can be found quicker and more effectively. This paper introduces the MCTS-GCS Trajectory …

    tamu Repository record for Monte-Carlo Tree Search Algorithm in the Graph of Convex Sets Trajectory Planner (opens in a new tab) Embargoed until 2027-12-01

Page 1 of 9