一、Search motion planning in discrete world A* given Map starting location goal location cost goal find minimum cost path dynamic programing given: map goal outputs best path from anywhere 二、Prediction model based data driven 模型方法获取每种可能动作的几率