Robot Path Planning

Results of ACD

This projects aims to generate proper path for autonomatic driving. Since path can not be simplified as skelton in this program, we need to do 2D approximately convex decomposition (ACD). After applying ACD, we use Self-organizing Map (SOM) alogrithm to generate path for Multiple Travelling salesman (MTSP) problem. The source code is published at

Zexin Li
Zexin Li
Ph.D. Student of ECE

I am a Ph.D. student at the University of California, Riverside (UCR). I am fortunate to be advised by Dr. Cong Liu and working with Dr. Yinglun Zhu. I received a bachelor’s degree from the Southern University of Science and Technology (SUSTech) under the advice of Dr. Yuqun Zhang in July 2020. My research interests include but are not limited to the interdisciplinary fields of real-time embedded systems and on-device machine learning. I am actively looking for cooperation in the following topics - (1) deploying machine learning models on real-time embedded devices, (2) system-application co-optimization of machine learning systems, and (3) improving performance robustness in machine learning systems. Feel free to contact me if we share common research interests.