Heuristic search algorithms have long been used in video-game AI for unit navigation and planning. The quality of the solution they produce depends substantially on the quality of the heuristic function they use. Recent work automatically synthesized human-readable heuristic functions for a given pathfinding map. This enables tailoring a heuristic to the map but is expensive since each map requires an independent synthesis run. In this paper we propose and evaluate re-using elements of heuristics synthesized for one map in synthesizing heuristics for another map. We do so by adding parts of a synthesized heuristic back to the grammar that defines the space of heuristic functions for the synthesis
A key challenge in program synthesis concerns how to efficiently search for the desired program in t...
Real-time search methods allow an agent to perform path-finding tasks in unknown environments. Some ...
The performance of heuristic search based planners depends heavily on the quality of the heuristic f...
Heuristic search is a key component of automated planning and pathfinding. It is guided by a heurist...
International audienceHeuristics are often used to solve complex problems. Indeed, such problem-spec...
Progress has been made recently in developing tech- niques to automatically generate effective heuri...
As computer game worlds get more elaborate the more visible pathnding performance bottlenecks become...
Abstract We propose a grammar-based genetic programming framework that generates variable-selection ...
The current research trends on hyper-heuristics design have sprung up in two different flavours: heu...
This paper formulates the problems of natural language generation and parsing as particular instance...
Our goal is to automatically generate heuristics to guide state space search. The heuristic values a...
This thesis presents research that examines the effectiveness of several different program synthesis...
Abstract The current research trends on hyper-heuristics design have sprung up in two different flav...
Abstract. Real-time heuristic search algorithms are useful when the amount of time or memory resourc...
We present a novel heuristic search framework, called Multi-Heuristic A * (MHA*), that simultaneousl...
A key challenge in program synthesis concerns how to efficiently search for the desired program in t...
Real-time search methods allow an agent to perform path-finding tasks in unknown environments. Some ...
The performance of heuristic search based planners depends heavily on the quality of the heuristic f...
Heuristic search is a key component of automated planning and pathfinding. It is guided by a heurist...
International audienceHeuristics are often used to solve complex problems. Indeed, such problem-spec...
Progress has been made recently in developing tech- niques to automatically generate effective heuri...
As computer game worlds get more elaborate the more visible pathnding performance bottlenecks become...
Abstract We propose a grammar-based genetic programming framework that generates variable-selection ...
The current research trends on hyper-heuristics design have sprung up in two different flavours: heu...
This paper formulates the problems of natural language generation and parsing as particular instance...
Our goal is to automatically generate heuristics to guide state space search. The heuristic values a...
This thesis presents research that examines the effectiveness of several different program synthesis...
Abstract The current research trends on hyper-heuristics design have sprung up in two different flav...
Abstract. Real-time heuristic search algorithms are useful when the amount of time or memory resourc...
We present a novel heuristic search framework, called Multi-Heuristic A * (MHA*), that simultaneousl...
A key challenge in program synthesis concerns how to efficiently search for the desired program in t...
Real-time search methods allow an agent to perform path-finding tasks in unknown environments. Some ...
The performance of heuristic search based planners depends heavily on the quality of the heuristic f...