Result on searching the C-space polytope and separating planes.
#include <drake/geometry/optimization/cspace_free_polytope.h>
Public Member Functions | |
| SearchResult ()=default | |
| ~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. | |
| const std::unordered_map< int, symbolic::Polynomial > & | b () const |
| Each plane index is mapped to a polynomial,. | |
| int | num_iter () const |
| The number of iterations taken to search for the result. | |
Implements CopyConstructible, CopyAssignable, MoveConstructible, MoveAssignable | |
| SearchResult (const SearchResult &)=default | |
| SearchResult & | operator= (const SearchResult &)=default |
| SearchResult (SearchResult &&)=default | |
| SearchResult & | operator= (SearchResult &&)=default |
Friends | |
| class | CspaceFreePolytope |
|
default |
|
default |
|
default |
| ~SearchResult | ( | ) |
|
nodiscard |
Each plane index is mapped to a vector of polynomials.
|
nodiscard |
Each plane index is mapped to a polynomial,.
|
nodiscard |
|
nodiscard |
|
nodiscard |
|
nodiscard |
The number of iterations taken to search for the result.
|
default |
|
default |
|
friend |