{"repository":{"description":"navfn provides a fast interpolated navigation function that can be used to create plans for a mobile base. The planner assumes a circular robot and operates on a costmap to find a minimum cost plan from a start point to an end point in a grid. The navigation function is computed with Dijkstra's algorithm, but support for an A* heuristic may also be added in the near future. navfn also provides a ROS wrapper for the navfn planner that adheres to the nav_core::BaseGlobalPlanner interface specified in","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":68,"owner":"tue-robotics-lab","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-08-13T13:29:48-07:00","pushed_at":"2013-08-27T11:46:26-07:00","master_branch":"master","organization":"tue-robotics-lab"},"actor_attributes":{"type":"User","name":"Loy","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/tue-robotics-lab/tue_astar_planner_old/compare/ac1f7575de...f6a14ffa18"}