matCercola18 commited on
Commit
9cebc0d
·
verified ·
1 Parent(s): fd71acd

Backup of untracked models, results, data and logs (2026-10-26) (1/6)

Browse files
This view is limited to 50 files because it contains too many changes.   See raw diff
Files changed (50) hide show
  1. .gitattributes +12 -0
  2. data/armprov.npz +3 -0
  3. data/armprov_ds.pt +3 -0
  4. data/furuta_bank_f3.npz +3 -0
  5. data/furuta_bank_vref_c31.npz +3 -0
  6. data/furuta_bank_vref_c32.npz +3 -0
  7. data/furuta_bank_vref_c33.npz +3 -0
  8. data/furuta_bank_vref_c34.npz +3 -0
  9. data/furuta_bank_vref_c35.npz +3 -0
  10. data/furuta_bank_vref_coul.npz +3 -0
  11. data/furuta_nmpc_bank_v5merged.npz +3 -0
  12. data/furuta_traj_dataset_f2.pt +3 -0
  13. data/furuta_traj_dataset_f3.pt +3 -0
  14. data/furuta_traj_dataset_v5.pt +3 -0
  15. data/rig1.npz +3 -0
  16. data/rig1_ds.pt +3 -0
  17. data/rig1w.npz +3 -0
  18. data/rig1w_ds.pt +3 -0
  19. data/rig1w_gains.npz +3 -0
  20. data/rig1w_v2_ds.pt +3 -0
  21. figures/icml_r3/fig_x1_arms.png +3 -0
  22. figures/icml_r3/fig_x1f_arms.png +3 -0
  23. figures/icml_r3/fig_x3_seeds.png +3 -0
  24. figures/icml_r3/x10_baselines.png +3 -0
  25. figures/icml_r3/x10f_retrieval.png +0 -0
  26. figures/icml_r3/x18_ensemble.png +0 -0
  27. figures/icml_r3/x19_siso.png +3 -0
  28. figures/icml_r3/x20_unstable.png +3 -0
  29. figures/icml_r3/x2_arm.png +3 -0
  30. figures/icml_r3/x4_margin_by_source.png +3 -0
  31. figures/icml_r3/x7_cpu.png +3 -0
  32. figures/icml_r3/x7_wall.png +3 -0
  33. figures/icml_r3/x8_equal_repair.png +3 -0
  34. figures/icml_r3/x9_multimodality.png +3 -0
  35. hardware/qube/rebuild/logs/armprov.log +376 -0
  36. hardware/qube/rebuild/logs/rig1.log +396 -0
  37. hardware/qube/rebuild/logs/rig1w.log +476 -0
  38. hardware/qube/sysid/data2/fit/fit_decay1.log +47 -0
  39. hardware/qube/sysid/data2/fit/fit_decay2.log +46 -0
  40. models/armprov/armprov_s6000.pth +3 -0
  41. models/f3/f3_s0_s24000.pth +3 -0
  42. models/f3/f3_s1_s24000.pth +3 -0
  43. models/f3/f3_s2_s24000.pth +3 -0
  44. models/mhx/m2n8000_diff_s3.pth +3 -0
  45. models/mhx/m2n8000_diff_s4.pth +3 -0
  46. models/mhx/m2n8000_reg_s3.pth +3 -0
  47. models/mhx/m2n8000_reg_s4.pth +3 -0
  48. models/mhx/m3n8000_cvae_L2_b0.0001_s0.pth +3 -0
  49. models/mhx/m3n8000_cvae_L2_b0.0003_s0.pth +3 -0
  50. models/mhx/m3n8000_cvae_L2_b0.001_s0.pth +3 -0
.gitattributes CHANGED
@@ -36,3 +36,15 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
36
  results/icml_r2/B_resynth/main_main.jsonl filter=lfs diff=lfs merge=lfs -text
37
  results/icml_r2/B_resynth/main_R.jsonl filter=lfs diff=lfs merge=lfs -text
38
  results/icml_r2/B_resynth/v0_nobackup/main_main.jsonl filter=lfs diff=lfs merge=lfs -text
 
 
 
 
 
 
 
 
 
 
 
 
 
36
  results/icml_r2/B_resynth/main_main.jsonl filter=lfs diff=lfs merge=lfs -text
37
  results/icml_r2/B_resynth/main_R.jsonl filter=lfs diff=lfs merge=lfs -text
38
  results/icml_r2/B_resynth/v0_nobackup/main_main.jsonl filter=lfs diff=lfs merge=lfs -text
39
+ figures/icml_r3/fig_x1_arms.png filter=lfs diff=lfs merge=lfs -text
40
+ figures/icml_r3/fig_x1f_arms.png filter=lfs diff=lfs merge=lfs -text
41
+ figures/icml_r3/fig_x3_seeds.png filter=lfs diff=lfs merge=lfs -text
42
+ figures/icml_r3/x10_baselines.png filter=lfs diff=lfs merge=lfs -text
43
+ figures/icml_r3/x19_siso.png filter=lfs diff=lfs merge=lfs -text
44
+ figures/icml_r3/x20_unstable.png filter=lfs diff=lfs merge=lfs -text
45
+ figures/icml_r3/x2_arm.png filter=lfs diff=lfs merge=lfs -text
46
+ figures/icml_r3/x4_margin_by_source.png filter=lfs diff=lfs merge=lfs -text
47
+ figures/icml_r3/x7_cpu.png filter=lfs diff=lfs merge=lfs -text
48
+ figures/icml_r3/x7_wall.png filter=lfs diff=lfs merge=lfs -text
49
+ figures/icml_r3/x8_equal_repair.png filter=lfs diff=lfs merge=lfs -text
50
+ figures/icml_r3/x9_multimodality.png filter=lfs diff=lfs merge=lfs -text
data/armprov.npz ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:f6799df909f929d2ba1aae6cf8157cfb90ed87b8c12a08b3ff7a32bd74d43699
3
+ size 2725852
data/armprov_ds.pt ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:6e1d485029de7b8fc0c1ecda21de4b21bacaf3c269e2a176702ec24818239e79
3
+ size 4002811
data/furuta_bank_f3.npz ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:5a889a7134a12d1dd7db453ee37b75dcc6b95e0235136a1a72bb735c3987a184
3
+ size 14862448
data/furuta_bank_vref_c31.npz ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:3489670c3e26a8d2adfa722b12699eb0d910f88eba1f00f54199c2e90d48d89b
3
+ size 906920
data/furuta_bank_vref_c32.npz ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:d4f82633db8417f735b3a9fb85075c9db2a25469424e280c351b50da2c36cc36
3
+ size 916784
data/furuta_bank_vref_c33.npz ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:5183d30c6dd1a6dd150b7d88d686c03f0b0561fb572435fd8c6b0a651570a17d
3
+ size 897056
data/furuta_bank_vref_c34.npz ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:7beeaec3b1bc2334da215af15fc948018b6df024ccbf5aec502c78a1f8ba4697
3
+ size 913496
data/furuta_bank_vref_c35.npz ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:ccd685b1354c8797ec9fa8120c888ba76c111523bc4d5f4ec50113dd3ab2cba6
3
+ size 888288
data/furuta_bank_vref_coul.npz ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:d0664cb4ab6e9a7baf8bf90a0435edf26f94d4a7c146ef24743d04da4b9899c1
3
+ size 441640
data/furuta_nmpc_bank_v5merged.npz ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:ae7d7dc9624b254f5c1ec43371c526fc8d3366c0ea50de4ae5ad6cac74b2a2c1
3
+ size 5554272
data/furuta_traj_dataset_f2.pt ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:75d7404bf87e1eba9800bd50e789aececcaf4cac78a22d7895c29dc95ddba5cb
3
+ size 9319539
data/furuta_traj_dataset_f3.pt ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:760aa9492c9cbdc12e38d4b21d864151d9150e7d83286af3474d22ba80085fc9
3
+ size 13423155
data/furuta_traj_dataset_v5.pt ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:967d6a68a89420dc1eccf6626f57785146e3f8544a045456eb4d52e281cb8dd9
3
+ size 8689971
data/rig1.npz ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:46bedf31b97e7126a1e7295f5c6fc4ff05639040ac96b65e7682234711c5b929
3
+ size 2434132
data/rig1_ds.pt ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:e8f8dd6d26d0f34456fadb579de862727df1e8fc8b354a620b51260e9a0460c1
3
+ size 3559005
data/rig1w.npz ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:70097129602577aec95612b753a4428e4dc59907a22d8feac04c6e238bc5231d
3
+ size 4458652
data/rig1w_ds.pt ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:d49ac40316006d59f4285d08b40e4898092ccb72a2bc462abdc638ad8443a144
3
+ size 6492647
data/rig1w_gains.npz ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:356faa32aaf9a522c2769924a5f9fa0b2292787ba13c1307ffb816e7ffcee77e
3
+ size 10447931
data/rig1w_v2_ds.pt ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:1bee4655a33f17ff363ad6e2c6489707d5f514f59d1b2226d74a11b9797d6385
3
+ size 13634501
figures/icml_r3/fig_x1_arms.png ADDED

Git LFS Details

  • SHA256: 79c9f358b81654df49ede1d9b6a27c2390d6c98d61a0ba6fb17cbce70b7d9177
  • Pointer size: 131 Bytes
  • Size of remote file: 332 kB
