Stochastic Geometry for Multi-sensor Data Fusion System. The aim of this project is to develop efficient algorithms for tracking and sensor management in a multi-sensor multi-target environment. Finite random set theory provides a natural way of representing a random number of (random) object states, an issue that has been largely ignored in the tracking literature until recently. Although a satisfactory foundation for multiple object filtering has been provided by random set theory, in this ear ....Stochastic Geometry for Multi-sensor Data Fusion System. The aim of this project is to develop efficient algorithms for tracking and sensor management in a multi-sensor multi-target environment. Finite random set theory provides a natural way of representing a random number of (random) object states, an issue that has been largely ignored in the tracking literature until recently. Although a satisfactory foundation for multiple object filtering has been provided by random set theory, in this early stage no algorithm capable of tracking many targets has emerged from this framework. We are confident that efficient algorithms can be developed by exploiting the insights and mathematical tools of stochastic geometryRead moreRead less
Optimal Deployment of Wireless Sensor Networks. Wireless sensor networks consist of coordinated sensing devices that offer us new ways to understand and interact with the physical world. Australia is a leading player in developing such networks. For a given technology, the key to both optimising the quality of area monitoring and minimising the cost of a sensor network lies in deciding how best to deploy the sensors. We aim to develop powerful new methods to get the best performance from a plann ....Optimal Deployment of Wireless Sensor Networks. Wireless sensor networks consist of coordinated sensing devices that offer us new ways to understand and interact with the physical world. Australia is a leading player in developing such networks. For a given technology, the key to both optimising the quality of area monitoring and minimising the cost of a sensor network lies in deciding how best to deploy the sensors. We aim to develop powerful new methods to get the best performance from a planned sensor network. This will enhance Australia's research role in this area and directly benefit applications such as national security and environmental monitoring.
Read moreRead less
Information Geometry and Compressive Sensing for Radar and Communications. Australia's vast distances, thin population and extensive sea approaches force us to place heavy reliance on telecommunications and the remote sensing that radar and other modalities can provide. This project will enchance capabilities in sensing to provide more reliable, robust and cost effective communications and surveillance over a wide area.
ARC Research Network on Intelligent Sensors, Sensor Networks and Information Processing. Sensor networks, a collection of diverse sensors interconnected via an ad-hoc communication network, are identified as one of the key technologies that over the next two decades will change the way we live. This research network brings together an interdisciplinary team of outstanding Australian researchers representing all the key disciplines required to successfully deploy sensor networks and links this te ....ARC Research Network on Intelligent Sensors, Sensor Networks and Information Processing. Sensor networks, a collection of diverse sensors interconnected via an ad-hoc communication network, are identified as one of the key technologies that over the next two decades will change the way we live. This research network brings together an interdisciplinary team of outstanding Australian researchers representing all the key disciplines required to successfully deploy sensor networks and links this team with the foremost international authorities and leading industry players in the area of sensor networks. This research network will guide collaborative research that will ensure Australia to play a world leading role in sensor network development and implementation.
Read moreRead less
New Analytical Perspectives on the Algorithmic Complexity of the Hamiltonian Cycle Problem. Hamiltonian Cycle Problem (HCP), known - in the complexity theory of
algorithms -to be NP-hard is proposed for study, from three innovative,
separate (yet related) analytical perspectives: singularly perturbed
(controlled) Markov chains, that links the HCP with systems and control
theories; parametric nonconvex optimization, that links HCP with fast
interior point methods of modern optimization an ....New Analytical Perspectives on the Algorithmic Complexity of the Hamiltonian Cycle Problem. Hamiltonian Cycle Problem (HCP), known - in the complexity theory of
algorithms -to be NP-hard is proposed for study, from three innovative,
separate (yet related) analytical perspectives: singularly perturbed
(controlled) Markov chains, that links the HCP with systems and control
theories; parametric nonconvex optimization, that links HCP with fast
interior point methods of modern optimization and the spectral approach
based on a novel adaptation of Ihara-Selberg trace formula for regular
graphs. Our mathematical approach to this archetypal complex problem of graph
theory and discrete optimization promises to enhance the fundamental
understanding - and ultimate "managibility" - of the underlying
difficulty of HCP.
Read moreRead less
Faster, cheaper, better: mathematical advances for improved design and scheduling of robotic instrumentation. This project extends previous research addressing mathematical challenges in the optimal design and scheduling of robotic instrumentation. The Partner Organisation manufactures instruments for cancer diagnostics, and designs instruments that need to produce rapid, high-quality results, at a reasonable cost in a competitive market. It is intended that powerful new scheduling algorithms wi ....Faster, cheaper, better: mathematical advances for improved design and scheduling of robotic instrumentation. This project extends previous research addressing mathematical challenges in the optimal design and scheduling of robotic instrumentation. The Partner Organisation manufactures instruments for cancer diagnostics, and designs instruments that need to produce rapid, high-quality results, at a reasonable cost in a competitive market. It is intended that powerful new scheduling algorithms will be devised to handle their complex problem, which is more challenging than standard problems. The developed methodologies aim to reduce the product development cycle and boost the competitiveness of Australian manufacturers. In addition, new theoretical and algorithmic contributions aim to enable improved scheduling in other application areas.Read moreRead less
New Theory and Algorithms for Nonsmooth Optimisation with Application to Integer Programming. Mathematical optimisation plays a key role in a wide variety of applications in business, industry, engineering and science. For example, airlines cannot fly and radiation treatment for cancer cannot be delivered without solving (a series of) optimisation problems. Some classes of optimisation problem are very well solved, with clear mathematical foundations, efficient algorithms, and reliable software ....New Theory and Algorithms for Nonsmooth Optimisation with Application to Integer Programming. Mathematical optimisation plays a key role in a wide variety of applications in business, industry, engineering and science. For example, airlines cannot fly and radiation treatment for cancer cannot be delivered without solving (a series of) optimisation problems. Some classes of optimisation problem are very well solved, with clear mathematical foundations, efficient algorithms, and reliable software implementations. Both nonsmooth and integer optimisation problems have a good mathematical basis, but there are "gaps"; existing methods cannot always solve real industrial problems. This project will deliver better methods, built on better theory, and so will yield better solutions for important applications.Read moreRead less
Modelling the structure of Australian wool auction prices. Australian wool auction ($3.5-4 billions per year) is an on-going process. The prices paid in this auction market are used by the Australian production and service sectors to identify the quality preferences the international retail markets and the intermediate processors. The proposed research will optimise the information that can be extracted and used by these sectors in the production and distribution of the raw wool clip. A two- ....Modelling the structure of Australian wool auction prices. Australian wool auction ($3.5-4 billions per year) is an on-going process. The prices paid in this auction market are used by the Australian production and service sectors to identify the quality preferences the international retail markets and the intermediate processors. The proposed research will optimise the information that can be extracted and used by these sectors in the production and distribution of the raw wool clip. A two-stages algorithm in tree-based regression will be developed. The project will provide a challenge environment to train a Ph.D. student in agriculture modelling and optimisation.Read moreRead less
Doubly Stochastic Matrices & The Hamiltonian Cycle Problem. The classical hard problem of determining whether a given graph possesses a Hamiltonian cycle contains the essential difficulty of the famous 'Travelling Salesman Problem'. A characterisation of this difficulty in terms of variability of returns (to the initial state) in a controlled stochastic process will be a significant conceptual advance with repercussions in a number of fields including optimisation and theoretical computer scien ....Doubly Stochastic Matrices & The Hamiltonian Cycle Problem. The classical hard problem of determining whether a given graph possesses a Hamiltonian cycle contains the essential difficulty of the famous 'Travelling Salesman Problem'. A characterisation of this difficulty in terms of variability of returns (to the initial state) in a controlled stochastic process will be a significant conceptual advance with repercussions in a number of fields including optimisation and theoretical computer science. Algorithmic advances exploiting such a characterisation will significantly contribute to existing technologies for solving problems in applications ranging from logistics to cryptography. Since TSP describes certain efficient ways of routing its applicability to information networks is clear.Read moreRead less
Distributed Optimisation without Central Coordination. This project will develop the mathematical foundations for discovery and analysis of iterative methods for optimisation problems in distributed computing systems. Most methods in distributed optimisation were not designed for distributed computing, rather they were adapted for purpose post-hoc. By building on recent advances in monotone operator splitting, this project expects to develop a mathematical theory for decentralised optimisation a ....Distributed Optimisation without Central Coordination. This project will develop the mathematical foundations for discovery and analysis of iterative methods for optimisation problems in distributed computing systems. Most methods in distributed optimisation were not designed for distributed computing, rather they were adapted for purpose post-hoc. By building on recent advances in monotone operator splitting, this project expects to develop a mathematical theory for decentralised optimisation algorithms specially designed for distributed systems. The framework is expected to produce a suite of algorithms, each customised to exploit a specific network configuration. The project will provide significant benefits in distributed machine learning applications such as federated learning.Read moreRead less