SearchSkip to Search Results
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...
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...
Enhancing space modeling and mobile resources planning in construction operations through a simulation driven visualization frameworkDownload
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...
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...