figures/icml_r3/fig_x1f_arms.png ADDED

Git LFS Details

  • SHA256: 776ba1e1782faaa76fcdf0b3953f8edccdf234de94d1b078bbce36d0321fb5d0
  • Pointer size: 131 Bytes
  • Size of remote file: 154 kB
figures/icml_r3/fig_x3_seeds.png ADDED

Git LFS Details

  • SHA256: 8c14a41b3e6b4276d9e1fbdbece28cd970fbbb47d9e57dc3419fd928d5bfcd4e
  • Pointer size: 131 Bytes
  • Size of remote file: 125 kB
figures/icml_r3/x10_baselines.png ADDED

Git LFS Details

  • SHA256: 71c541f20d24e56654a99b1f47e7e7b8b9ec007bd26f7bcb5eb59b7fe24bc709
  • Pointer size: 131 Bytes
  • Size of remote file: 210 kB
figures/icml_r3/x10f_retrieval.png ADDED
figures/icml_r3/x18_ensemble.png ADDED
figures/icml_r3/x19_siso.png ADDED

Git LFS Details

  • SHA256: e7d6d06e9f9bf5f172da76d0655e1a61e115eefcfb9b4cf06ba0f86e71b31140
  • Pointer size: 131 Bytes
  • Size of remote file: 157 kB
figures/icml_r3/x20_unstable.png ADDED

Git LFS Details

  • SHA256: 10d01519acec6a1c0d44768121b4e199a5f23fb20f2dfb998b32724c226a219f
  • Pointer size: 131 Bytes
  • Size of remote file: 117 kB
figures/icml_r3/x2_arm.png ADDED

Git LFS Details

  • SHA256: 64250e6a25e895eb340ca76725fa6acf99fd844c8f070d778b77553ef4faa631
  • Pointer size: 131 Bytes
  • Size of remote file: 122 kB
figures/icml_r3/x4_margin_by_source.png ADDED

Git LFS Details

  • SHA256: 581033073fdc4bec9d1e65756b741822406e7f1528a9aa7158f4f0b95d7922f2
  • Pointer size: 131 Bytes
  • Size of remote file: 134 kB
figures/icml_r3/x7_cpu.png ADDED

Git LFS Details

  • SHA256: e9773378592cec1e4411ab60bc0184a08ac7e908e34e53f54028c241d2c07416
  • Pointer size: 131 Bytes
  • Size of remote file: 323 kB
figures/icml_r3/x7_wall.png ADDED

Git LFS Details

  • SHA256: ae5a4783692bf00f87a61a677511f54513b481dbdb7f40f0d144b0f2dffe0c2f
  • Pointer size: 131 Bytes
  • Size of remote file: 196 kB
figures/icml_r3/x8_equal_repair.png ADDED

Git LFS Details

  • SHA256: f5cd6227561ada213448a33bc30890235376e75ed5e19043cfbb60df007c0097
  • Pointer size: 131 Bytes
  • Size of remote file: 126 kB
figures/icml_r3/x9_multimodality.png ADDED

Git LFS Details

  • SHA256: 58d74230f4e9c22d8b5c95cd251ccad9fca2078312ff31f8d8a4544cfecccabf
  • Pointer size: 131 Bytes
  • Size of remote file: 100 kB
