navfn_planner.hpp

// Copyright (c) 2018 Intel Corporation
// Copyright (c) 2018 Simbe Robotics
// Copyright (c) 2019 Samsung Research America
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
 
#ifndef NAV2_NAVFN_PLANNER__NAVFN_PLANNER_HPP_
#define NAV2_NAVFN_PLANNER__NAVFN_PLANNER_HPP_
 
#include <chrono>
#include <string>
#include <memory>
#include <vector>
 
#include "geometry_msgs/msg/point.hpp"
#include "geometry_msgs/msg/pose_stamped.hpp"
#include "nav2_core/global_planner.hpp"
#include "nav2_core/planner_exceptions.hpp"
#include "nav_msgs/msg/path.hpp"
#include "nav2_navfn_planner/navfn.hpp"
#include "nav2_navfn_planner/parameter_handler.hpp"
#include "nav2_util/robot_utils.hpp"
#include "nav2_ros_common/lifecycle_node.hpp"
#include "nav2_costmap_2d/costmap_2d_ros.hpp"
#include "nav2_util/geometry_utils.hpp"
#include "nav2_ros_common/tf2_factories.hpp"
 
namespace nav2_navfn_planner
{
 
class NavfnPlanner : public nav2_core::GlobalPlanner
{
public:
  NavfnPlanner();
 
  ~NavfnPlanner();
 
  void configure(
    const nav2::LifecycleNode::WeakPtr & parent,
    std::string name, nav2::TransformBuffer::SharedPtr tf,
    std::shared_ptr<nav2_costmap_2d::Costmap2DROS> costmap_ros) override;
 
  void cleanup() override;
 
  void activate() override;
 
  void deactivate() override;
 
 
  nav_msgs::msg::Path createPlan(
    const geometry_msgs::msg::PoseStamped & start,
    const geometry_msgs::msg::PoseStamped & goal,
    const std::vector<geometry_msgs::msg::PoseStamped> & viapoints,
    std::function<bool()> cancel_checker) override;
 
protected:
  bool makePlan(
    const geometry_msgs::msg::Pose & start,
    const geometry_msgs::msg::Pose & goal, double tolerance,
    std::function<bool()> cancel_checker,
    nav_msgs::msg::Path & plan);
 
  bool computePotential(const geometry_msgs::msg::Point & world_point);
 
  bool getPlanFromPotential(
    const geometry_msgs::msg::Pose & goal,
    nav_msgs::msg::Path & plan);
 
  void smoothApproachToGoal(
    const geometry_msgs::msg::Pose & goal,
    nav_msgs::msg::Path & plan);
 
  double getPointPotential(const geometry_msgs::msg::Point & world_point);
 
  // Check for a valid potential value at a given point in the world
  // - must call computePotential first
  // - currently unused
  // bool validPointPotential(const geometry_msgs::msg::Point & world_point);
  // bool validPointPotential(const geometry_msgs::msg::Point & world_point, double tolerance);
 
  inline double squared_distance(
    const geometry_msgs::msg::Pose & p1,
    const geometry_msgs::msg::Pose & p2)
  {
    double dx = p1.position.x - p2.position.x;
    double dy = p1.position.y - p2.position.y;
    return dx * dx + dy * dy;
  }
 
  bool worldToMap(double wx, double wy, unsigned int & mx, unsigned int & my);
 
  void mapToWorld(double mx, double my, double & wx, double & wy);
 
  void clearRobotCell(unsigned int mx, unsigned int my);
 
  bool isPlannerOutOfDate();
 
  // Planner based on ROS1 NavFn algorithm
  std::unique_ptr<NavFn> planner_;
 
  // TF buffer
  nav2::TransformBuffer::SharedPtr tf_;
 
  // Clock
  rclcpp::Clock::SharedPtr clock_;
 
  // Logger
  rclcpp::Logger logger_{rclcpp::get_logger("NavfnPlanner")};
 
  // Global Costmap
  nav2_costmap_2d::Costmap2D * costmap_;
 
  // The global frame of the costmap
  std::string global_frame_, name_;
 
  // parent node weak ptr
  nav2::LifecycleNode::WeakPtr node_;
 
  Parameters * params_;
  std::unique_ptr<nav2_navfn_planner::ParameterHandler> param_handler_;
};
 
}  // namespace nav2_navfn_planner
 
#endif  // NAV2_NAVFN_PLANNER__NAVFN_PLANNER_HPP_