A convex set that represents the intersection of multiple sets: S = X₁ ∩ X₂ ∩ ... ∩ Xₙ = {x | x ∈ X₁, x ∈ X₂, ..., x ∈ Xₙ}.
Special behavior for IsEmpty: The intersection of zero sets (i.e. when we have sets_.size() == 0) is always nonempty. This includes the zero-dimensional case, which we treat as being {0}, the unique zero-dimensional vector space.
|
| | Intersection () |
| | Constructs a default (zero-dimensional, nonempty) set.
|
| | Intersection (const ConvexSets &sets) |
| | Constructs the intersection from a vector of convex sets.
|
| | Intersection (const ConvexSet &setA, const ConvexSet &setB) |
| | Constructs the intersection from a pair of convex sets.
|
| | ~Intersection () final |
| int | num_elements () const |
| | The number of elements (or sets) used in the intersection.
|
| const ConvexSet & | element (int i) const |
| | Returns a reference to the ConvexSet defining the index element in the intersection.
|
| double | CalcVolume () const |
| bool | IsBounded (Parallelism parallelism=Parallelism::None()) const |
| | An Intersection is bounded if all its constituent sets are bounded.
|
| | Intersection (const Intersection &)=default |
| Intersection & | operator= (const Intersection &)=default |
| | Intersection (Intersection &&)=default |
| Intersection & | operator= (Intersection &&)=default |
| virtual | ~ConvexSet () |
| std::unique_ptr< ConvexSet > | Clone () const |
| | Creates a unique deep copy of this set.
|
| int | ambient_dimension () const |
| | Returns the dimension of the vector space in which the elements of this set are evaluated.
|
| bool | IntersectsWith (const ConvexSet &other) const |
| | Returns true iff the intersection between this and other is non-empty.
|
| bool | IsBounded (Parallelism parallelism=Parallelism::None()) const |
| | Returns true iff the set is bounded, e.g., there exists an element-wise finite lower and upper bound for the set.
|
| bool | IsEmpty () const |
| | Returns true iff the set is empty.
|
| std::optional< Eigen::VectorXd > | MaybeGetPoint () const |
| | If this set trivially contains exactly one point, returns the value of that point.
|
| std::optional< Eigen::VectorXd > | MaybeGetFeasiblePoint () const |
| | Returns a feasible point within this convex set if it is nonempty, and nullopt otherwise.
|
| bool | PointInSet (const Eigen::Ref< const Eigen::VectorXd > &x, double tol=0) const |
| | Returns true iff the point x is contained in the set.
|
| std::pair< VectorX< symbolic::Variable >, std::vector< solvers::Binding< solvers::Constraint > > > | AddPointInSetConstraints (solvers::MathematicalProgram *prog, const Eigen::Ref< const solvers::VectorXDecisionVariable > &vars) const |
| | Adds a constraint to an existing MathematicalProgram enforcing that the point defined by vars is inside the set.
|
| std::vector< solvers::Binding< solvers::Constraint > > | AddPointInNonnegativeScalingConstraints (solvers::MathematicalProgram *prog, const Eigen::Ref< const solvers::VectorXDecisionVariable > &x, const symbolic::Variable &t) const |
| | Let S be this convex set.
|
| std::vector< solvers::Binding< solvers::Constraint > > | AddPointInNonnegativeScalingConstraints (solvers::MathematicalProgram *prog, const Eigen::Ref< const Eigen::MatrixXd > &A, const Eigen::Ref< const Eigen::VectorXd > &b, const Eigen::Ref< const Eigen::VectorXd > &c, double d, const Eigen::Ref< const solvers::VectorXDecisionVariable > &x, const Eigen::Ref< const solvers::VectorXDecisionVariable > &t) const |
| | Let S be this convex set.
|
| std::pair< std::unique_ptr< Shape >, math::RigidTransformd > | ToShapeWithPose () const |
| | Constructs a Shape and a pose of the set in the world frame for use in the SceneGraph geometry ecosystem.
|
| double | CalcVolume () const |
| | Computes the exact volume for the convex set.
|
| SampledVolume | CalcVolumeViaSampling (RandomGenerator *generator, const double desired_rel_accuracy=1e-2, const int max_num_samples=1e4) const |
| | Calculates an estimate of the volume of the convex set using sampling and performing Monte Carlo integration.
|
| std::optional< std::pair< std::vector< double >, Eigen::MatrixXd > > | Projection (const Eigen::Ref< const Eigen::MatrixXd > &points) const |
| | Computes in the L₂ norm the distance and the nearest point in this convex set to every column of points.
|
| bool | has_exact_volume () const |
| | Returns true if the exact volume can be computed for this convex set instance.
|
