|
Drake
|
|
Drake
|
#include <drake/planning/iris/iris_from_clique_cover.h>
Public Attributes | |
| std::variant< geometry::optimization::IrisOptions, IrisNp2Options, IrisZoOptions > | iris_options {geometry::optimization::IrisOptions{.iteration_limit = 1}} |
| The options used on internal calls to Iris. More... | |
| double | coverage_termination_threshold {0.7} |
| The fraction of the domain that must be covered before we terminate the algorithm. More... | |
| int | iteration_limit {100} |
| The maximum number of iterations of the algorithm. More... | |
| int | num_points_per_coverage_check {static_cast<int>(1e3)} |
| The number of points to sample when testing coverage. More... | |
| Parallelism | parallelism {Parallelism::Max()} |
| The amount of parallelism to use. More... | |
| int | minimum_clique_size {3} |
| The minimum size of the cliques used to construct a region. More... | |
| int | num_points_per_visibility_round {200} |
| Number of points to sample when building visibilty cliques. More... | |
| double | rank_tol_for_minimum_volume_circumscribed_ellipsoid {1e-6} |
| The rank tolerance used for computing the MinimumVolumeCircumscribedEllipsoid of a clique. More... | |
| double | point_in_set_tol {1e-6} |
| The tolerance used for checking whether a point is contained inside an HPolyhedron. More... | |
| double coverage_termination_threshold {0.7} |
The fraction of the domain that must be covered before we terminate the algorithm.
| int iteration_limit {100} |
The maximum number of iterations of the algorithm.
| int minimum_clique_size {3} |
The minimum size of the cliques used to construct a region.
If this is set lower than the ambient dimension of the space we are trying to cover, then this option will be overridden to be at least 1 + the ambient dimension.
The number of points to sample when testing coverage.
| int num_points_per_visibility_round {200} |
Number of points to sample when building visibilty cliques.
If this option is less than twice the minimum clique size, it will be overridden to be at least twice the minimum clique size. If the algorithm ever fails to find a single clique in a visibility round, then the number of points in a visibility round will be doubled.
| Parallelism parallelism {Parallelism::Max()} |
The amount of parallelism to use.
This algorithm makes heavy use of parallelism at many points and thus it is highly recommended to set this to the maximum tolerable parallelism.
| double point_in_set_tol {1e-6} |
The tolerance used for checking whether a point is contained inside an HPolyhedron.
See @ConvexSet::PointInSet.
| double rank_tol_for_minimum_volume_circumscribed_ellipsoid {1e-6} |
The rank tolerance used for computing the MinimumVolumeCircumscribedEllipsoid of a clique.
See @MinimumVolumeCircumscribedEllipsoid.