Skip to main content

Discrete Optimisation for Multi-Agent Path Finding

Primary supervisor

Pierre Le Bodic


The Multi-Agent Path Finding (MAPF) is a combinatorial problem in which agents must find a path from a start to a goal location without colliding with each other. The optimisation group at Monash is leading research in this area and has designed some of the most efficient methods to solve MAPF. Companies like Amazon have funded the optimisation group at Monash to do research on MAPF as it relies on this technology for its automated warehouses and fulfilment centres.

The aim of this project is to use discrete optimisation techniques (e.g. Integer Programming) to design new algorithms for MAPF. An example of previous research in this direction was published in IJCAI.

Required knowledge

The candidate should have a strong background in optimisation and/or computer science.

Learn more about minimum entry requirements.