n-Dimensional path planning using the Self-Organizing Maps

Summary

This project investigates an application of the Distance Transformation method to the n-dimensional path planning problem.

Supervisor(s)

Associate Professor Masahiro Takatsuka

Research Location

Computer Science

Program Type

N/A

Synopsis

The capability of the Self-Organizing Map (SOM) to create topology preserving mappings of high-dimensional data has been exploited for temporal sequence processing. The SOM combined with the U-Matrix allows state transitions to be visualized as trajectories on the mapping. These states often form a smooth manifold in the high-dimensional space such that the process of navigating these manifolds is equivalent to the occurrence of a state transition. Although SOMs are able to produce an approximate representation of such manifolds, this fact has not been exploited in temporal sequence processing applications to extrapolate from the representation the intermediate states that could have been reached during a state transition.

This project investigate an approach where the Geodesic Self-Organizing Map (SOM) is used to approximate the smooth manifolds and apply distance transformations to construct more detailed trajectories which would allow users to gain more insight into the state transitions.

Want to find out more?

Contact us to find out what’s involved in applying for a PhD. Domestic students and International students

Contact Research Expert to find out more about participating in this opportunity.

Browse for other opportunities within the Computer Science .

Keywords

pattern recognition, applications, Signal Processing

Opportunity ID

The opportunity ID for this research opportunity is: 387

Other opportunities with Associate Professor Masahiro Takatsuka