include
jsk_footstep_planner
astar_solver.h
Go to the documentation of this file.
1
// -*- mode: c++ -*-
2
/*********************************************************************
3
* Software License Agreement (BSD License)
4
*
5
* Copyright (c) 2015, JSK Lab
6
* All rights reserved.
7
*
8
* Redistribution and use in source and binary forms, with or without
9
* modification, are permitted provided that the following conditions
10
* are met:
11
*
12
* * Redistributions of source code must retain the above copyright
13
* notice, this list of conditions and the following disclaimer.
14
* * Redistributions in binary form must reproduce the above
15
* copyright notice, this list of conditions and the following
16
* disclaimer in the documentation and/o2r other materials provided
17
* with the distribution.
18
* * Neither the name of the JSK Lab nor the names of its
19
* contributors may be used to endorse or promote products derived
20
* from this software without specific prior written permission.
21
*
22
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
25
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
26
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
27
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
28
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
29
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
30
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
32
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
33
* POSSIBILITY OF SUCH DAMAGE.
34
*********************************************************************/
35
36
37
#ifndef JSK_FOOTSTEP_PLANNER_ASTAR_SOLVER_H_
38
#define JSK_FOOTSTEP_PLANNER_ASTAR_SOLVER_H_
39
40
#include "
jsk_footstep_planner/best_first_search_solver.h
"
41
#include <boost/function.hpp>
42
namespace
jsk_footstep_planner
43
{
44
template
<
class
GraphT>
45
class
AStarSolver:
public
BestFirstSearchSolver<GraphT>
46
{
47
public
:
48
typedef
boost::shared_ptr<AStarSolver>
Ptr
;
49
typedef
typename
GraphT::StateT::Ptr
StatePtr
;
50
typedef
typename
GraphT::StateT
State
;
51
typedef
typename
GraphT::Ptr
GraphPtr
;
52
typedef
typename
SolverNode<State, GraphT>::Ptr
SolverNodePtr
;
53
typedef
typename
boost::function<double(
SolverNodePtr
,
GraphPtr
)>
HeuristicFunction
;
54
55
AStarSolver
(
GraphPtr
graph
):
BestFirstSearchSolver
<GraphT>(
graph
) {}
56
virtual
double
fn
(
SolverNodePtr
n)
57
{
58
return
gn
(n) +
hn
(n);
59
}
60
61
virtual
double
gn
(
SolverNodePtr
n)
62
{
63
return
n
->getCost();
64
}
65
66
virtual
double
hn
(
SolverNodePtr
n)
67
{
68
return
heuristic_
(n,
graph_
);
69
}
70
71
virtual
void
setHeuristic
(
HeuristicFunction
h) {
heuristic_
= h; }
72
73
protected
:
74
using
Solver<GraphT>::graph_
;
75
HeuristicFunction
heuristic_
;
76
77
private
:
78
79
};
80
}
81
82
#endif
jsk_footstep_planner::AStarSolver::State
GraphT::StateT State
Definition:
astar_solver.h:114
boost::shared_ptr
jsk_footstep_planner::AStarSolver::GraphPtr
GraphT::Ptr GraphPtr
Definition:
astar_solver.h:115
jsk_footstep_planner::SolverNode::Ptr
boost::shared_ptr< SolverNode > Ptr
Definition:
solver_node.h:117
jsk_footstep_planner::AStarSolver::SolverNodePtr
SolverNode< State, GraphT >::Ptr SolverNodePtr
Definition:
astar_solver.h:116
jsk_footstep_planner::AStarSolver::AStarSolver
AStarSolver(GraphPtr graph)
Definition:
astar_solver.h:119
jsk_footstep_planner::AStarSolver::HeuristicFunction
boost::function< double(SolverNodePtr, GraphPtr)> HeuristicFunction
Definition:
astar_solver.h:117
jsk_footstep_planner::AStarSolver::Ptr
boost::shared_ptr< AStarSolver > Ptr
Definition:
astar_solver.h:112
jsk_footstep_planner
Definition:
ann_grid.h:50
jsk_footstep_planner::AStarSolver::setHeuristic
virtual void setHeuristic(HeuristicFunction h)
Definition:
astar_solver.h:135
best_first_search_solver.h
jsk_footstep_planner::AStarSolver::StatePtr
GraphT::StateT::Ptr StatePtr
Definition:
astar_solver.h:113
jsk_footstep_planner::BestFirstSearchSolver::BestFirstSearchSolver
BestFirstSearchSolver(GraphPtr graph)
Definition:
best_first_search_solver.h:122
jsk_footstep_planner::AStarSolver::hn
virtual double hn(SolverNodePtr n)
Definition:
astar_solver.h:130
graph
FootstepGraph::Ptr graph
Definition:
footstep_planning_2d_interactive_demo.cpp:51
Solver
jsk_footstep_planner::AStarSolver::heuristic_
HeuristicFunction heuristic_
Definition:
astar_solver.h:139
jsk_footstep_planner::AStarSolver::gn
virtual double gn(SolverNodePtr n)
Definition:
astar_solver.h:125
jsk_footstep_planner::Solver::graph_
GraphPtr graph_
Definition:
solver.h:201
n
GLfloat n[6][3]
jsk_footstep_planner::AStarSolver::fn
virtual double fn(SolverNodePtr n)
Definition:
astar_solver.h:120
jsk_footstep_planner
Author(s): Ryohei Ueda
autogenerated on Wed Jan 24 2024 04:05:29