Apollo  6.0
Open source self driving car software
multi_hm_bipartite_graph_matcher.h
Go to the documentation of this file.
1 /******************************************************************************
2  * Copyright 2018 The Apollo Authors. All Rights Reserved.
3  *
4  * Licensed under the Apache License, Version 2.0 (the "License");
5  * you may not use this file except in compliance with the License.
6  * You may obtain a copy of the License at
7  *
8  * http://www.apache.org/licenses/LICENSE-2.0
9  *
10  * Unless required by applicable law or agreed to in writing, software
11  * distributed under the License is distributed on an "AS IS" BASIS,
12  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13  * See the License for the specific language governing permissions and
14  * limitations under the License.
15  *****************************************************************************/
16 #pragma once
17 
18 #include <string>
19 #include <vector>
20 
24 
25 namespace apollo {
26 namespace perception {
27 namespace lidar {
28 
30  public:
33 
34  // @brief: match interface
35  // @params [in]: match params
36  // @params [out]: matched pair of objects & tracks
37  // @params [out]: unmatched rows
38  // @params [out]: unmatched cols
39  void Match(const BipartiteGraphMatcherOptions &options,
40  std::vector<NodeNodePair> *assignments,
41  std::vector<size_t> *unassigned_rows,
42  std::vector<size_t> *unassigned_cols);
43  std::string Name() const { return "MultiHmBipartiteGraphMatcher"; }
44 
45  protected:
47 }; // class MultiHmObjectMatcher
48 
49 } // namespace lidar
50 } // namespace perception
51 } // namespace apollo
std::string Name() const
Definition: multi_hm_bipartite_graph_matcher.h:43
PlanningContext is the runtime context in planning. It is persistent across multiple frames...
Definition: atomic_hash_map.h:25
Definition: base_bipartite_graph_matcher.h:34
Definition: multi_hm_bipartite_graph_matcher.h:29
void Match(const BipartiteGraphMatcherOptions &options, std::vector< NodeNodePair > *assignments, std::vector< size_t > *unassigned_rows, std::vector< size_t > *unassigned_cols)
Definition: base_bipartite_graph_matcher.h:39
common::GatedHungarianMatcher< float > optimizer_
Definition: multi_hm_bipartite_graph_matcher.h:46