findPath(const std::vector< VecWithCost > &ss, const Vec &e, std::list< Vec > &path) const | planner_cspace::GridAstar< DIM, NONCYCLIC > | inlineprotected |
g_ | planner_cspace::GridAstar< DIM, NONCYCLIC > | protected |
getDim() const | planner_cspace::GridAstar< DIM, NONCYCLIC > | inline |
getNoncyclic() const | planner_cspace::GridAstar< DIM, NONCYCLIC > | inline |
GridAstar() | planner_cspace::GridAstar< DIM, NONCYCLIC > | inline |
GridAstar(const Vec size) | planner_cspace::GridAstar< DIM, NONCYCLIC > | inlineexplicit |
open_ | planner_cspace::GridAstar< DIM, NONCYCLIC > | protected |
parents_ | planner_cspace::GridAstar< DIM, NONCYCLIC > | protected |
ProgressCallback typedef | planner_cspace::GridAstar< DIM, NONCYCLIC > | |
queue_size_limit_ | planner_cspace::GridAstar< DIM, NONCYCLIC > | protected |
reset(const Vec size) | planner_cspace::GridAstar< DIM, NONCYCLIC > | inline |
search(const std::vector< VecWithCost > &ss, const Vec &e, std::list< Vec > &path, const typename GridAstarModelBase< DIM, NONCYCLIC >::Ptr &model, ProgressCallback cb_progress, const float cost_leave, const float progress_interval, const bool return_best=false) | planner_cspace::GridAstar< DIM, NONCYCLIC > | inline |
search_task_num_ | planner_cspace::GridAstar< DIM, NONCYCLIC > | protected |
searchImpl(Gridmap< float > &g, const std::vector< VecWithCost > &sts, const Vec &en, std::list< Vec > &path, const typename GridAstarModelBase< DIM, NONCYCLIC >::Ptr &model, ProgressCallback cb_progress, const float cost_leave, const float progress_interval, const bool return_best=false) | planner_cspace::GridAstar< DIM, NONCYCLIC > | inlineprotected |
setQueueSizeLimit(const size_t size) | planner_cspace::GridAstar< DIM, NONCYCLIC > | inline |
setSearchTaskNum(const size_t &search_task_num) | planner_cspace::GridAstar< DIM, NONCYCLIC > | inline |
Vec typedef | planner_cspace::GridAstar< DIM, NONCYCLIC > | |
Vecf typedef | planner_cspace::GridAstar< DIM, NONCYCLIC > | |
VecWithCost typedef | planner_cspace::GridAstar< DIM, NONCYCLIC > | |