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 11 of 11 for “"incremental search"”.
-
Incremental search algorithms for on-line planning
… a state of “complexity induced uncertainty”, ii) search control – which node to expand next, iii) stopping – when to stop searching. Decision making is treated as a value estimation problem. By representing the agent’s uncertainty in probabilistic terms this can be solved using decision theoretic …
-
Effects of Individual versus Group Incentives on Group Problem Solving
… of distributed knowledge. However, very little research has investigated group problem solving, specifically in terms of incentives and problem structure. This research uses laboratory experiments to investigate the effects of individual versus group goal conflict on collaborative behaviour and …
-
Lifelong Planning A* for cost monoids
In this paper we evaluate how the heuristic search algorithm A* and the incremental search algorithm LPA* work on graphs with weights taken from a cost monoid. LPA* is shown to fail for certain graphs weighted by cost monoids. The main result of this thesis is a modified version of LPA* which can …
-
Partitioned rendering infrastructure for stable accordion navigation
… contest, with TreeJuxtaposer supported by an incremental search feature and an improved user interface.
-
Tagamajig: Image Recognition via Crowdsourcing
… manuscripts that Oxford University researchers had struggled to efficiently translate for over a century.</p> <p>For this particular problem, we propose releasing the image collections to the public through a web application. The application would target outdoor enthusiasts, …
-
Generalized Heuristic Search Algorithms with Applications to Motion Planning and Multi-Agent Path Finding Problems
… suboptimality guarantees. A set of heuristic search algorithms is developed to utilize relaxed notions of relevancy to more efficiently solve path planning, motion planning and multi-agent path finding problems. The main focus of this thesis is to demonstrate how using generalized heuristics …
-
Moment resistant connections made with timber rivets in wood product substrates
… the internal and external moments is found by an incremental search. MS Visual Basic was used to implement this search. The instantaneous centre of rotation, and subsequent moment capacity, was found for every degree of preset rotation up to an ultimate capacity. This was implemented for various …
-
EFFECTS OF TASK STRUCTURE ON GROUP PROBLEM SOLVING
… strategy in group problem solving. Previous researchers have focused their efforts on individual problem solving with minimal reference to groups. This is due to difficulties such as the presence of distributed information, the coordination of people and the large scale of work that typified …
-
Vehicle dispatch in high-capacity shared autonomous mobility-on-demand systems
… information is concerned. It uses an incremental search method that can quickly prune out infeasible candidates to reduce the search space. It also has an iterative re-optimization strategy to dynamically alter the assignment policy to take into account both previous and newly revealed …
-
Global optimisation of multiple gravity assist trajectories
… targets with low propellant consumption. The search for optimal transfer trajectories can be formulated as a mixed combinatorial-continuous global optimisation problem; however, it is known that the problem is difficult to solve, especially if deep space manoeuvres (DSM) are considered. This …
-
Computational Intelligence for Cooperative Swarm Control
… conservation. Swarm robots can collaborate to search for survivors, locate victims, and assess damage in hazardous environments during an earthquake or natural disaster. They can coordinate their movements and share data in real-time to increase their efficiency and effectiveness while guiding …