17#ifndef __ARBITRATOR_INCLUDE_BEAM_SEARCH_STRATEGY_HPP__
18#define __ARBITRATOR_INCLUDE_BEAM_SEARCH_STRATEGY_HPP__
54 std::vector<std::pair<carma_planning_msgs::msg::ManeuverPlan, double>>
prioritize_plans(std::vector<std::pair<carma_planning_msgs::msg::ManeuverPlan, double>> plans)
const;
Implementation of SearchStrategy by usage of Beam Search.
BeamSearchStrategy(int beam_width)
Constructor for BeamSearchStrategy.
std::vector< std::pair< carma_planning_msgs::msg::ManeuverPlan, double > > prioritize_plans(std::vector< std::pair< carma_planning_msgs::msg::ManeuverPlan, double > > plans) const
Prioritize the plans and eliminate those outside the beam width.
Generic interface representing a computation to prioritize nodes for expansion in a search graph.