Search
Skip to Search Results- 1ElNimr, Amr
- 1Gallivan, Matthew
- 1Khorshid, Mokhtar
- 1Mashayekhi, Reza
- 1Mohammad Lavasani, Sepehr
- 1Rayner, David Christopher Ferguson
-
Fall 2011
Multi-agent pathfinding problems involve finding plans for agents that must travel from their start locations to their targets without colliding. Recent work produced a number of algorithms to solve the problem as well as an ample supply of related theory. This work is based on a related work...
-
Fall 2021
Heuristic search is a core area of Artificial Intelligence (AI) with numerous applications. In video games it is commonly used to calculate paths of AI-controlled agents. Traditionally, heuristic search algorithms have been designed by humans. Recent work attempted to synthesise heuristic search...
-
Spring 2015
Rayner, David Christopher Ferguson
Heuristic search is a central problem in artificial intelligence. Among its defining properties is the use of a heuristic, a scalar function mapping pairs of states to an estimate of the actual distance between them. Accurate heuristics are generally correlated with faster query resolution and...
-
Spring 2023
Pathfinding has been an interesting research area throughout the years. Heuristic search algorithms are used to find a path with the minimum length between a start and a goal in a graph, which has applications in GPS navigation and video games. There are different ways to create a heuristic for...
-
Enhancing space modeling and mobile resources planning in construction operations through a simulation driven visualization framework
DownloadFall 2011
Simulation modeling is a strong tool that has not been utilized to its expected potential in day to day construction industry activities. One of the reasons contributing to that is the inability of simulation models to depict changes in site space in an intuitive way. This research tries to...
-
Fall 2018
Videogames often use artificial intelligence to control characters in the game world. In doing so, videogames require one or more agents to navigate from their current location to some desired goal location without collisions. We explore improving algorithm performance in both single and...
-
Spring 2024
In recent years, significant strides in optimal bidirectional heuristic search (Bi-HS) have deepened our theoretical understanding and boosted performance. Yet, algorithms for Bi-HS in unbounded suboptimal scenarios remains largely unexplored. Despite leveraging front-to-end (F2E) and...