|
Title:
|
HEURISTIC PREDICTIVE PATH SEARCH IN A PHYSICAL PUZZLE |
|
Author(s):
|
Dana Cremer , Dana Vrajitoru |
|
ISBN:
|
978-972-8924-62-1 |
|
Editors:
|
Hans Weghorn and Ajith P. Abraham |
|
Year:
|
2008 |
|
Edition:
|
Single |
|
Keywords:
|
search algorithm, physical simulation, heuristic |
|
Type:
|
Full Paper |
|
First Page:
|
147 |
|
Last Page:
|
154 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
This paper presents a few heuristic path search algorithms to solve a physical puzzle consisting of 3D maze and a marble,
simulated in a physically accurate environment. An intelligent agent must move the marble to a target cell by rotating the
maze itself. The physical nature of the puzzle provides an interesting challenge for the agent attempting to solve it, since
it does not have complete control over the effects of its actions, and is not able to predict with certainty what those effects
will be. The algorithms presented are based on building a physical state graph from past observations and using a
predictive utility function to estimate the closeness to the target. The implemented algorithms incorporate varying levels
of knowledge of the maze's geometry and of the physics involved. |
|
|
|
|
|
|
