Result on searching the C-space polytope and separating planes.
#include <drake/geometry/optimization/cspace_free_polytope.h>
Public Member Functions | |
SearchResult () | |
const Eigen::MatrixXd & | C () const |
const Eigen::VectorXd & | d () const |
const HPolyhedron & | certified_polytope () const |
const std::unordered_map< int, Vector3< symbolic::Polynomial > > & | a () const |
Each plane index is mapped to a vector of polynomials. More... | |
const std::unordered_map< int, symbolic::Polynomial > & | b () const |
Each plane index is mapped to a polynomial,. More... | |
int | num_iter () const |
The number of iterations taken to search for the result. More... | |
Friends | |
class | CspaceFreePolytope |
SearchResult | ( | ) |
const std::unordered_map<int, Vector3<symbolic::Polynomial> >& a | ( | ) | const |
Each plane index is mapped to a vector of polynomials.
const std::unordered_map<int, symbolic::Polynomial>& b | ( | ) | const |
Each plane index is mapped to a polynomial,.
const Eigen::MatrixXd& C | ( | ) | const |
const HPolyhedron& certified_polytope | ( | ) | const |
const Eigen::VectorXd& d | ( | ) | const |
int num_iter | ( | ) | const |
The number of iterations taken to search for the result.
|
friend |