41 typedef std::pair<std::shared_ptr<Curve1d>, std::shared_ptr<Curve1d>>
43 typedef std::pair<Trajectory1dPair, double>
PairCost;
46 const std::array<double, 3>& init_s,
const std::array<double, 3>& init_d,
47 const double init_relative_time,
48 const std::shared_ptr<CollisionChecker>& ptr_collision_checker,
52 const std::vector<common::PathPoint>& discretized_ref_points);
55 void GenerateTrajectory1dPairs(
const std::array<double, 3>& init_s,
56 const std::array<double, 3>& init_d);
58 double init_relative_time_;
60 std::shared_ptr<CollisionChecker> ptr_collision_checker_;
65 :
public std::binary_function<const Trajectory1dPair&,
66 const Trajectory1dPair&, bool> {
69 auto lon_left = left.first;
70 auto lon_right = right.first;
71 auto s_dot_left = lon_left->Evaluate(1, FLAGS_trajectory_time_length);
72 auto s_dot_right = lon_right->Evaluate(1, FLAGS_trajectory_time_length);
73 if (s_dot_left < s_dot_right) {
80 std::priority_queue<Trajectory1dPair, std::vector<Trajectory1dPair>,
82 trajectory_pair_pqueue_;
BackupTrajectoryGenerator(const std::array< double, 3 > &init_s, const std::array< double, 3 > &init_d, const double init_relative_time, const std::shared_ptr< CollisionChecker > &ptr_collision_checker, const Trajectory1dGenerator *trajectory1d_generator)
PlanningContext is the runtime context in planning. It is persistent across multiple frames...
Definition: atomic_hash_map.h:25
Definition: discretized_trajectory.h:32
Planning module main class. It processes GPS and IMU as input, to generate planning info...
std::pair< std::shared_ptr< Curve1d >, std::shared_ptr< Curve1d > > Trajectory1dPair
Definition: backup_trajectory_generator.h:42
Definition: backup_trajectory_generator.h:39
DiscretizedTrajectory GenerateTrajectory(const std::vector< common::PathPoint > &discretized_ref_points)
Definition: trajectory1d_generator.h:39
std::pair< Trajectory1dPair, double > PairCost
Definition: backup_trajectory_generator.h:43