Daniel Harabor

On this page you will find links to descriptions of my work, summaries of my main findings and various GPL-licenced source code that I have made available. Click on a project title for more information.

Pathfinding on Grid Maps

This project is concerned with both optimal and approximate techniques for speeding up pathfinding search on regular graphs such as grid maps. As part of this work Jump Point Search, Rectangular Symmetry Reduction and Hierarchical Annotated A* algorithms are developed.

Informed Local Search for TSPs

This project investigates the feasibility of informed heuristics for guiding local search algorithms in solving the Travelling Salesman Problem.

NICTA Projects

In addition to my personal research activities, I have also been working as a Research Programmer at National ICT Australia (NICTA). This page describes some of the projects I have been involved with in that capacity.