You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Which will benchmark a simple scenario of the Franka Emika Panda in a cage of spheres and visualize one of the results.
76
76
See the [README in the scripts directory](scripts/README.md) for more details.
77
77
78
+
#### Incremental Rebuilds
79
+
Rather than building the entire library from scratch each time, `nanobind` supports [incremental rebuilds](https://nanobind.readthedocs.io/en/latest/packaging.html#step-5-incremental-rebuilds):
If you wish to extend `vamp` via C++, please build directly with CMake, e.g.:
80
87
```
@@ -135,13 +142,17 @@ For the flying sphere in $\mathbb{R}^3$, additional operations are available to
135
142
-`vamp.sphere.set_lows()` and `vamp.sphere.set_highs()` to set bounding box of space
136
143
-`vamp.sphere.set_radius()` to set the sphere's radius
137
144
145
+
## Supported RNG
146
+
We ship implementations of the following pseudorandom number generators (PRNGs):
147
+
-`halton`: An implementation of a [multi-dimensional Halton sequence](https://en.wikipedia.org/wiki/Halton_sequence)[[12-13]](#12).
148
+
-`xorshift`: A SIMD-accelerated implementation of an [XOR shift](https://en.wikipedia.org/wiki/Xorshift) generator, only available on x86 machines. Uses the [`SIMDxorshift`](https://github.com/lemire/SIMDxorshift) library.
149
+
138
150
## Supported Planners
139
151
We currently ship two planners:
140
152
-`rrtc`, which is an implementation of a dynamic-domain [[6]](#6) balanced [[7]](#7) RRT-Connect [[1]](#1).
141
153
-`prm`, which is an implementation of basic PRM [[2]](#2) (i.e., PRM without the bounce heuristic, etc.).
142
154
143
155
Note that these planners support planning to a set of goals, not just a single goal.
144
-
Also, all planners use a multi-dimensional Halton sequence for deterministic planning [[12-13]](#12).
145
156
146
157
We also ship a number of heuristic simplification routines:
147
158
- randomized and deterministic shortcutting [[8, 9]](#8) (`REDUCE` and `SHORTCUT`)
Copy file name to clipboardExpand all lines: scripts/README.md
+2Lines changed: 2 additions & 0 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -39,6 +39,8 @@ These scripts support standard planner and simplifier configuration arguments (s
39
39
In addition, they both support the following arguments:
40
40
-`problem`: which takes in either a single problem name (e.g., `table_pick`) or a list (e.g., `table_pick,table_under_pick`) to evaluate against a specific set of problems.
41
41
-`dataset`: which describes the specific dataset of problems that should be loaded and inspected. See [Datasets](../resources/README.md#supported-planners) for more information.
42
+
-`sampler_name`: specify which PRNG sampler to use for generating random configurations (see [supported RNGs](../README.md#supported-rng)).
43
+
-`skip_rng_iterations`: skip _n_ PRNG iterations. Can be used to "seed" trials differently.
42
44
-`pointcloud`: construct a pointcloud approximation of the problem's scene geometry and plan against this representation using the CAPT datastructure.
43
45
-`samples_per_object`: number of samples per each object for pointcloud generation.
44
46
-`filter_radius`: pointcloud filtering radius. Will remove all redundant points that are within the specified radius.
0 commit comments