Skip to content

Commit b26673b

Browse files
committed
defining environment
1 parent 679172f commit b26673b

File tree

2 files changed

+2
-4
lines changed

2 files changed

+2
-4
lines changed

docs/src/define_environment.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -216,7 +216,7 @@ function is_done(env::Environment{Ant}, x)
216216
end
217217
```
218218

219-
# Random controls
219+
### Random controls
220220

221221
We apply random controls to the robot via the environment interface:
222222
```julia

docs/src/gradients.md

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,6 @@ In case ``(\partial r / \partial w)^{-1}`` is not well defined, (e.g., not full
2222

2323
Often, Newton's method is employed to find solutions to the implicit equation and custom linear-system solvers can efficiently compute search directions for this purpose. Importantly, the factorization of ``\partial r / \partial w`` used to find a solution can be reused to compute (1) at very low computational cost using only back-substitution. Additionally, each element of the problem-data sensitivity can be computed in parallel.
2424

25-
2625
## Dojo's Gradient
2726
At a solution point, ``w^*(\theta, \kappa)``, the sensitivity of the solution with respect to the problem data, i.e., ``\partial w^* / \partial \theta``, is efficiently computed using the implicit-function theorem (1) to differentiate through the solver's residual.
2827

@@ -32,11 +31,10 @@ The problem data for each simulation step include: the previous and current conf
3231

3332
In many robotics scenarios, we are interested in gradient information through contact events. Instead of computing gradients for hard contact with zero or very small central-path parameters, we use a relaxed value from intermediate solutions ``w^*(\theta, \kappa > 0)`` corresponding to a soft contact model. In practice, we find that these smooth gradients greatly improve the performance of gradient-based optimization methods.
3433

35-
3634
## Gradient Comparison
3735

3836
```@raw html
39-
<img src="./assets/gradient_comparison.png" width="600"/>
37+
<img src="./assets/gradient_comparison.png" width="500"/>
4038
```
4139

4240
Gradient comparison between randomized smoothing and Dojo's smooth gradients. The dynamics for a box in the ``XY`` plane that is resting on a flat surface and displaced an amount ``\Delta`` by an input ``F`` (top left). Its corresponding exact gradients are shown in black. Gradient bundles (right column) are computed using sampling schemes with varying covariances ``\Sigma`` and ``500`` samples. Dojo's gradients (middle column) are computed for different values of ``\kappa``, corresponding to the smoothness of the contact model. Compared to the 500-sample gradient bundle, Dojo's gradients are not noisy and are a 100 times faster to compute with a single worker.

0 commit comments

Comments
 (0)