hardware/qube/rebuild/logs/armprov.log ADDED
@@ -0,0 +1,376 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ 2000 plants x vrefs [9.0, 10.0], 2000 to do, 30 workers, base hardware/qube/rebuild/provisional_params.json
2
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
3
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
4
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
5
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
6
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
7
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
8
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
9
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
10
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
11
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
12
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
13
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
14
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
15
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
16
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
17
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
18
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
19
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
20
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
21
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
22
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
23
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
24
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
25
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
26
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
27
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
28
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
29
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
30
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
31
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
32
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
33
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
34
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
35
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
36
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
37
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
38
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
39
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
40
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
41
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
42
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
43
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
44
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
45
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
46
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
47
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
48
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
49
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
50
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
51
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
52
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
53
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
54
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
55
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
56
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
57
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
58
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
59
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
60
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
61
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
62
+ 25/2000 plants, 50 entries kept, 18.9 s/plant CPU (2 vrefs), 0.88 s/plant wall, eta 29.0 min
63
+ 50/2000 plants, 100 entries kept, 18.8 s/plant CPU (2 vrefs), 0.78 s/plant wall, eta 25.2 min
64
+ 75/2000 plants, 150 entries kept, 18.7 s/plant CPU (2 vrefs), 0.74 s/plant wall, eta 23.7 min
65
+ 100/2000 plants, 200 entries kept, 18.5 s/plant CPU (2 vrefs), 0.71 s/plant wall, eta 22.6 min
66
+ 125/2000 plants, 250 entries kept, 18.2 s/plant CPU (2 vrefs), 0.69 s/plant wall, eta 21.6 min
67
+ 150/2000 plants, 300 entries kept, 18.1 s/plant CPU (2 vrefs), 0.66 s/plant wall, eta 20.2 min
68
+ 175/2000 plants, 349 entries kept, 17.8 s/plant CPU (2 vrefs), 0.63 s/plant wall, eta 19.1 min
69
+ 200/2000 plants, 399 entries kept, 17.6 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 18.7 min
70
+ 225/2000 plants, 449 entries kept, 17.5 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 18.4 min
71
+ 250/2000 plants, 499 entries kept, 17.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 18.2 min
72
+ 275/2000 plants, 548 entries kept, 17.6 s/plant CPU (2 vrefs), 0.61 s/plant wall, eta 17.7 min
73
+ 300/2000 plants, 598 entries kept, 17.6 s/plant CPU (2 vrefs), 0.61 s/plant wall, eta 17.4 min
74
+ 325/2000 plants, 648 entries kept, 17.5 s/plant CPU (2 vrefs), 0.61 s/plant wall, eta 17.0 min
75
+ 350/2000 plants, 698 entries kept, 17.5 s/plant CPU (2 vrefs), 0.61 s/plant wall, eta 16.7 min
76
+ 375/2000 plants, 747 entries kept, 17.6 s/plant CPU (2 vrefs), 0.61 s/plant wall, eta 16.6 min
77
+ 400/2000 plants, 796 entries kept, 17.7 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 16.5 min
78
+ 425/2000 plants, 846 entries kept, 17.9 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 16.3 min
79
+ 450/2000 plants, 896 entries kept, 17.9 s/plant CPU (2 vrefs), 0.61 s/plant wall, eta 15.9 min
80
+ 475/2000 plants, 946 entries kept, 17.9 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 15.7 min
81
+ 500/2000 plants, 996 entries kept, 17.9 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 15.5 min
82
+ 525/2000 plants, 1046 entries kept, 18.0 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 15.2 min
83
+ 550/2000 plants, 1096 entries kept, 18.0 s/plant CPU (2 vrefs), 0.61 s/plant wall, eta 14.8 min
84
+ 575/2000 plants, 1145 entries kept, 18.0 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 14.7 min
85
+ 600/2000 plants, 1195 entries kept, 18.1 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 14.5 min
86
+ 625/2000 plants, 1244 entries kept, 18.1 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 14.2 min
87
+ 650/2000 plants, 1294 entries kept, 18.1 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 13.9 min
88
+ 675/2000 plants, 1344 entries kept, 18.1 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 13.7 min
89
+ 700/2000 plants, 1394 entries kept, 18.1 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 13.4 min
90
+ 725/2000 plants, 1444 entries kept, 18.1 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 13.1 min
91
+ 750/2000 plants, 1494 entries kept, 18.1 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 12.8 min
92
+ 775/2000 plants, 1543 entries kept, 18.1 s/plant CPU (2 vrefs), 0.61 s/plant wall, eta 12.5 min
93
+ 800/2000 plants, 1592 entries kept, 18.1 s/plant CPU (2 vrefs), 0.61 s/plant wall, eta 12.3 min
94
+ 825/2000 plants, 1642 entries kept, 18.1 s/plant CPU (2 vrefs), 0.61 s/plant wall, eta 12.0 min
95
+ 850/2000 plants, 1692 entries kept, 18.1 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 11.8 min
96
+ 875/2000 plants, 1742 entries kept, 18.2 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 11.5 min
97
+ 900/2000 plants, 1792 entries kept, 18.2 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 11.3 min
98
+ 925/2000 plants, 1842 entries kept, 18.2 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 11.1 min
99
+ 950/2000 plants, 1891 entries kept, 18.3 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 10.8 min
100
+ 975/2000 plants, 1941 entries kept, 18.3 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 10.5 min
101
+ 1000/2000 plants, 1990 entries kept, 18.2 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 10.3 min
102
+ 1025/2000 plants, 2040 entries kept, 18.3 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 10.0 min
103
+ 1050/2000 plants, 2090 entries kept, 18.3 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 9.8 min
104
+ 1075/2000 plants, 2140 entries kept, 18.3 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 9.6 min
105
+ 1100/2000 plants, 2189 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 9.3 min
106
+ 1125/2000 plants, 2238 entries kept, 18.4 s/plant CPU (2 vrefs), 0.63 s/plant wall, eta 9.1 min
107
+ 1150/2000 plants, 2288 entries kept, 18.5 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 8.8 min
108
+ 1175/2000 plants, 2337 entries kept, 18.5 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 8.6 min
109
+ 1200/2000 plants, 2387 entries kept, 18.5 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 8.3 min
110
+ 1225/2000 plants, 2437 entries kept, 18.5 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 8.1 min
111
+ 1250/2000 plants, 2487 entries kept, 18.5 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 7.8 min
112
+ 1275/2000 plants, 2536 entries kept, 18.5 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 7.5 min
113
+ 1300/2000 plants, 2586 entries kept, 18.5 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 7.2 min
114
+ 1325/2000 plants, 2636 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 7.0 min
115
+ 1350/2000 plants, 2686 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 6.7 min
116
+ 1375/2000 plants, 2736 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 6.5 min
117
+ 1400/2000 plants, 2786 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 6.2 min
118
+ 1425/2000 plants, 2836 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 6.0 min
119
+ 1450/2000 plants, 2885 entries kept, 18.5 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 5.7 min
120
+ 1475/2000 plants, 2934 entries kept, 18.5 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 5.4 min
121
+ 1500/2000 plants, 2984 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 5.2 min
122
+ 1525/2000 plants, 3034 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 4.9 min
123
+ 1550/2000 plants, 3084 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 4.6 min
124
+ 1575/2000 plants, 3134 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 4.4 min
125
+ 1600/2000 plants, 3184 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 4.1 min
126
+ 1625/2000 plants, 3234 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 3.9 min
127
+ 1650/2000 plants, 3283 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 3.6 min
128
+ 1675/2000 plants, 3333 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 3.4 min
129
+ 1700/2000 plants, 3383 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 3.1 min
130
+ 1725/2000 plants, 3432 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 2.8 min
131
+ 1750/2000 plants, 3482 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 2.6 min
132
+ 1775/2000 plants, 3532 entries kept, 18.4 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 2.3 min
133
+ 1800/2000 plants, 3582 entries kept, 18.3 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 2.1 min
134
+ 1825/2000 plants, 3632 entries kept, 18.3 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 1.8 min
135
+ 1850/2000 plants, 3682 entries kept, 18.3 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 1.5 min
136
+ 1875/2000 plants, 3732 entries kept, 18.3 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 1.3 min
137
+ 1900/2000 plants, 3782 entries kept, 18.3 s/plant CPU (2 vrefs), 0.61 s/plant wall, eta 1.0 min
138
+ 1925/2000 plants, 3832 entries kept, 18.3 s/plant CPU (2 vrefs), 0.61 s/plant wall, eta 0.8 min
139
+ 1950/2000 plants, 3882 entries kept, 18.3 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 0.5 min
140
+ 1975/2000 plants, 3932 entries kept, 18.3 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 0.3 min
141
+ 2000/2000 plants, 3981 entries kept, 18.3 s/plant CPU (2 vrefs), 0.62 s/plant wall, eta 0.0 min
142
+
143
+ ******************************************************************************
144
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
145
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
146
+ For more information visit https://github.com/coin-or/Ipopt
147
+ ******************************************************************************
148
+
149
+
150
+ ******************************************************************************
151
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
152
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
153
+ For more information visit https://github.com/coin-or/Ipopt
154
+ ******************************************************************************
155
+
156
+
157
+ ******************************************************************************
158
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
159
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
160
+ For more information visit https://github.com/coin-or/Ipopt
161
+ ******************************************************************************
162
+
163
+
164
+ ******************************************************************************
165
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
166
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
167
+ For more information visit https://github.com/coin-or/Ipopt
168
+ ******************************************************************************
169
+
170
+
171
+ ******************************************************************************
172
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
173
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
174
+ For more information visit https://github.com/coin-or/Ipopt
175
+ ******************************************************************************
176
+
177
+
178
+ ******************************************************************************
179
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
180
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
181
+ For more information visit https://github.com/coin-or/Ipopt
182
+ ******************************************************************************
183
+
184
+
185
+ ******************************************************************************
186
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
187
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
188
+ For more information visit https://github.com/coin-or/Ipopt
189
+ ******************************************************************************
190
+
191
+
192
+ ******************************************************************************
193
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
194
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
195
+ For more information visit https://github.com/coin-or/Ipopt
196
+ ******************************************************************************
197
+
198
+
199
+ ******************************************************************************
200
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
201
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
202
+ For more information visit https://github.com/coin-or/Ipopt
203
+ ******************************************************************************
204
+
205
+
206
+ ******************************************************************************
207
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
208
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
209
+ For more information visit https://github.com/coin-or/Ipopt
210
+ ******************************************************************************
211
+
212
+
213
+ ******************************************************************************
214
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
215
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
216
+ For more information visit https://github.com/coin-or/Ipopt
217
+ ******************************************************************************
218
+
219
+
220
+ ******************************************************************************
221
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
222
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
223
+ For more information visit https://github.com/coin-or/Ipopt
224
+ ******************************************************************************
225
+
226
+
227
+ ******************************************************************************
228
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
229
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
230
+ For more information visit https://github.com/coin-or/Ipopt
231
+ ******************************************************************************
232
+
233
+
234
+ ******************************************************************************
235
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
236
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
237
+ For more information visit https://github.com/coin-or/Ipopt
238
+ ******************************************************************************
239
+
240
+
241
+ ******************************************************************************
242
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
243
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
244
+ For more information visit https://github.com/coin-or/Ipopt
245
+ ******************************************************************************
246
+
247
+
248
+ ******************************************************************************
249
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
250
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
251
+ For more information visit https://github.com/coin-or/Ipopt
252
+ ******************************************************************************
253
+
254
+
255
+ ******************************************************************************
256
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
257
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
258
+ For more information visit https://github.com/coin-or/Ipopt
259
+ ******************************************************************************
260
+
261
+
262
+ ******************************************************************************
263
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
264
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
265
+ For more information visit https://github.com/coin-or/Ipopt
266
+ ******************************************************************************
267
+
268
+
269
+ ******************************************************************************
270
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
271
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
272
+ For more information visit https://github.com/coin-or/Ipopt
273
+ ******************************************************************************
274
+
275
+
276
+ ******************************************************************************
277
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
278
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
279
+ For more information visit https://github.com/coin-or/Ipopt
280
+ ******************************************************************************
281
+
282
+
283
+ ******************************************************************************
284
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
285
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
286
+ For more information visit https://github.com/coin-or/Ipopt
287
+ ******************************************************************************
288
+
289
+
290
+ ******************************************************************************
291
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
292
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
293
+ For more information visit https://github.com/coin-or/Ipopt
294
+ ******************************************************************************
295
+
296
+
297
+ ******************************************************************************
298
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
299
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
300
+ For more information visit https://github.com/coin-or/Ipopt
301
+ ******************************************************************************
302
+
303
+
304
+ ******************************************************************************
305
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
306
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
307
+ For more information visit https://github.com/coin-or/Ipopt
308
+ ******************************************************************************
309
+
310
+
311
+ ******************************************************************************
312
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
313
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
314
+ For more information visit https://github.com/coin-or/Ipopt
315
+ ******************************************************************************
316
+
317
+
318
+ ******************************************************************************
319
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
320
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
321
+ For more information visit https://github.com/coin-or/Ipopt
322
+ ******************************************************************************
323
+
324
+
325
+ ******************************************************************************
326
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
327
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
328
+ For more information visit https://github.com/coin-or/Ipopt
329
+ ******************************************************************************
330
+
331
+
332
+ ******************************************************************************
333
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
334
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
335
+ For more information visit https://github.com/coin-or/Ipopt
336
+ ******************************************************************************
337
+
338
+
339
+ ******************************************************************************
340
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
341
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
342
+ For more information visit https://github.com/coin-or/Ipopt
343
+ ******************************************************************************
344
+
345
+
346
+ ******************************************************************************
347
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
348
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
349
+ For more information visit https://github.com/coin-or/Ipopt
350
+ ******************************************************************************
351
+
352
+ bank: 3981 entries (2000 plants) -> data/armprov.npz
353
+ vref 9.0 kept 2000 / 2000
354
+ vref 10.0 kept 1981 / 2000
355
+ {'replay failed': 19}
356
+ 3981 entries; target |x|>1: 0.00% of values, 0.0% of rows (max 0.96); cond z range -4.0..0.7
357
+ fine-tune on --device cuda (free 58404 MiB)
358
+ initialised from models/f3/f3_s0_s24000.pth (ema999)
359
+ armprov unet params=3748560 N=3981 cond_dim=7 steps=6000 from 0
360
+ step 1000 loss 0.0282 11s
361
+ step 2000 loss 0.0137 21s
362
+ step 3000 loss 0.0130 32s
363
+ step 4000 loss 0.0108 42s
364
+ step 5000 loss 0.0115 53s
365
+ step 6000 loss 0.0061 63s
366
+ finished
367
+ plan_Dr0.000105_Dp3e-05_Cr0_Cp0_V9_s0: T=0.50s Vpk=9.03 max|th|ref=74deg d0 up=1.0 tc=0.52 sim-from-rest max|th|=74 safe=True (48/48 cands)
368
+ plan_Dr0.000105_Dp3e-05_Cr0_Cp0_V10_s0: T=0.48s Vpk=10.00 max|th|ref=67deg d0 up=1.0 tc=0.49 sim-from-rest max|th|=67 safe=True (48/48 cands)
369
+ plan_Dr0.000105_Dp5e-05_Cr0_Cp0_V9_s0: T=0.50s Vpk=9.03 max|th|ref=78deg d0 up=1.0 tc=0.53 sim-from-rest max|th|=77 safe=True (48/48 cands)
370
+ plan_Dr0.000105_Dp5e-05_Cr0_Cp0_V10_s0: T=0.49s Vpk=10.00 max|th|ref=71deg d0 up=1.0 tc=0.50 sim-from-rest max|th|=71 safe=True (48/48 cands)
371
+ plan_Dr0.000105_Dp8e-05_Cr0_Cp0_V9_s0: T=0.51s Vpk=9.06 max|th|ref=86deg d0 up=1.0 tc=0.53 sim-from-rest max|th|=85 safe=True (48/48 cands)
372
+ plan_Dr0.000105_Dp8e-05_Cr0_Cp0_V10_s0: T=0.49s Vpk=10.00 max|th|ref=76deg d0 up=1.0 tc=0.50 sim-from-rest max|th|=76 safe=True (48/48 cands)
373
+ exported 6/6 plans -> hardware/qube/plans_armprov
374
+ armfit, no spring: upright 0/6, safety stop 6, max|theta| median 217 max 266 deg
375
+ armfit + spring 0.0057: upright 6/6, safety stop 0, max|theta| median 76 max 85 deg
376
+ CHAIN_DONE
hardware/qube/rebuild/logs/rig1.log ADDED
@@ -0,0 +1,396 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ 2000 plants x vrefs [9.0, 10.0], 2000 to do, 30 workers, base hardware/qube/rebuild/qube_params_rig1.json
2
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
3
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
4
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
5
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
6
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
7
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
8
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
9
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
10
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
11
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
12
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
13
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
14
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
15
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
16
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
17
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
18
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
19
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
20
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
21
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
22
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
23
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
24
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
25
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
26
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
27
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
28
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
29
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
30
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
31
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
32
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
33
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
34
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
35
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
36
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
37
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
38
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
39
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
40
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
41
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
42
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
43
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
44
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
45
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
46
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
47
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
48
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
49
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
50
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
51
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
52
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
53
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
54
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
55
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
56
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
57
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
58
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
59
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
60
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
61
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
62
+ 25/2000 plants, 42 entries kept, 15.2 s/plant CPU (2 vrefs), 0.73 s/plant wall, eta 24.2 min
63
+ 50/2000 plants, 90 entries kept, 14.7 s/plant CPU (2 vrefs), 0.61 s/plant wall, eta 19.8 min
64
+ 75/2000 plants, 130 entries kept, 14.6 s/plant CPU (2 vrefs), 0.58 s/plant wall, eta 18.6 min
65
+ 100/2000 plants, 172 entries kept, 14.4 s/plant CPU (2 vrefs), 0.56 s/plant wall, eta 17.8 min
66
+ 125/2000 plants, 220 entries kept, 14.2 s/plant CPU (2 vrefs), 0.54 s/plant wall, eta 16.9 min
67
+ 150/2000 plants, 267 entries kept, 14.2 s/plant CPU (2 vrefs), 0.52 s/plant wall, eta 16.2 min
68
+ 175/2000 plants, 313 entries kept, 14.1 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 15.3 min
69
+ 200/2000 plants, 358 entries kept, 14.0 s/plant CPU (2 vrefs), 0.51 s/plant wall, eta 15.2 min
70
+ 225/2000 plants, 399 entries kept, 14.1 s/plant CPU (2 vrefs), 0.51 s/plant wall, eta 15.0 min
71
+ 250/2000 plants, 444 entries kept, 14.1 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 14.5 min
72
+ 275/2000 plants, 486 entries kept, 14.1 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 14.0 min
73
+ 300/2000 plants, 532 entries kept, 14.0 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 13.8 min
74
+ 325/2000 plants, 580 entries kept, 14.0 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 13.7 min
75
+ 350/2000 plants, 623 entries kept, 14.1 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 13.4 min
76
+ 375/2000 plants, 665 entries kept, 14.1 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 13.3 min
77
+ 400/2000 plants, 710 entries kept, 14.1 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 13.1 min
78
+ 425/2000 plants, 754 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 12.7 min
79
+ 450/2000 plants, 796 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 12.5 min
80
+ 475/2000 plants, 842 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 12.3 min
81
+ 500/2000 plants, 883 entries kept, 14.1 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 12.2 min
82
+ 525/2000 plants, 923 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 11.9 min
83
+ 550/2000 plants, 965 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 11.6 min
84
+ 575/2000 plants, 1005 entries kept, 14.0 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 11.4 min
85
+ 600/2000 plants, 1047 entries kept, 14.0 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 11.2 min
86
+ 625/2000 plants, 1093 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 11.0 min
87
+ 650/2000 plants, 1132 entries kept, 14.0 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 10.8 min
88
+ 675/2000 plants, 1173 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 10.6 min
89
+ 700/2000 plants, 1214 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 10.3 min
90
+ 725/2000 plants, 1254 entries kept, 14.0 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 10.2 min
91
+ 750/2000 plants, 1297 entries kept, 14.0 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 10.0 min
92
+ 775/2000 plants, 1344 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 9.8 min
93
+ 800/2000 plants, 1386 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 9.6 min
94
+ 825/2000 plants, 1433 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 9.3 min
95
+ 850/2000 plants, 1482 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 9.1 min
96
+ 875/2000 plants, 1529 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 9.0 min
97
+ 900/2000 plants, 1575 entries kept, 14.1 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 8.8 min
98
+ 925/2000 plants, 1616 entries kept, 14.1 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 8.5 min
99
+ 950/2000 plants, 1662 entries kept, 14.1 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 8.3 min
100
+ 975/2000 plants, 1708 entries kept, 14.0 s/plant CPU (2 vrefs), 0.48 s/plant wall, eta 8.1 min
101
+ 1000/2000 plants, 1754 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 7.9 min
102
+ 1025/2000 plants, 1798 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 7.7 min
103
+ 1050/2000 plants, 1841 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 7.5 min
104
+ 1075/2000 plants, 1883 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 7.3 min
105
+ 1100/2000 plants, 1930 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 7.1 min
106
+ 1125/2000 plants, 1977 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 6.9 min
107
+ 1150/2000 plants, 2023 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 6.7 min
108
+ 1175/2000 plants, 2063 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 6.5 min
109
+ 1200/2000 plants, 2109 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 6.3 min
110
+ 1225/2000 plants, 2156 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 6.1 min
111
+ 1250/2000 plants, 2197 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 5.9 min
112
+ 1275/2000 plants, 2246 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 5.7 min
113
+ 1300/2000 plants, 2292 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 5.5 min
114
+ 1325/2000 plants, 2338 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 5.3 min
115
+ 1350/2000 plants, 2384 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 5.1 min
116
+ 1375/2000 plants, 2427 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 4.9 min
117
+ 1400/2000 plants, 2470 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 4.7 min
118
+ 1425/2000 plants, 2519 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 4.5 min
119
+ 1450/2000 plants, 2563 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 4.3 min
120
+ 1475/2000 plants, 2606 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 4.1 min
121
+ 1500/2000 plants, 2649 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 3.9 min
122
+ 1525/2000 plants, 2693 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 3.7 min
123
+ 1550/2000 plants, 2737 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 3.5 min
124
+ 1575/2000 plants, 2782 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 3.3 min
125
+ 1600/2000 plants, 2826 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 3.1 min
126
+ 1625/2000 plants, 2875 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 3.0 min
127
+ 1650/2000 plants, 2919 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 2.8 min
128
+ 1675/2000 plants, 2963 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 2.6 min
129
+ 1700/2000 plants, 3003 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 2.4 min
130
+ 1725/2000 plants, 3048 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 2.2 min
131
+ 1750/2000 plants, 3097 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 2.0 min
132
+ 1775/2000 plants, 3137 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 1.8 min
133
+ 1800/2000 plants, 3178 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 1.6 min
134
+ 1825/2000 plants, 3225 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 1.4 min
135
+ 1850/2000 plants, 3270 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 1.2 min
136
+ 1875/2000 plants, 3316 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 1.0 min
137
+ 1900/2000 plants, 3360 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 0.8 min
138
+ 1925/2000 plants, 3404 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 0.6 min
139
+ 1950/2000 plants, 3449 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 0.4 min
140
+ 1975/2000 plants, 3497 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 0.2 min
141
+ 2000/2000 plants, 3539 entries kept, 14.0 s/plant CPU (2 vrefs), 0.47 s/plant wall, eta 0.0 min
142
+
143
+ ******************************************************************************
144
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
145
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
146
+ For more information visit https://github.com/coin-or/Ipopt
147
+ ******************************************************************************
148
+
149
+
150
+ ******************************************************************************
151
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
152
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
153
+ For more information visit https://github.com/coin-or/Ipopt
154
+ ******************************************************************************
155
+
156
+
157
+ ******************************************************************************
158
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
159
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
160
+ For more information visit https://github.com/coin-or/Ipopt
161
+ ******************************************************************************
162
+
163
+
164
+ ******************************************************************************
165
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
166
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
167
+ For more information visit https://github.com/coin-or/Ipopt
168
+ ******************************************************************************
169
+
170
+
171
+ ******************************************************************************
172
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
173
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
174
+ For more information visit https://github.com/coin-or/Ipopt
175
+ ******************************************************************************
176
+
177
+
178
+ ******************************************************************************
179
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
180
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
181
+ For more information visit https://github.com/coin-or/Ipopt
182
+ ******************************************************************************
183
+
184
+
185
+ ******************************************************************************
186
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
187
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
188
+ For more information visit https://github.com/coin-or/Ipopt
189
+ ******************************************************************************
190
+
191
+
192
+ ******************************************************************************
193
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
194
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
195
+ For more information visit https://github.com/coin-or/Ipopt
196
+ ******************************************************************************
197
+
198
+
199
+ ******************************************************************************
200
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
201
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
202
+ For more information visit https://github.com/coin-or/Ipopt
203
+ ******************************************************************************
204
+
205
+
206
+ ******************************************************************************
207
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
208
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
209
+ For more information visit https://github.com/coin-or/Ipopt
210
+ ******************************************************************************
211
+
212
+
213
+ ******************************************************************************
214
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
215
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
216
+ For more information visit https://github.com/coin-or/Ipopt
217
+ ******************************************************************************
218
+
219
+
220
+ ******************************************************************************
221
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
222
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
223
+ For more information visit https://github.com/coin-or/Ipopt
224
+ ******************************************************************************
225
+
226
+
227
+ ******************************************************************************
228
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
229
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
230
+ For more information visit https://github.com/coin-or/Ipopt
231
+ ******************************************************************************
232
+
233
+
234
+ ******************************************************************************
235
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
236
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
237
+ For more information visit https://github.com/coin-or/Ipopt
238
+ ******************************************************************************
239
+
240
+
241
+ ******************************************************************************
242
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
243
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
244
+ For more information visit https://github.com/coin-or/Ipopt
245
+ ******************************************************************************
246
+
247
+
248
+ ******************************************************************************
249
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
250
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
251
+ For more information visit https://github.com/coin-or/Ipopt
252
+ ******************************************************************************
253
+
254
+
255
+ ******************************************************************************
256
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
257
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
258
+ For more information visit https://github.com/coin-or/Ipopt
259
+ ******************************************************************************
260
+
261
+
262
+ ******************************************************************************
263
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
264
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
265
+ For more information visit https://github.com/coin-or/Ipopt
266
+ ******************************************************************************
267
+
268
+
269
+ ******************************************************************************
270
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
271
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
272
+ For more information visit https://github.com/coin-or/Ipopt
273
+ ******************************************************************************
274
+
275
+
276
+ ******************************************************************************
277
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
278
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
279
+ For more information visit https://github.com/coin-or/Ipopt
280
+ ******************************************************************************
281
+
282
+
283
+ ******************************************************************************
284
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
285
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
286
+ For more information visit https://github.com/coin-or/Ipopt
287
+ ******************************************************************************
288
+
289
+
290
+ ******************************************************************************
291
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
292
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
293
+ For more information visit https://github.com/coin-or/Ipopt
294
+ ******************************************************************************
295
+
296
+
297
+ ******************************************************************************
298
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
299
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
300
+ For more information visit https://github.com/coin-or/Ipopt
301
+ ******************************************************************************
302
+
303
+
304
+ ******************************************************************************
305
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
306
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
307
+ For more information visit https://github.com/coin-or/Ipopt
308
+ ******************************************************************************
309
+
310
+
311
+ ******************************************************************************
312
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
313
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
314
+ For more information visit https://github.com/coin-or/Ipopt
315
+ ******************************************************************************
316
+
317
+
318
+ ******************************************************************************
319
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
320
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
321
+ For more information visit https://github.com/coin-or/Ipopt
322
+ ******************************************************************************
323
+
324
+
325
+ ******************************************************************************
326
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
327
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
328
+ For more information visit https://github.com/coin-or/Ipopt
329
+ ******************************************************************************
330
+
331
+
332
+ ******************************************************************************
333
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
334
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
335
+ For more information visit https://github.com/coin-or/Ipopt
336
+ ******************************************************************************
337
+
338
+
339
+ ******************************************************************************
340
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
341
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
342
+ For more information visit https://github.com/coin-or/Ipopt
343
+ ******************************************************************************
344
+
345
+
346
+ ******************************************************************************
347
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
348
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
349
+ For more information visit https://github.com/coin-or/Ipopt
350
+ ******************************************************************************
351
+
352
+ bank: 3539 entries (2000 plants) -> data/rig1.npz
353
+ vref 9.0 kept 1682 / 2000
354
+ vref 10.0 kept 1857 / 2000
355
+ {'nmpc failed': 146, 'replay failed': 315}
356
+ 3539 entries; target |x|>1: 0.00% of values, 0.0% of rows (max 0.96); cond z range -2.3..2.4
357
+ fine-tune on --device cuda (free 58404 MiB)
358
+ initialised from models/f3/f3_s0_s24000.pth (ema999)
359
+ rig1 unet params=3748560 N=3539 cond_dim=7 steps=6000 from 0
360
+ step 1000 loss 0.0322 11s
361
+ step 2000 loss 0.0235 21s
362
+ step 3000 loss 0.0212 32s
363
+ step 4000 loss 0.0186 42s
364
+ step 5000 loss 0.0196 53s
365
+ step 6000 loss 0.0131 64s
366
+ finished
367
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
368
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
369
+ plan_Dr0.0003_Dp8.16e-05_Cr0.0005_Cp0.00018_V9_s0: T=0.48s Vpk=9.01 max|th|ref=83deg d0 up=1.0 tc=0.48 sim-from-rest max|th|=57 safe=True (48/48 cands)
370
+ plan_Dr0.0003_Dp8.16e-05_Cr0.0005_Cp0.00018_V10_s0: T=0.46s Vpk=10.00 max|th|ref=96deg d0 up=1.0 tc=0.48 sim-from-rest max|th|=57 safe=True (45/46 cands)
371
+ plan_Dr0.0003_Dp0.000136_Cr0.0005_Cp0.00018_V9_s0: T=0.49s Vpk=9.03 max|th|ref=73deg d0 up=1.0 tc=0.50 sim-from-rest max|th|=68 safe=True (35/43 cands)
372
+ plan_Dr0.0003_Dp0.000136_Cr0.0005_Cp0.00018_V10_s0: T=0.47s Vpk=10.00 max|th|ref=93deg d0 up=1.0 tc=0.48 sim-from-rest max|th|=57 safe=True (46/46 cands)
373
+ plan_Dr0.0003_Dp0.000218_Cr0.0005_Cp0.00018_V9_s0: T=0.52s Vpk=9.05 max|th|ref=53deg d0 up=1.0 tc=0.56 sim-from-rest max|th|=88 safe=True (43/48 cands)
374
+ plan_Dr0.0003_Dp0.000218_Cr0.0005_Cp0.00018_V10_s0: T=0.49s Vpk=10.00 max|th|ref=77deg d0 up=1.0 tc=0.51 sim-from-rest max|th|=70 safe=True (48/48 cands)
375
+ exported 6/6 plans -> hardware/qube/plans_rig1
376
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
377
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
378
+ warning: starting with theta=-12.5 deg
379
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
380
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
381
+ warning: starting with theta=-12.5 deg
382
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
383
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
384
+ warning: starting with theta=-12.5 deg
385
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
386
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
387
+ warning: starting with theta=-12.5 deg
388
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
389
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
390
+ warning: starting with theta=-12.5 deg
391
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
392
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
393
+ warning: starting with theta=-12.5 deg
394
+ armfit, no spring: upright 5/6, safety stop 1, max|theta| median 69 max 182 deg
395
+ armfit + spring 0.0054: upright 6/6, safety stop 0, max|theta| median 68 max 88 deg
396
+ CHAIN_DONE
hardware/qube/rebuild/logs/rig1w.log ADDED
@@ -0,0 +1,476 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ 4000 plants x vrefs [9.0, 10.0], 4000 to do, 30 workers, base hardware/qube/rebuild/qube_params_rig1.json
2
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
3
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
4
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
5
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
6
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
7
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
8
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
9
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
10
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
11
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
12
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
13
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
14
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
15
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
16
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
17
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
18
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
19
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
20
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
21
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
22
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
23
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
24
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
25
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
26
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
27
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
28
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
29
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
30
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
31
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
32
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
33
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
34
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
35
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
36
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
37
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
38
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
39
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
40
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
41
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
42
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
43
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
44
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
45
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
46
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
47
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
48
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
49
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
50
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
51
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
52
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
53
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
54
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
55
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
56
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
57
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
58
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
59
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
60
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
61
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
62
+ 25/4000 plants, 40 entries kept, 15.2 s/plant CPU (2 vrefs), 0.77 s/plant wall, eta 50.8 min
63
+ 50/4000 plants, 84 entries kept, 15.0 s/plant CPU (2 vrefs), 0.66 s/plant wall, eta 43.1 min
64
+ 75/4000 plants, 124 entries kept, 14.9 s/plant CPU (2 vrefs), 0.57 s/plant wall, eta 37.5 min
65
+ 100/4000 plants, 167 entries kept, 14.7 s/plant CPU (2 vrefs), 0.57 s/plant wall, eta 36.9 min
66
+ 125/4000 plants, 211 entries kept, 14.8 s/plant CPU (2 vrefs), 0.56 s/plant wall, eta 36.0 min
67
+ 150/4000 plants, 251 entries kept, 14.9 s/plant CPU (2 vrefs), 0.55 s/plant wall, eta 35.0 min
68
+ 175/4000 plants, 297 entries kept, 14.9 s/plant CPU (2 vrefs), 0.53 s/plant wall, eta 34.0 min
69
+ 200/4000 plants, 336 entries kept, 14.8 s/plant CPU (2 vrefs), 0.53 s/plant wall, eta 33.8 min
70
+ 225/4000 plants, 383 entries kept, 14.8 s/plant CPU (2 vrefs), 0.52 s/plant wall, eta 33.0 min
71
+ 250/4000 plants, 422 entries kept, 14.7 s/plant CPU (2 vrefs), 0.52 s/plant wall, eta 32.6 min
72
+ 275/4000 plants, 461 entries kept, 14.6 s/plant CPU (2 vrefs), 0.52 s/plant wall, eta 32.1 min
73
+ 300/4000 plants, 504 entries kept, 14.6 s/plant CPU (2 vrefs), 0.51 s/plant wall, eta 31.4 min
74
+ 325/4000 plants, 545 entries kept, 14.6 s/plant CPU (2 vrefs), 0.51 s/plant wall, eta 31.2 min
75
+ 350/4000 plants, 587 entries kept, 14.6 s/plant CPU (2 vrefs), 0.51 s/plant wall, eta 30.8 min
76
+ 375/4000 plants, 618 entries kept, 14.6 s/plant CPU (2 vrefs), 0.51 s/plant wall, eta 30.6 min
77
+ 400/4000 plants, 661 entries kept, 14.6 s/plant CPU (2 vrefs), 0.51 s/plant wall, eta 30.4 min
78
+ 425/4000 plants, 699 entries kept, 14.7 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 30.1 min
79
+ 450/4000 plants, 740 entries kept, 14.6 s/plant CPU (2 vrefs), 0.51 s/plant wall, eta 30.0 min
80
+ 475/4000 plants, 786 entries kept, 14.6 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 29.5 min
81
+ 500/4000 plants, 823 entries kept, 14.6 s/plant CPU (2 vrefs), 0.51 s/plant wall, eta 29.5 min
82
+ 525/4000 plants, 861 entries kept, 14.6 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 29.2 min
83
+ 550/4000 plants, 898 entries kept, 14.6 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 28.8 min
84
+ 575/4000 plants, 933 entries kept, 14.6 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 28.6 min
85
+ 600/4000 plants, 971 entries kept, 14.6 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 28.4 min
86
+ 625/4000 plants, 1014 entries kept, 14.6 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 28.2 min
87
+ 650/4000 plants, 1054 entries kept, 14.6 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 28.0 min
88
+ 675/4000 plants, 1096 entries kept, 14.7 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 27.6 min
89
+ 700/4000 plants, 1136 entries kept, 14.7 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 27.6 min
90
+ 725/4000 plants, 1181 entries kept, 14.7 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 27.3 min
91
+ 750/4000 plants, 1222 entries kept, 14.7 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 27.1 min
92
+ 775/4000 plants, 1258 entries kept, 14.7 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 26.8 min
93
+ 800/4000 plants, 1296 entries kept, 14.7 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 26.6 min
94
+ 825/4000 plants, 1341 entries kept, 14.6 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 26.4 min
95
+ 850/4000 plants, 1390 entries kept, 14.6 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 26.1 min
96
+ 875/4000 plants, 1432 entries kept, 14.6 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 25.9 min
97
+ 900/4000 plants, 1474 entries kept, 14.6 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 25.6 min
98
+ 925/4000 plants, 1512 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 25.3 min
99
+ 950/4000 plants, 1556 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 25.1 min
100
+ 975/4000 plants, 1592 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 25.0 min
101
+ 1000/4000 plants, 1631 entries kept, 14.6 s/plant CPU (2 vrefs), 0.50 s/plant wall, eta 24.8 min
102
+ 1025/4000 plants, 1670 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 24.5 min
103
+ 1050/4000 plants, 1709 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 24.3 min
104
+ 1075/4000 plants, 1748 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 24.1 min
105
+ 1100/4000 plants, 1788 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 23.8 min
106
+ 1125/4000 plants, 1828 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 23.6 min
107
+ 1150/4000 plants, 1870 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 23.4 min
108
+ 1175/4000 plants, 1909 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 23.2 min
109
+ 1200/4000 plants, 1949 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 23.0 min
110
+ 1225/4000 plants, 1984 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 22.8 min
111
+ 1250/4000 plants, 2021 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 22.6 min
112
+ 1275/4000 plants, 2059 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 22.3 min
113
+ 1300/4000 plants, 2099 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 22.1 min
114
+ 1325/4000 plants, 2138 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 21.9 min
115
+ 1350/4000 plants, 2171 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 21.7 min
116
+ 1375/4000 plants, 2215 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 21.5 min
117
+ 1400/4000 plants, 2262 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 21.4 min
118
+ 1425/4000 plants, 2305 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 21.2 min
119
+ 1450/4000 plants, 2340 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 20.9 min
120
+ 1475/4000 plants, 2376 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 20.7 min
121
+ 1500/4000 plants, 2415 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 20.5 min
122
+ 1525/4000 plants, 2460 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 20.3 min
123
+ 1550/4000 plants, 2505 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 20.1 min
124
+ 1575/4000 plants, 2544 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 19.9 min
125
+ 1600/4000 plants, 2582 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 19.8 min
126
+ 1625/4000 plants, 2620 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 19.5 min
127
+ 1650/4000 plants, 2666 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 19.3 min
128
+ 1675/4000 plants, 2707 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 19.1 min
129
+ 1700/4000 plants, 2749 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 18.9 min
130
+ 1725/4000 plants, 2786 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 18.7 min
131
+ 1750/4000 plants, 2830 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 18.5 min
132
+ 1775/4000 plants, 2870 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 18.2 min
133
+ 1800/4000 plants, 2912 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 18.0 min
134
+ 1825/4000 plants, 2958 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 17.9 min
135
+ 1850/4000 plants, 2999 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 17.6 min
136
+ 1875/4000 plants, 3042 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 17.4 min
137
+ 1900/4000 plants, 3081 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 17.2 min
138
+ 1925/4000 plants, 3124 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 17.0 min
139
+ 1950/4000 plants, 3169 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 16.8 min
140
+ 1975/4000 plants, 3212 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 16.6 min
141
+ 2000/4000 plants, 3253 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 16.4 min
142
+ 2025/4000 plants, 3292 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 16.2 min
143
+ 2050/4000 plants, 3333 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 16.0 min
144
+ 2075/4000 plants, 3378 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 15.8 min
145
+ 2100/4000 plants, 3422 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 15.6 min
146
+ 2125/4000 plants, 3462 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 15.4 min
147
+ 2150/4000 plants, 3495 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 15.1 min
148
+ 2175/4000 plants, 3535 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 15.0 min
149
+ 2200/4000 plants, 3580 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 14.8 min
150
+ 2225/4000 plants, 3620 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 14.5 min
151
+ 2250/4000 plants, 3659 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 14.3 min
152
+ 2275/4000 plants, 3700 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 14.1 min
153
+ 2300/4000 plants, 3746 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 13.9 min
154
+ 2325/4000 plants, 3783 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 13.7 min
155
+ 2350/4000 plants, 3818 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 13.5 min
156
+ 2375/4000 plants, 3861 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 13.3 min
157
+ 2400/4000 plants, 3902 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 13.1 min
158
+ 2425/4000 plants, 3945 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 12.9 min
159
+ 2450/4000 plants, 3982 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 12.7 min
160
+ 2475/4000 plants, 4025 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 12.5 min
161
+ 2500/4000 plants, 4068 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 12.3 min
162
+ 2525/4000 plants, 4109 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 12.1 min
163
+ 2550/4000 plants, 4148 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 11.9 min
164
+ 2575/4000 plants, 4189 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 11.7 min
165
+ 2600/4000 plants, 4227 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 11.5 min
166
+ 2625/4000 plants, 4269 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 11.3 min
167
+ 2650/4000 plants, 4309 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 11.1 min
168
+ 2675/4000 plants, 4351 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 10.9 min
169
+ 2700/4000 plants, 4394 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 10.7 min
170
+ 2725/4000 plants, 4429 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 10.5 min
171
+ 2750/4000 plants, 4474 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 10.3 min
172
+ 2775/4000 plants, 4513 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 10.0 min
173
+ 2800/4000 plants, 4555 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 9.8 min
174
+ 2825/4000 plants, 4594 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 9.6 min
175
+ 2850/4000 plants, 4636 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 9.4 min
176
+ 2875/4000 plants, 4675 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 9.2 min
177
+ 2900/4000 plants, 4718 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 9.0 min
178
+ 2925/4000 plants, 4760 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 8.8 min
179
+ 2950/4000 plants, 4806 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 8.6 min
180
+ 2975/4000 plants, 4841 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 8.4 min
181
+ 3000/4000 plants, 4885 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 8.2 min
182
+ 3025/4000 plants, 4920 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 8.0 min
183
+ 3050/4000 plants, 4962 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 7.8 min
184
+ 3075/4000 plants, 5001 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 7.6 min
185
+ 3100/4000 plants, 5038 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 7.4 min
186
+ 3125/4000 plants, 5076 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 7.2 min
187
+ 3150/4000 plants, 5117 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 7.0 min
188
+ 3175/4000 plants, 5158 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 6.8 min
189
+ 3200/4000 plants, 5199 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 6.5 min
190
+ 3225/4000 plants, 5239 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 6.3 min
191
+ 3250/4000 plants, 5271 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 6.1 min
192
+ 3275/4000 plants, 5317 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 5.9 min
193
+ 3300/4000 plants, 5355 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 5.7 min
194
+ 3325/4000 plants, 5393 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 5.5 min
195
+ 3350/4000 plants, 5432 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 5.3 min
196
+ 3375/4000 plants, 5472 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 5.1 min
197
+ 3400/4000 plants, 5511 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 4.9 min
198
+ 3425/4000 plants, 5548 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 4.7 min
199
+ 3450/4000 plants, 5587 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 4.5 min
200
+ 3475/4000 plants, 5628 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 4.3 min
201
+ 3500/4000 plants, 5664 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 4.1 min
202
+ 3525/4000 plants, 5704 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 3.9 min
203
+ 3550/4000 plants, 5735 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 3.7 min
204
+ 3575/4000 plants, 5772 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 3.5 min
205
+ 3600/4000 plants, 5815 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 3.3 min
206
+ 3625/4000 plants, 5858 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 3.1 min
207
+ 3650/4000 plants, 5901 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 2.9 min
208
+ 3675/4000 plants, 5941 entries kept, 14.6 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 2.7 min
209
+ 3700/4000 plants, 5978 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 2.5 min
210
+ 3725/4000 plants, 6016 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 2.2 min
211
+ 3750/4000 plants, 6056 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 2.0 min
212
+ 3775/4000 plants, 6097 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 1.8 min
213
+ 3800/4000 plants, 6137 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 1.6 min
214
+ 3825/4000 plants, 6174 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 1.4 min
215
+ 3850/4000 plants, 6216 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 1.2 min
216
+ 3875/4000 plants, 6258 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 1.0 min
217
+ 3900/4000 plants, 6296 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 0.8 min
218
+ 3925/4000 plants, 6340 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 0.6 min
219
+ 3950/4000 plants, 6384 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 0.4 min
220
+ 3975/4000 plants, 6420 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 0.2 min
221
+ 4000/4000 plants, 6461 entries kept, 14.7 s/plant CPU (2 vrefs), 0.49 s/plant wall, eta 0.0 min
222
+
223
+ ******************************************************************************
224
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
225
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
226
+ For more information visit https://github.com/coin-or/Ipopt
227
+ ******************************************************************************
228
+
229
+
230
+ ******************************************************************************
231
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
232
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
233
+ For more information visit https://github.com/coin-or/Ipopt
234
+ ******************************************************************************
235
+
236
+
237
+ ******************************************************************************
238
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
239
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
240
+ For more information visit https://github.com/coin-or/Ipopt
241
+ ******************************************************************************
242
+
243
+
244
+ ******************************************************************************
245
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
246
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
247
+ For more information visit https://github.com/coin-or/Ipopt
248
+ ******************************************************************************
249
+
250
+
251
+ ******************************************************************************
252
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
253
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
254
+ For more information visit https://github.com/coin-or/Ipopt
255
+ ******************************************************************************
256
+
257
+
258
+ ******************************************************************************
259
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
260
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
261
+ For more information visit https://github.com/coin-or/Ipopt
262
+ ******************************************************************************
263
+
264
+
265
+ ******************************************************************************
266
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
267
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
268
+ For more information visit https://github.com/coin-or/Ipopt
269
+ ******************************************************************************
270
+
271
+
272
+ ******************************************************************************
273
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
274
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
275
+ For more information visit https://github.com/coin-or/Ipopt
276
+ ******************************************************************************
277
+
278
+
279
+ ******************************************************************************
280
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
281
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
282
+ For more information visit https://github.com/coin-or/Ipopt
283
+ ******************************************************************************
284
+
285
+
286
+ ******************************************************************************
287
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
288
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
289
+ For more information visit https://github.com/coin-or/Ipopt
290
+ ******************************************************************************
291
+
292
+
293
+ ******************************************************************************
294
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
295
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
296
+ For more information visit https://github.com/coin-or/Ipopt
297
+ ******************************************************************************
298
+
299
+
300
+ ******************************************************************************
301
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
302
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
303
+ For more information visit https://github.com/coin-or/Ipopt
304
+ ******************************************************************************
305
+
306
+
307
+ ******************************************************************************
308
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
309
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
310
+ For more information visit https://github.com/coin-or/Ipopt
311
+ ******************************************************************************
312
+
313
+
314
+ ******************************************************************************
315
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
316
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
317
+ For more information visit https://github.com/coin-or/Ipopt
318
+ ******************************************************************************
319
+
320
+
321
+ ******************************************************************************
322
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
323
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
324
+ For more information visit https://github.com/coin-or/Ipopt
325
+ ******************************************************************************
326
+
327
+
328
+ ******************************************************************************
329
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
330
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
331
+ For more information visit https://github.com/coin-or/Ipopt
332
+ ******************************************************************************
333
+
334
+
335
+ ******************************************************************************
336
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
337
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
338
+ For more information visit https://github.com/coin-or/Ipopt
339
+ ******************************************************************************
340
+
341
+
342
+ ******************************************************************************
343
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
344
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
345
+ For more information visit https://github.com/coin-or/Ipopt
346
+ ******************************************************************************
347
+
348
+
349
+ ******************************************************************************
350
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
351
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
352
+ For more information visit https://github.com/coin-or/Ipopt
353
+ ******************************************************************************
354
+
355
+
356
+ ******************************************************************************
357
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
358
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
359
+ For more information visit https://github.com/coin-or/Ipopt
360
+ ******************************************************************************
361
+
362
+
363
+ ******************************************************************************
364
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
365
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
366
+ For more information visit https://github.com/coin-or/Ipopt
367
+ ******************************************************************************
368
+
369
+
370
+ ******************************************************************************
371
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
372
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
373
+ For more information visit https://github.com/coin-or/Ipopt
374
+ ******************************************************************************
375
+
376
+
377
+ ******************************************************************************
378
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
379
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
380
+ For more information visit https://github.com/coin-or/Ipopt
381
+ ******************************************************************************
382
+
383
+
384
+ ******************************************************************************
385
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
386
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
387
+ For more information visit https://github.com/coin-or/Ipopt
388
+ ******************************************************************************
389
+
390
+
391
+ ******************************************************************************
392
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
393
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
394
+ For more information visit https://github.com/coin-or/Ipopt
395
+ ******************************************************************************
396
+
397
+
398
+ ******************************************************************************
399
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
400
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
401
+ For more information visit https://github.com/coin-or/Ipopt
402
+ ******************************************************************************
403
+
404
+
405
+ ******************************************************************************
406
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
407
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
408
+ For more information visit https://github.com/coin-or/Ipopt
409
+ ******************************************************************************
410
+
411
+
412
+ ******************************************************************************
413
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
414
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
415
+ For more information visit https://github.com/coin-or/Ipopt
416
+ ******************************************************************************
417
+
418
+
419
+ ******************************************************************************
420
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
421
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
422
+ For more information visit https://github.com/coin-or/Ipopt
423
+ ******************************************************************************
424
+
425
+
426
+ ******************************************************************************
427
+ This program contains Ipopt, a library for large-scale nonlinear optimization.
428
+ Ipopt is released as open source code under the Eclipse Public License (EPL).
429
+ For more information visit https://github.com/coin-or/Ipopt
430
+ ******************************************************************************
431
+
432
+ bank: 6461 entries (4000 plants) -> data/rig1w.npz
433
+ vref 9.0 kept 3238 / 4000
434
+ vref 10.0 kept 3223 / 4000
435
+ {'nmpc failed': 1054, 'replay failed': 485}
436
+ 6461 entries; target |x|>1: 0.00% of values, 0.0% of rows (max 0.96); cond z range -2.4..2.4
437
+ fine-tune on --device cuda (free 58404 MiB)
438
+ initialised from models/f3/f3_s0_s24000.pth (ema999)
439
+ rig1w unet params=3748560 N=6461 cond_dim=7 steps=6000 from 0
440
+ step 1000 loss 0.0288 7s
441
+ step 2000 loss 0.0190 13s
442
+ step 3000 loss 0.0178 21s
443
+ step 4000 loss 0.0175 29s
444
+ step 5000 loss 0.0191 38s
445
+ step 6000 loss 0.0119 47s
446
+ finished
447
+ /home/cercola/matte_server/DiffusionControl/nonlinear/data_generation/furuta_roa.py:190: UserWarning: Solution may be inaccurate. Try another solver, adjusting the solver settings, or solve with verbose=True for more information.
448
+ cp.Problem(cp.Maximize(cp.log_det(S)), cons).solve(solver=solver, verbose=False)
449
+ plan_Dr0.0003_Dp8.16e-05_Cr0.0005_Cp0.00018_V9_s0: T=0.47s Vpk=9.03 max|th|ref=84deg d0 up=1.0 tc=0.48 sim-from-rest max|th|=56 safe=True (48/48 cands)
450
+ plan_Dr0.0003_Dp8.16e-05_Cr0.0005_Cp0.00018_V10_s0: T=0.45s Vpk=10.00 max|th|ref=96deg d0 up=1.0 tc=0.48 sim-from-rest max|th|=58 safe=True (28/28 cands)
451
+ plan_Dr0.0003_Dp0.000136_Cr0.0005_Cp0.00018_V9_s0: T=0.49s Vpk=9.04 max|th|ref=74deg d0 up=1.0 tc=0.50 sim-from-rest max|th|=68 safe=True (39/48 cands)
452
+ plan_Dr0.0003_Dp0.000136_Cr0.0005_Cp0.00018_V10_s0: T=0.47s Vpk=10.00 max|th|ref=94deg d0 up=1.0 tc=0.47 sim-from-rest max|th|=56 safe=True (37/37 cands)
453
+ plan_Dr0.0003_Dp0.000218_Cr0.0005_Cp0.00018_V9_s0: T=0.52s Vpk=9.09 max|th|ref=55deg d0 up=1.0 tc=0.56 sim-from-rest max|th|=88 safe=True (34/43 cands)
454
+ plan_Dr0.0003_Dp0.000218_Cr0.0005_Cp0.00018_V10_s0: T=0.49s Vpk=10.00 max|th|ref=77deg d0 up=1.0 tc=0.51 sim-from-rest max|th|=70 safe=True (48/48 cands)
455
+ exported 6/6 plans -> hardware/qube/plans_rig1w
456
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
457
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
458
+ warning: starting with theta=-12.5 deg
459
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
460
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
461
+ warning: starting with theta=-12.5 deg
462
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
463
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
464
+ warning: starting with theta=-12.5 deg
465
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
466
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
467
+ warning: starting with theta=-12.5 deg
468
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
469
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
470
+ warning: starting with theta=-12.5 deg
471
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
472
+ warning: arm did not settle at theta=0 (theta=-12.5 deg)
473
+ warning: starting with theta=-12.5 deg
474
+ armfit, no spring: upright 5/6, safety stop 1, max|theta| median 73 max 172 deg
475
+ armfit + spring 0.0054: upright 6/6, safety stop 0, max|theta| median 68 max 88 deg
476
+ CHAIN_DONE
hardware/qube/sysid/data2/fit/fit_decay1.log ADDED
@@ -0,0 +1,47 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "mp": 0.024,
3
+ "notes": [
4
+ "arm moved 41.0 deg during decay: Dp/Cp biased by reaction; rerun with the arm braced",
5
+ "total arm viscous damping 7.34e-10 is below F3's built-in back-emf damping 2.10e-04: F3-convention Dr<0 (clip to 0 / lowest family value); the F3 voltage->torque gain is too high for this rig",
6
+ "fitted kt/Rm is 0.77x the F3 value: F3's voltage-to-torque gain is off for this rig"
7
+ ],
8
+ "Lp": 0.12902878438480292,
9
+ "Dp": 0.0001359893125405229,
10
+ "Cp": 0.000179561411075869,
11
+ "se": {
12
+ "Lp": 0.00015030308407576465,
13
+ "Dp": 6.52180455384347e-05,
14
+ "Cp": 6.84407016359236e-05,
15
+ "Dr": 2.5209415622903863e-06,
16
+ "Cr": 7.139858039834704e-05,
17
+ "cable_spring": 0.0004695829586954817,
18
+ "Jr": 6.498094339403813e-06,
19
+ "kg": 9.972113566987979e-05
20
+ },
21
+ "current": {
22
+ "Rm": 9.976481671982123,
23
+ "Rm_se": 0.0024028887201924106,
24
+ "km": 0.04485993439981537,
25
+ "km_se": 0.00026314783219503416
26
+ },
27
+ "Db_total_arm_viscous": 7.343764131846082e-10,
28
+ "Dr": -0.0002099992656235868,
29
+ "Cr": 0.0007301496349904095,
30
+ "cable_spring": 0.005384412302733391,
31
+ "Jr_fit": 6.076150612420159e-05,
32
+ "theta0": 0.5961746419127734,
33
+ "V_break": 0.18890607205665377,
34
+ "Jr_F3": 0.0002327916666666667,
35
+ "kg_fit": 0.0038651464563374876,
36
+ "kg_F3": 0.005,
37
+ "torque_gain_ratio": 0.7730292912674975,
38
+ "in_family": {
39
+ "mp": "in",
40
+ "Lp": "in",
41
+ "Dr": "OUT (below family [0.0003, 0.0025])",
42
+ "Dp": "in",
43
+ "Cr": "in",
44
+ "Cp": "in"
45
+ },
46
+ "dp_cliff": "Dp=1.36e-04 is BELOW the ~3e-4 feasibility cliff"
47
+ }
hardware/qube/sysid/data2/fit/fit_decay2.log ADDED
@@ -0,0 +1,46 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "mp": 0.024,
3
+ "notes": [
4
+ "arm moved 28.5 deg during decay: Dp/Cp biased by reaction; rerun with the arm braced",
5
+ "total arm viscous damping 5.51e-11 is below F3's built-in back-emf damping 2.10e-04: F3-convention Dr<0 (clip to 0 / lowest family value); the F3 voltage->torque gain is too high for this rig"
6
+ ],
7
+ "Lp": 0.15990182911416354,
8
+ "Dp": 0.00038345562245623423,
9
+ "Cp": 0.00016145367113711646,
10
+ "se": {
11
+ "Lp": 0.00011198624295546966,
12
+ "Dp": 5.16626718899331e-05,
13
+ "Cp": 7.169285934313373e-05,
14
+ "Dr": 3.6216825595963158e-06,
15
+ "Cr": 8.92459409935057e-05,
16
+ "cable_spring": 0.0005920327336051388,
17
+ "Jr": 8.011214568161966e-06,
18
+ "kg": 0.000136713087892445
19
+ },
20
+ "current": {
21
+ "Rm": 9.976481671982123,
22
+ "Rm_se": 0.0024028887201924106,
23
+ "km": 0.04485993439981537,
24
+ "km_se": 0.00026314783219503416
25
+ },
26
+ "Db_total_arm_viscous": 5.505884166630603e-11,
27
+ "Dr": -0.00020999994494115835,
28
+ "Cr": 0.0009224512607516701,
29
+ "cable_spring": 0.0067334300860712034,
30
+ "Jr_fit": 0.00011385137160581356,
31
+ "theta0": 0.5962790967321322,
32
+ "V_break": 0.19064418813537246,
33
+ "Jr_F3": 0.0002327916666666667,
34
+ "kg_fit": 0.004838601531858168,
35
+ "kg_F3": 0.005,
36
+ "torque_gain_ratio": 0.9677203063716336,
37
+ "in_family": {
38
+ "mp": "in",
39
+ "Lp": "in",
40
+ "Dr": "OUT (below family [0.0003, 0.0025])",
41
+ "Dp": "in",
42
+ "Cr": "in",
43
+ "Cp": "in"
44
+ },
45
+ "dp_cliff": "Dp=3.83e-04 is ABOVE the ~3e-4 feasibility cliff: swing-up on 10 V likely infeasible, deploy will return ok=False"
46
+ }
models/armprov/armprov_s6000.pth ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:8c23195488c6d01b63d22a2b4ccd1a5026c572a56cc7636da1bbb09a57bd74bc
3
+ size 45093287
models/f3/f3_s0_s24000.pth ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:c57a7cf9b53217b94691dfbc0dc79ca07af476ea8e8744af905cd51e0ae78421
3
+ size 45092512
models/f3/f3_s1_s24000.pth ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:36786daad4e71e593c882b5b595a0f1c7d795498de54a67f0807f6a9b6edf19e
3
+ size 45092512
models/f3/f3_s2_s24000.pth ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:3f190b4b8e841a7eb364eb0006b8530e2817d742b477f8a21fdf4ce5d104e96c
3
+ size 45092512
models/mhx/m2n8000_diff_s3.pth ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:4ed6eb6a5e8adfc1f491f45caf7167c1ae1f4724073e4eaddcc970f447db081a
3
+ size 46015455
models/mhx/m2n8000_diff_s4.pth ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:ae4700cdc05caede56fc838aeb57903b0c84aa1d20336639ed329ad13334917a
3
+ size 46015455
models/mhx/m2n8000_reg_s3.pth ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:6d5379a84a17286198580be98a79a1a471f9a24980766378d22b5edd9688ea73
3
+ size 46015281
models/mhx/m2n8000_reg_s4.pth ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:80de25b00826f34a4501a178ebfecf59a8c626e079d17d67710cac695571edec
3
+ size 46015281
models/mhx/m3n8000_cvae_L2_b0.0001_s0.pth ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:da1e2f83d252f948e93ef3081831fef380718b13a8cc3e8d332b68a09c20dae4
3
+ size 61571793
models/mhx/m3n8000_cvae_L2_b0.0003_s0.pth ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:0b65a7ae1234c7089c740f5138b65cd71722273d490f02db665d286559bae6fe
3
+ size 61571793
models/mhx/m3n8000_cvae_L2_b0.001_s0.pth ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:2e2519e3cb5429639e8a5c54876a79420245cea2ba886d50542698ef8ef85ea4
3
+ size 61571563