Discovery Projects - Grant ID: DP0346396

Funding Activity

Website
http://dataportal.arc.gov.au/NCGP/API/grants/DP0346396

Funding Status
Closed

Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the .

Funded Activity Summary

Efficient Computational Methods for Constrained Path Problems. We consider a class of path design problems which arise when an object needs to traverse between two points through a specified region. The region may be a continuous space or the path may be restricted to the edges of a network. The path must optimise a prescribed criterion such as risk, reliability or cost and satisfy a number of constraints. Problems of this type readily arise in the defence, transport and communication industries. In addition to efficient solution methods for these problems the project will produce computational tools for a wide range of related network routing problems.

Funded Activity Details

Start Date: 2003

End Date: 01-2006

Funding Scheme: Discovery Projects

Funding Amount: $172,536.00

Funder: Australian Research Council

Research Topics

ANZSRC Field of Research (FoR)

Computation Theory And Mathematics Not Elsewhere Classified | Optimisation | Mathematical Software | Computation Theory and Mathematics

ANZSRC Socio-Economic Objective (SEO)

Navy | Application packages | Mathematical sciences |

Related Links