selfdriving
ProgressCallbackData.h
Go to the documentation of this file.
1 /* -------------------------------------------------------------------------
2  * SelfDriving C++ library based on PTGs and mrpt-nav
3  * Copyright (C) 2019-2022 Jose Luis Blanco, University of Almeria
4  * See LICENSE for license information.
5  * ------------------------------------------------------------------------- */
6 
7 #pragma once
8 
11 #include <mpp/data/PlannerInput.h>
12 #include <mpp/data/basic_types.h>
13 
14 #include <limits>
15 #include <vector>
16 
17 namespace mpp
18 {
20 {
21  ProgressCallbackData() = default;
22  ~ProgressCallbackData() = default;
23 
24  cost_t bestCostFromStart = std::numeric_limits<cost_t>::max();
25  cost_t bestCostToGoal = std::numeric_limits<cost_t>::max();
27  std::optional<TNodeID> bestFinalNode;
28  const MotionPrimitivesTreeSE2* tree = nullptr;
29  const PlannerInput* originalPlanInput = nullptr;
30  const std::vector<CostEvaluator::Ptr>* costEvaluators = nullptr;
31 };
32 
34  std::function<void(const ProgressCallbackData&)>;
35 
36 } // namespace mpp
double cost_t
Definition: basic_types.h:25
Definition: bestTrajectory.h:15
const std::vector< CostEvaluator::Ptr > * costEvaluators
Definition: ProgressCallbackData.h:30
Definition: PlannerInput.h:18
MotionPrimitivesTreeSE2::edge_sequence_t bestPath
Definition: ProgressCallbackData.h:26
std::function< void(const ProgressCallbackData &)> planner_progress_callback_t
Definition: ProgressCallbackData.h:34
std::optional< TNodeID > bestFinalNode
Definition: ProgressCallbackData.h:27
std::list< edge_t * > edge_sequence_t
Definition: MotionPrimitivesTree.h:102
Definition: ProgressCallbackData.h:19
cost_t bestCostToGoal
Definition: ProgressCallbackData.h:25
const MotionPrimitivesTreeSE2 * tree
Definition: ProgressCallbackData.h:28
cost_t bestCostFromStart
Definition: ProgressCallbackData.h:24
const PlannerInput * originalPlanInput
Definition: ProgressCallbackData.h:29