{"push_id":901083283,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b72e02084c26a00cdff22e9a5919043455115d9e","before":"5cec98a2685a342d5506b2d8468b13b0f6721897","commits":[{"sha":"b72e02084c26a00cdff22e9a5919043455115d9e","author":{"email":"1e513c7e86eb6e78a2d71ce27451b4111cfe2a29@ntu.edu.tw","name":"Yu-Cheng Lin"},"message":"Astar without obstacles\n\n1. Built the basic structure of A star without obsticles.\n2. Built the following function\na. self designed xypoint class\nb. self designed node class (with a lot of information)\nc. buildMap: build the map full of node class\nd. pop: define the basic list operation\ne. PathCostEstimation: the distance between current node and target node\nf. TraverseCost: same as PathCostEstimation\ng. lowestTotalCost: find the lowest cost from the node list\nh. successorNodes: find the surrounding nodes based on current node\ng. AstarSearch: the algorithm\n\n!! important !! this version does not contain obsticles.","distinct":true,"url":"https://api.github.com/repos/owen31302/Astar-in-path-planning/commits/b72e02084c26a00cdff22e9a5919043455115d9e"}]}