discretized_trajectory.h

浏览该文件的文档.

/******************************************************************************
 * Copyright 2017 The Apollo Authors. All Rights Reserved.
 *
 * 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.
 *****************************************************************************/
 
#pragma once
 
#include <vector>
 
#include "modules/common_msgs/planning_msgs/planning.pb.h"
 
#include "cyber/common/log.h"
#include "modules/common/math/vec2d.h"
 
namespace apollo {
namespace planning {
 
class DiscretizedTrajectory : public std::vector<common::TrajectoryPoint> {
 public:
  DiscretizedTrajectory() = default;
 
  explicit DiscretizedTrajectory(const ADCTrajectory& trajectory);
 
  explicit DiscretizedTrajectory(
      const std::vector<common::TrajectoryPoint>& trajectory_points);
 
  void SetTrajectoryPoints(
      const std::vector<common::TrajectoryPoint>& trajectory_points);
 
  virtual ~DiscretizedTrajectory() = default;
 
  virtual common::TrajectoryPoint StartPoint() const;
 
  virtual double GetTemporalLength() const;
 
  virtual double GetSpatialLength() const;
 
  virtual common::TrajectoryPoint Evaluate(const double relative_time) const;
 
  virtual size_t QueryLowerBoundPoint(const double relative_time,
                                      const double epsilon = 1.0e-5) const;
 
  virtual size_t QueryNearestPoint(const common::math::Vec2d& position) const;
 
  size_t QueryNearestPointWithBuffer(const common::math::Vec2d& position,
                                     const double buffer) const;
 
  virtual void AppendTrajectoryPoint(
      const common::TrajectoryPoint& trajectory_point);
 
  void PrependTrajectoryPoints(
      const std::vector<common::TrajectoryPoint>& trajectory_points) {
    if (!empty() && trajectory_points.size() > 1) {
      ACHECK(trajectory_points.back().relative_time() <
             front().relative_time());
    }
    insert(begin(), trajectory_points.begin(), trajectory_points.end());
  }
 
  const common::TrajectoryPoint& TrajectoryPointAt(const size_t index) const;
 
  size_t NumOfPoints() const;
 
  virtual void Clear();
  bool IsReversed() const { return is_reversed_; }
  void SetIsReversed(const bool flag) { is_reversed_ = flag; }
 
 private:
  bool is_reversed_ = false;
};
 
inline size_t DiscretizedTrajectory::NumOfPoints() const { return size(); }
 
inline void DiscretizedTrajectory::Clear() { clear(); }
 
}  // namespace planning
}  // namespace apollo