Nav2 Navigation Stack - lyrical  lyrical
ROS 2 Navigation Stack
costmap_scorer.cpp
1 // Copyright (c) 2025 Open Navigation LLC
2 //
3 // Licensed under the Apache License, Version 2.0 (the "License");
4 // you may not use this file except in compliance with the License.
5 // You may obtain a copy of the License at
6 //
7 // http://www.apache.org/licenses/LICENSE-2.0
8 //
9 // Unless required by applicable law or agreed to in writing, software
10 // distributed under the License is distributed on an "AS IS" BASIS,
11 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 // See the License for the specific language governing permissions and
13 // limitations under the License.
14 
15 #include <memory>
16 #include <string>
17 
18 #include "nav2_route/plugins/edge_cost_functions/costmap_scorer.hpp"
19 #include "nav2_ros_common/tf2_factories.hpp"
20 
21 namespace nav2_route
22 {
23 
25  const nav2::LifecycleNode::SharedPtr node,
26  const nav2::TransformBuffer::SharedPtr/* tf_buffer */,
27  std::shared_ptr<nav2_costmap_2d::CostmapSubscriber> costmap_subscriber,
28  const std::string & name)
29 {
30  RCLCPP_INFO(node->get_logger(), "Configuring costmap scorer.");
31  name_ = name;
32  logger_ = node->get_logger();
33  clock_ = node->get_clock();
34 
35  // Find whether to use average or maximum cost values
36  use_max_ = node->declare_or_get_parameter(getName() + ".use_maximum", true);
37 
38  // Edge is invalid if its in collision
39  invalid_on_collision_ = node->declare_or_get_parameter(
40  getName() + ".invalid_on_collision", true);
41 
42  // Edge is invalid if edge is off the costmap
43  invalid_off_map_ = node->declare_or_get_parameter(
44  getName() + ".invalid_off_map", true);
45 
46  // Max cost to be considered valid
47  max_cost_ = static_cast<float>(
48  node->declare_or_get_parameter(getName() + ".max_cost", 253.0));
49 
50  // Resolution to check the costmap over (1=every cell, 2=every other cell, etc.)
51  check_resolution_ = static_cast<unsigned int>(
52  node->declare_or_get_parameter(getName() + ".check_resolution", 2));
53 
54  // Create costmap subscriber if not the same as the server costmap
55  std::string server_costmap_topic = node->get_parameter("costmap_topic").as_string();
56  std::string costmap_topic = node->declare_or_get_parameter(
57  getName() + ".costmap_topic", std::string("global_costmap/costmap_raw"));
58  if (costmap_topic != server_costmap_topic) {
59  costmap_subscriber_ = std::make_shared<nav2_costmap_2d::CostmapSubscriber>(
60  node, costmap_topic);
61  RCLCPP_INFO(
62  node->get_logger(),
63  "Using costmap topic: %s instead of server costmap topic: %s for CostmapScorer.",
64  costmap_topic.c_str(), server_costmap_topic.c_str());
65  } else {
66  costmap_subscriber_ = costmap_subscriber;
67  }
68 
69  // Find the proportional weight to apply, if multiple cost functions
70  weight_ = static_cast<float>(
71  node->declare_or_get_parameter(getName() + ".weight", 1.0));
72 }
73 
75 {
76  try {
77  costmap_ = costmap_subscriber_->getCostmap();
78  } catch (...) {
79  costmap_.reset();
80  }
81 }
82 
84  const EdgePtr edge,
85  const RouteRequest & /* route_request */,
86  const EdgeType & /* edge_type */, float & cost)
87 {
88  if (!costmap_) {
89  RCLCPP_WARN_THROTTLE(logger_, *clock_, 1000, "No costmap yet received!");
90  return false;
91  }
92 
93  float largest_cost = 0.0, running_cost = 0.0, point_cost = 0.0;
94  unsigned int x0, y0, x1, y1, idx = 0;
95  if (!costmap_->worldToMap(edge->start->coords.x, edge->start->coords.y, x0, y0) ||
96  !costmap_->worldToMap(edge->end->coords.x, edge->end->coords.y, x1, y1))
97  {
98  if (invalid_off_map_) {
99  // Edge is invalid if it is off the costmap
100  return false;
101  }
102  return true;
103  }
104 
105  for (nav2_util::LineIterator iter(x0, y0, x1, y1); iter.isValid(); ) {
106  point_cost = static_cast<float>(costmap_->getCost(iter.getX(), iter.getY()));
107  if (point_cost >= max_cost_ && max_cost_ != 255.0f /*Unknown*/ && invalid_on_collision_) {
108  // Edge is invalid if it is in collision or higher than max allowed cost
109  return false;
110  }
111 
112  idx++;
113  running_cost += point_cost;
114  if (largest_cost < point_cost && point_cost != 255.0) {
115  largest_cost = point_cost;
116  }
117 
118  // Advance the iterator by the check resolution on the edge, pruning to a coarse resolution
119  for (unsigned int i = 0; i < check_resolution_; i++) {
120  iter.advance();
121  }
122  }
123 
124  if (use_max_) {
125  cost = weight_ * largest_cost / max_cost_;
126  } else {
127  cost = weight_ * running_cost / (static_cast<float>(idx) * max_cost_);
128  }
129 
130  return true;
131 }
132 
134 {
135  return name_;
136 }
137 
138 } // namespace nav2_route
139 
140 #include "pluginlib/class_list_macros.hpp"
Scores edges by the average or maximum cost found while iterating over the edge's line segment in the...
std::string getName() override
Get name of the plugin for parameter scope mapping.
void prepare() override
Prepare for a new cycle, by resetting state, grabbing data to use for all immediate requests,...
void configure(const nav2::LifecycleNode::SharedPtr node, const nav2::TransformBuffer::SharedPtr tf_buffer, std::shared_ptr< nav2_costmap_2d::CostmapSubscriber > costmap_subscriber, const std::string &name) override
Configure.
bool score(const EdgePtr edge, const RouteRequest &route_request, const EdgeType &edge_type, float &cost) override
Main scoring plugin API.
A plugin interface to score edges during graph search to modify the lowest cost path (e....
An iterator implementing Bresenham Ray-Tracing.
bool isValid() const
If the iterator is valid.
An object representing edges between nodes.
Definition: types.hpp:134
An object to store salient features of the route request including its start and goal node ids,...
Definition: types.hpp:224