Research Publications
All | |
| Narrow your search | 271 result(s) |
By Type
By Year By Research Group | Any-angle pathfinding is a common problem from robotics and computer games: it requires finding a Euclidean shortest path between a pair of points in a grid map. Prior research has focused on approximate online solutions. A number of exact methods ... All-pairs shortest paths (APSP) can eliminate the need to search in a graph, providing optimal moves very fast. A major challenge is storing pre-computed APSP data efficiently. Recently, compression has successfully been employed to scale the use of ... Moving target search, where the goal state changes during a search, has recently seen a revived interest. I-ARA* is a very recent, state-of-the-art incremental algorithm for moving target search in a known terrain. In this work, we address the problem ... This is a review book that will be published as a SpringerBrief. It contains no NICTA IP. I seek pre-approval for publication. A particularly difficult class of scheduling and routing problems involves an objective that is a sum of time-varying action costs, which increases the size and complexity of the problem. Solve-and-improve approaches, which find an initial solution for a ... We propose an adaptive heuristic for model restarts that aligns symmetry breaking with the dynamic branching heuristic. Experiments show that this method performs very well compared to other symmetry breaking methods. Cumulative resource constraints can model scarce resources in scheduling problems or a dimension in packing and cutting problems. In order to efficiently solve such problems with a constraint programming solver, it is important to have strong and fast ... In this paper we propose a forward-backward improvement heuristic for the variant of resource-constrained project scheduling problem aiming to maximise the net present value of a project. It relies on the Lagrangian relaxation method to generate an ... We study the computational complexity of manipulating two stage voting rules like Black's procedure. This voting rule selects the Condorcet winner if they exist and otherwise elects the Borda winner. In general, there is no connection between the ... Social networks are increasingly being used to conduct polls. We introduce a simple model of such social polling. We suppose agents vote sequentially, but the order in which agents choose to vote is not necessarily fixed. We also suppose that an agent’s ... |