University of Technology SydneyEngineering home

Dr. Haye Lau

I am a post-doctoral Research Fellow in the ARC Centre of Excellence for Autonomous Systems (CAS). For now this site still primarily reflects the research conducted as part of my completed doctoral thesis, but it will be updated to include my current projects once the relevant agreements between UTS and a partnering organisation for the projects are finalised.

My focus is on the optimal search of indoor environments - in particular the optimal searcher path problem (also known as the constrained path, moving target search problem) applied to regions with non-uniform travel costs.

My ME project for the first year was part of a UTS collaboration with ADI Limited (now Thales Australia)'s Electronics and Aerospace Business Group.

Please have a look around and feel free to contact me for information not found on this sporadically updated web page.

Seeking two motivated PhD/Masters students! - Do you want to develop smart planning algorithms for some of the largest autonomous vehicles in Australia? Here's your chance to do that and get a doctorate along the way! - Position details.


Research Interests

My research topic is on optimal search for a target (victim, intruder etc) moving in indoor environments, which in essence boils down to finding discrete sequences of rooms/regions etc in the search area for a searcher(/searching robot) to visit that optimises the objective of maximising the probability of detection. To this end, I've been extending an existing NP-complete search problem formulation in Operations Research literature called the Optimal Searcher Path problem (OSP), in order to apply it to indoor settings which impose additional searcher movement constraints.

I've been using branch and bound to generate the paths, with one of the contributions being a bounding method that generates tighter bounds than the existing techniques (therefore speeding up the solution process) without introducing significant complexity. Naturally epsilon-optimal solutions can also be used to further trade off between search plan quality and computation time.

Ongoing work involves extending the problem to multiple searchers (getting optimal solutions for small problems and using heuristics in cases where the time window is large). A slight twist is that the the search team can involve searchers (which are capable of rescuing the victim) and scouts (which can only help to find the victim and let the searchers know where they are). Since the agents should appropriately react to exploit any newly uncovered information, fully optimising the team's actions actually requires a different solution approach.

My research interests include:

Upcoming Presentations

Recent Publications

Doctoral Thesis

[Full list of publications]

Seminars Given (partial list)


Videos, pictures, media, and news

Interesting videos, pictures or material for projects that I've been involved / am interested in will be posted.


Academic History

Awards and Scholarships


Personal Pictures and Videos

Recent pictures and material - any relation to work therein is purely coincidental.

 


Department Address:   

ARC Centre of Excellence for Autonomous Systems
Faculty of Engineering,
Level 6, Building 2, City Campus,
University of Technology, Sydney
PO Box 123, Broadway NSW 2007

  • E-mail: hlau<at>eng.uts.edu.au
  • Telephone: +61 2 9514 2963
  • Fax: +61 2 9514 2655

  • Search this website

    [CAS | Robotics Research Group at UTS | UTS]


    Haye Lau - last updated 26/06/08