robotic 0.2.5.dev3__cp39-cp39-manylinux2014_x86_64.whl → 0.2.7__cp39-cp39-manylinux2014_x86_64.whl
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Potentially problematic release.
This version of robotic might be problematic. Click here for more details.
- robotic/__init__.py +2 -0
- robotic/_robotic.pyi +59 -24
- robotic/_robotic.so +0 -0
- robotic/include/rai/Control/CtrlTargets.h +3 -3
- robotic/include/rai/Core/array.h +3 -3
- robotic/include/rai/Core/arrayDouble.h +0 -3
- robotic/include/rai/DataGen/rndStableConfigs.h +0 -1
- robotic/include/rai/Geo/mesh.h +1 -1
- robotic/include/rai/Geo/signedDistanceFunctions.h +1 -1
- robotic/include/rai/Gui/RenderData.h +3 -2
- robotic/include/rai/KOMO/komo.h +1 -0
- robotic/include/rai/KOMO/manipTools.h +12 -10
- robotic/include/rai/KOMO/{opt-benchmarks.h → testProblems_KOMO.h} +36 -0
- robotic/include/rai/Kin/F_geometrics.h +9 -0
- robotic/include/rai/Kin/featureSymbols.h +6 -1
- robotic/include/rai/Kin/frame.h +1 -1
- robotic/include/rai/Kin/kin.h +1 -0
- robotic/include/rai/Kin/simulation.h +1 -0
- robotic/include/rai/Kin/viewer.h +1 -1
- robotic/include/rai/LGP/LGP_Tool.h +6 -6
- robotic/include/rai/Optim/NLP_Sampler.h +4 -4
- robotic/include/rai/Optim/NLP_Solver.h +1 -0
- robotic/include/rai/Optim/SlackGaussNewton.h +54 -0
- robotic/include/rai/Optim/gradient.h +2 -2
- robotic/include/rai/Optim/opt-ipopt.h +1 -1
- robotic/include/rai/Optim/options.h +8 -7
- robotic/include/rai/Optim/{benchmarks.h → testProblems_Opt.h} +33 -16
- robotic/librai.so +0 -0
- robotic/manipulation.py +88 -111
- robotic/meshTool +0 -0
- robotic/rai-robotModels/panda/panda.g +3 -2
- robotic/rai-robotModels/scenarios/ballFinger.g +3 -3
- robotic/rai-robotModels/scenarios/mobilePanda.g +3 -0
- robotic/rai-robotModels/scenarios/pendulum.g +3 -2
- robotic/rai-robotModels/tests/arm.g +7 -7
- robotic/ry-h5info.py +28 -0
- robotic/version.py +1 -1
- {robotic-0.2.5.dev3.dist-info → robotic-0.2.7.dist-info}/METADATA +1 -1
- {robotic-0.2.5.dev3.dist-info → robotic-0.2.7.dist-info}/RECORD +50 -54
- robotic/include/rai/MCTS/env_robert.h +0 -106
- robotic/include/rai/MCTS/problem_BlindBranch.h +0 -47
- robotic/include/rai/MCTS/solver_AStar.h +0 -90
- robotic/include/rai/MCTS/solver_MBTS.h +0 -109
- robotic/include/rai/MCTS/solver_PlainMC.h +0 -58
- robotic/include/rai/MCTS/solver_marc.h +0 -63
- /robotic/include/rai/Geo/{geoOptim.h → testProblems_Geo.h} +0 -0
- {robotic-0.2.5.dev3.data → robotic-0.2.7.data}/scripts/ry-bot +0 -0
- {robotic-0.2.5.dev3.data → robotic-0.2.7.data}/scripts/ry-info +0 -0
- {robotic-0.2.5.dev3.data → robotic-0.2.7.data}/scripts/ry-meshTool +0 -0
- {robotic-0.2.5.dev3.data → robotic-0.2.7.data}/scripts/ry-test +0 -0
- {robotic-0.2.5.dev3.data → robotic-0.2.7.data}/scripts/ry-urdf2rai +0 -0
- {robotic-0.2.5.dev3.data → robotic-0.2.7.data}/scripts/ry-urdf2yaml +0 -0
- {robotic-0.2.5.dev3.data → robotic-0.2.7.data}/scripts/ry-view +0 -0
- {robotic-0.2.5.dev3.dist-info → robotic-0.2.7.dist-info}/LICENSE +0 -0
- {robotic-0.2.5.dev3.dist-info → robotic-0.2.7.dist-info}/WHEEL +0 -0
- {robotic-0.2.5.dev3.dist-info → robotic-0.2.7.dist-info}/top_level.txt +0 -0
|
@@ -1,13 +1,14 @@
|
|
|
1
1
|
robotic/DataGen.pyi,sha256=2IncN1yBCB_YgCzBoL8MoonOlMMMxENny_hqbJNmlTw,3051
|
|
2
|
-
robotic/__init__.py,sha256=
|
|
3
|
-
robotic/_robotic.pyi,sha256=
|
|
4
|
-
robotic/_robotic.so,sha256=
|
|
5
|
-
robotic/librai.so,sha256=
|
|
6
|
-
robotic/manipulation.py,sha256=
|
|
7
|
-
robotic/meshTool,sha256=
|
|
2
|
+
robotic/__init__.py,sha256=k-hVqPB7vN-huwpRzQLt3f--6sNdjaCQ_hWw66dWkA8,297
|
|
3
|
+
robotic/_robotic.pyi,sha256=1y2Z5sHqRAcKFtH9cAN7OH6iHZeeF8VSvskQEy31rzg,70731
|
|
4
|
+
robotic/_robotic.so,sha256=UBxUj1vrJ3Ts0hxdFw1gumTn1JkhRPKG8c5P9jHES8g,1165024
|
|
5
|
+
robotic/librai.so,sha256=TmuLoBZ0kkhWNS-sNbVVp2MmZ71JuMX5PQadyWxOy3E,40126344
|
|
6
|
+
robotic/manipulation.py,sha256=UgH3Fy2FjuCL3ip0s1q--JzqlBLU74eRiOWMOnCM-Ys,22355
|
|
7
|
+
robotic/meshTool,sha256=2SpKcToxKHD8M6me_GRWu9vi1G4jauEOZSgZWWwisug,43928
|
|
8
8
|
robotic/nlp.py,sha256=n9_hOj3i707DdL_r49Yd2eWyjsSOahW8DmJrEhQlNFw,3200
|
|
9
9
|
robotic/render.py,sha256=OE1dvyWHD7Oyzk4wlhXZ7m3v3xxa3zAL5_LCV1RgJXk,4662
|
|
10
10
|
robotic/ry-bot,sha256=nd2yWqaDsFbwAmr7ySdOjq06ek0E1FMHTxPRO-7e2Q8,2294
|
|
11
|
+
robotic/ry-h5info.py,sha256=YrkBvLAadxAgTmx0hlcm9h_KXy-KaNV_zp4raSXXdYY,620
|
|
11
12
|
robotic/ry-info,sha256=GRj4oMCgTCGRF2wxtYxiFvETROB92rwwtUFb6S_Eo7g,439
|
|
12
13
|
robotic/ry-meshTool,sha256=h4f4wFPNaey3ziz870SrEvy6SsQSL-ZnR_cH3UuAZxE,101
|
|
13
14
|
robotic/ry-test,sha256=JZJ_h4NxLkkkrcV9IYdXzYHn9eEZDPFPBAzo1jIv278,976
|
|
@@ -15,7 +16,7 @@ robotic/ry-urdf2rai,sha256=88CFu5ikKsjy4wQixvCZqtNOqCheBiT18cjZfOsJA8A,7736
|
|
|
15
16
|
robotic/ry-urdf2yaml,sha256=D36MR8Ui6Ry9V0TqJOBaPCWC89OZa43Fytz4P7Y4v0w,8543
|
|
16
17
|
robotic/ry-view,sha256=T1Omn1QS7cNAtjQhBjMJTNz7aW5FgoOf9vBIfW0mFME,613
|
|
17
18
|
robotic/test.pyi,sha256=vVxwRSerjUG4bpB7pIhof7ZatrBqwg3Bj5voywa-YTI,917
|
|
18
|
-
robotic/version.py,sha256=
|
|
19
|
+
robotic/version.py,sha256=e3cfQy_iVs9ILsymUalJnJu5D_dd7HuUVoVwKKurcL0,22
|
|
19
20
|
robotic/include/rai/Algo/MLcourse.h,sha256=TGkAJWC5ollGfPw0-gcYL0TZeDJiHtWFzkHSMK8_lqU,1828
|
|
20
21
|
robotic/include/rai/Algo/RidgeRegression.h,sha256=VXiv6-xr3j--CN7DJTzUg9Xb49zV9FZ9dwzxP1CmcPM,3730
|
|
21
22
|
robotic/include/rai/Algo/SplineCtrlFeed.h,sha256=9ZtYLHXx9sExj0lZV6F5ZWaCtkm0R4hMiYb-KJjktnc,3339
|
|
@@ -35,7 +36,7 @@ robotic/include/rai/Control/CtrlObjective.h,sha256=fC-6cS0X0RR_7ooFm1xnAXlN2mgyF
|
|
|
35
36
|
robotic/include/rai/Control/CtrlSet.h,sha256=o7u8N9ZSoMbiDR3TGKDjfIarIP1JAw0SHMFL18t1fv0,1404
|
|
36
37
|
robotic/include/rai/Control/CtrlSolver.h,sha256=79BZgnFMvPwM1cAWoyIcRCGYLLF21ky_LLBass3wnUQ,1095
|
|
37
38
|
robotic/include/rai/Control/CtrlSolvers.h,sha256=gxr_aTn-dyV1J6HxDSX8SVrqIPm14oxOkXx5-OGfamo,3094
|
|
38
|
-
robotic/include/rai/Control/CtrlTargets.h,sha256=
|
|
39
|
+
robotic/include/rai/Control/CtrlTargets.h,sha256=FRjAi9KwDL2-5ziKYP5g_-uR234SdPw70TNZbYn3QVg,5475
|
|
39
40
|
robotic/include/rai/Control/RTControllerSimulation.h,sha256=iDpVRfivTlGS7DVWxVrS-xzCdVWrag1pUHsczZEb0po,1254
|
|
40
41
|
robotic/include/rai/Control/SecMPC.h,sha256=VpQBxibL9jI6bG31sm4U95vfJlYJDJxIqBDahppixN8,1916
|
|
41
42
|
robotic/include/rai/Control/ShortPathMPC.h,sha256=bZQ9I7fklqPOk-PwCTvi3xgnLVdVBoJ2j5i1iWwNxfE,938
|
|
@@ -44,9 +45,9 @@ robotic/include/rai/Control/WaypointMPC.h,sha256=Pa36-K1yMxszD9EFuLfLayaOe9pTK8c
|
|
|
44
45
|
robotic/include/rai/Control/control.h,sha256=_dJefR6WzvdQMaJIYIBuYP8NwoKgNeG4owhQWPxWXzo,765
|
|
45
46
|
robotic/include/rai/Control/ctrlMsg.h,sha256=uGuwAaKM1UsQW3hTNv4AihW99MJMuow4cxa9-AU9AmA,1121
|
|
46
47
|
robotic/include/rai/Control/timingOpt.h,sha256=Ne_IH8QuFCID0Sy88LS5i3qkp1nL1FbIgREqSjRctz0,2045
|
|
47
|
-
robotic/include/rai/Core/array.h,sha256=
|
|
48
|
+
robotic/include/rai/Core/array.h,sha256=YYdSaiZ0o7RoC_Zv6S1oGWMuFBdSrOWIIt-6KuaiO0Q,25290
|
|
48
49
|
robotic/include/rai/Core/array.ipp,sha256=hdyULakmWOdt6Gi_-4338uzkWbrkw2_eCh-H3nXFwuo,58314
|
|
49
|
-
robotic/include/rai/Core/arrayDouble.h,sha256=
|
|
50
|
+
robotic/include/rai/Core/arrayDouble.h,sha256=ACvesIGz_0UP3G-x7-LlfGzodKB7EVsGeX5z2RbMFx8,28869
|
|
50
51
|
robotic/include/rai/Core/defines.h,sha256=hBTgf5EiJ50rQYW1saGw8Ox87aKVFOYVKnFw0jojVW0,6894
|
|
51
52
|
robotic/include/rai/Core/graph.h,sha256=Eo0j8q8IbY_M7V2FwzKAi9E8makxgRBvrFcPfJKuCtE,20890
|
|
52
53
|
robotic/include/rai/Core/h5.h,sha256=3dlhKBfrWpfZEhvhz9ceFe5ewF4LXAK4ykq-Yk4s9Ro,1026
|
|
@@ -57,18 +58,18 @@ robotic/include/rai/Core/lapack/blaswrap.h,sha256=jl8W6GwBGMiU-ND9ILeKqWlIvryw7A
|
|
|
57
58
|
robotic/include/rai/Core/lapack/cblas.h,sha256=4bSmMzZ4idIPlmcwjw5HuwY1cs5RU73ZwmfydSpaBdk,32367
|
|
58
59
|
robotic/include/rai/Core/lapack/clapack.h,sha256=8rLteHzzGpKhJZXv4Eom9mk8lzbwRwjJuIqJuR1eePc,343373
|
|
59
60
|
robotic/include/rai/Core/lapack/lapacke.h,sha256=cpP6MEjkLGyhS8mV6ysRlTVeUam6f8zBgFUJB1phuwM,1045408
|
|
60
|
-
robotic/include/rai/DataGen/rndStableConfigs.h,sha256=
|
|
61
|
+
robotic/include/rai/DataGen/rndStableConfigs.h,sha256=bIz2RovkruMjYaaDwJIkyevsF6oV16y7dhyKm6sp_6s,391
|
|
61
62
|
robotic/include/rai/DataGen/shapenetGrasps.h,sha256=NXOnjUhE-KpCHDQq7BFvwYgq8QYdQ2imtZ-kanypoPA,1411
|
|
62
63
|
robotic/include/rai/Geo/assimpInterface.h,sha256=bTLjLN7_6unykJ-erIxyyb2RZtmcFxkygUws8N5MlNI,1039
|
|
63
64
|
robotic/include/rai/Geo/depth2PointCloud.h,sha256=0mXJnTk0sMB--KDE9CO_2gKgGw4gHXUe7xg6DcROhvk,1168
|
|
64
65
|
robotic/include/rai/Geo/fclInterface.h,sha256=iNdxNc_DSOgYCLyCajxP8lxdnrNcyoKQmjUlVmjxjQM,940
|
|
65
66
|
robotic/include/rai/Geo/geo.h,sha256=_Ahf2k5-2iyzhQMf_MGsqJ40L5kZFaPv-fsrWYrHWys,14545
|
|
66
|
-
robotic/include/rai/Geo/
|
|
67
|
-
robotic/include/rai/Geo/mesh.h,sha256=7-k8MyfG5l2zccL0IwqcKJ6UeT6caGwYjNePqgTtOCs,6574
|
|
67
|
+
robotic/include/rai/Geo/mesh.h,sha256=OP7owWT7B_EUXq5Pji2qJA4W0e1xO8z17622c8nW6QQ,6575
|
|
68
68
|
robotic/include/rai/Geo/pairCollision.h,sha256=kFEtQpkgPV_VKJ6YBDBKdb3ko62_s7HKDUti0kB2yYI,4374
|
|
69
69
|
robotic/include/rai/Geo/qhull.h,sha256=dRAAHIdvujPPW1fXW4hXMjgixpBDajDg-y_OX1JMi_0,1890
|
|
70
|
-
robotic/include/rai/Geo/signedDistanceFunctions.h,sha256=
|
|
70
|
+
robotic/include/rai/Geo/signedDistanceFunctions.h,sha256=hrC838CsYWQ6TXm536iNRwB8W5-62LNb-JPqPoDAFPE,4831
|
|
71
71
|
robotic/include/rai/Geo/stb_image.h,sha256=WnfQN6Iosji-LSuiVLoekjaY6NVnuy7XJnlkRTVR3KA,251786
|
|
72
|
+
robotic/include/rai/Geo/testProblems_Geo.h,sha256=PAO_y2X6KFjbfpCBoy59GkVq_A82ovg-stLO3EJ7iuE,927
|
|
72
73
|
robotic/include/rai/Geo/GJK/gjk.h,sha256=L4vvyYX7RYQLt8003G3ReMRhFu8MWsJZckeI-d7hzLc,15006
|
|
73
74
|
robotic/include/rai/Geo/Lewiner/LookUpTable.h,sha256=0MRA9ioCeKoMhXYqtxaOPHTMwR_GkmyDFx2mgpSvs9s,158933
|
|
74
75
|
robotic/include/rai/Geo/Lewiner/MarchingCubes.h,sha256=xKff8BtMBeRHK26CSxl0Gn8aRVAYXEdD7nTpjL3DRYc,13528
|
|
@@ -85,25 +86,25 @@ robotic/include/rai/Geo/ccd_rai/support.h,sha256=B9KBuOctG7Hx-e1TXpnkU667WVH7SP4
|
|
|
85
86
|
robotic/include/rai/Geo/ccd_rai/vec3.h,sha256=ARkNnQz8yWf_Cs3vgt22zclN1cLeGmwWPTVHVpvmfEA,8115
|
|
86
87
|
robotic/include/rai/Geo/ply/ply.h,sha256=_oAXgQ5CyHvUMtPDBxYtOBbnKDVoZf5PKMswisqvOeI,9384
|
|
87
88
|
robotic/include/rai/Geo/vhacd/VHACD.h,sha256=QT_cT6PPzec_mxKODsS9cJGr6nBt6S8cUJF7dCeBQCc,258343
|
|
88
|
-
robotic/include/rai/Gui/RenderData.h,sha256=
|
|
89
|
+
robotic/include/rai/Gui/RenderData.h,sha256=uQWRwAAh7eN8RjGR0cVkcKGL00oRRzsy_o0-qr2GiEU,4606
|
|
89
90
|
robotic/include/rai/Gui/color.h,sha256=4ElBkpWgwBuqQEFD4Mdhv_afZE4ul6NkptwFQ2oDS5o,2596
|
|
90
91
|
robotic/include/rai/Gui/opengl.h,sha256=sRvOz-QGHwgrf11UiQV4At4G2FjClveTTJorXyer1Fw,9036
|
|
91
92
|
robotic/include/rai/Gui/plot.h,sha256=xhTBY84UN4KpgZsX7SJQGqVKd1jU7jojGVKFv02v0xU,2341
|
|
92
93
|
robotic/include/rai/KOMO/PathSmoother.h,sha256=y-t3yVEZvxfQIs8_EA-WI7FJ_RzfbG8TEfdiNAruuUI,813
|
|
93
|
-
robotic/include/rai/KOMO/komo.h,sha256=
|
|
94
|
+
robotic/include/rai/KOMO/komo.h,sha256=SHyG2X0F0RVAxUlRhaYBVKzccwru9m6pQfvXuh9bEB0,13008
|
|
94
95
|
robotic/include/rai/KOMO/komo_NLP.h,sha256=kSzUMDmw4yzAXtpNB2v38dpw2tBS8n8R_op_T3yS3DQ,3681
|
|
95
|
-
robotic/include/rai/KOMO/manipTools.h,sha256=
|
|
96
|
+
robotic/include/rai/KOMO/manipTools.h,sha256=CoIL9ElNFHAV-AU95wUtSgDWH9ceNx6WmGVTP8DZvaw,4173
|
|
96
97
|
robotic/include/rai/KOMO/objective.h,sha256=Cl4-KjheRMNWoh_xFas5tLWMKSMlJf-HLDihfqvfcSw,2704
|
|
97
|
-
robotic/include/rai/KOMO/opt-benchmarks.h,sha256=TxLNFTdNzY6C14CEXca7o6udxvwAXNsDLJgZ7qUheaU,1401
|
|
98
98
|
robotic/include/rai/KOMO/pathTools.h,sha256=w0Wq6BGLBxG1LAZQBDmmPWTXzwxW3RHj2EX1cm92WeE,3288
|
|
99
99
|
robotic/include/rai/KOMO/skeleton.h,sha256=NPaMfUMC_sUd3AjlLHTFpxWH4QtnKP_zzvHb2YvEigI,4437
|
|
100
100
|
robotic/include/rai/KOMO/skeletonSymbol.h,sha256=mrPqRn_1i4PuqbkQBhKEYc5WPEGqPjBN6TvwZxZ5e7A,1261
|
|
101
101
|
robotic/include/rai/KOMO/splined.h,sha256=G_fu9gXCboJLkwhwu77F6F3Ei6deqzbvkgP8r9kiNL8,903
|
|
102
102
|
robotic/include/rai/KOMO/switch.h,sha256=teNNnHFe4h9W5rLlL3TFBsq97ni-RUEhcxw4uVPYR1g,1850
|
|
103
|
+
robotic/include/rai/KOMO/testProblems_KOMO.h,sha256=rlVH4U8PeaSLl6hrDApQQnSd4JR5SA-FrA4jETTu9CU,2453
|
|
103
104
|
robotic/include/rai/Kin/F_LeapCost.h,sha256=wNAUNgAJjLirMurF67BlFLHtjyuXy1EPr--9XLBe6Wk,556
|
|
104
105
|
robotic/include/rai/Kin/F_collisions.h,sha256=pWjq-0jR-i814KquLndMHyFjkLWio7dtqgfDEKIlMq8,1814
|
|
105
106
|
robotic/include/rai/Kin/F_forces.h,sha256=7qFg_5JZSxaq8GpjHrGojLWPrHOO1cxOhRGcc27oVks,6315
|
|
106
|
-
robotic/include/rai/Kin/F_geometrics.h,sha256=
|
|
107
|
+
robotic/include/rai/Kin/F_geometrics.h,sha256=2yPFycgcmZjXLezxoRL_aaetrZusDgtGyx7GQbfbRrI,2146
|
|
107
108
|
robotic/include/rai/Kin/F_operators.h,sha256=Nxdk1dPSoN7lW0A5Ns-BSJ_YXFft4iZi9RDOmVn3BJ0,1608
|
|
108
109
|
robotic/include/rai/Kin/F_pose.h,sha256=37Atdsxnb1CdnIFcRUjkBqEQRNRWkC2p6BpTrrMBfvI,5166
|
|
109
110
|
robotic/include/rai/Kin/F_qFeatures.h,sha256=x4cfFGaVBQSmj9ZetcC25qiGxnvfNMPsWh9zbPa5owE,2212
|
|
@@ -113,18 +114,18 @@ robotic/include/rai/Kin/dof_forceExchange.h,sha256=Apf95urslSgX0PZmU-u-u6goxWWtw
|
|
|
113
114
|
robotic/include/rai/Kin/dof_particles.h,sha256=PboLndC5a5extUKAfUPAIsJEGTTs6_ACDgnLrei2s8g,790
|
|
114
115
|
robotic/include/rai/Kin/dof_path.h,sha256=0vHnPER8XnrCufXF27hCWd8Nq9_J31MNoksNLhZvv2g,812
|
|
115
116
|
robotic/include/rai/Kin/feature.h,sha256=xicsrElMcYnYXdIXdO5LBLmXxvCGVUVgZJY2NIarO5I,3935
|
|
116
|
-
robotic/include/rai/Kin/featureSymbols.h,sha256=
|
|
117
|
-
robotic/include/rai/Kin/frame.h,sha256=
|
|
118
|
-
robotic/include/rai/Kin/kin.h,sha256=
|
|
117
|
+
robotic/include/rai/Kin/featureSymbols.h,sha256=JVXbXoW43PlEGOgwHPpULlbXUQzkl79F1EFnfl-0wyk,1984
|
|
118
|
+
robotic/include/rai/Kin/frame.h,sha256=KgNJBbfkaeNd-CfKnRmT5pxyDaaFzGk_ikhh4ySsSe8,14225
|
|
119
|
+
robotic/include/rai/Kin/kin.h,sha256=hhjYI9RF55PjgJvdXhV4omyQK1iRG6MTi8B_GG9yYqM,15594
|
|
119
120
|
robotic/include/rai/Kin/kin_bullet.h,sha256=y8aApXpXY4bD5QN_WmDAU2vNEvvbdo1Rd4zY7qo-FKE,1970
|
|
120
121
|
robotic/include/rai/Kin/kin_feather.h,sha256=o-hOJA8UcmIBKx_qPzoG9R7fxzz-4zhBNMBmBTK21oA,1627
|
|
121
122
|
robotic/include/rai/Kin/kin_ode.h,sha256=zwB8Le1WMGRkQBc9bssndJICkjO1lZ_y1aZKCwP4c1Y,3686
|
|
122
123
|
robotic/include/rai/Kin/kin_physx.h,sha256=EdZdS5feDjvhSuUWy_gdnSgdsh6iGBOVev0r8JtZDIY,1967
|
|
123
124
|
robotic/include/rai/Kin/proxy.h,sha256=jfFQrvokqvt8bGYEzGQoD2ZpnuWuLzCeOjFfUvdxcx0,1473
|
|
124
|
-
robotic/include/rai/Kin/simulation.h,sha256=
|
|
125
|
-
robotic/include/rai/Kin/viewer.h,sha256=
|
|
125
|
+
robotic/include/rai/Kin/simulation.h,sha256=ImOsxqc1l9ygiJIAPhoHQPOyqZEVccyJvu1jFREwFaU,5132
|
|
126
|
+
robotic/include/rai/Kin/viewer.h,sha256=jpP9MltococoD9hYS5GvJ99y-u75M4qVNX59rrwxVtQ,2071
|
|
126
127
|
robotic/include/rai/LGP/LGP_SkeletonTool.h,sha256=T4lXAUxY2QFo_ETZEm7RqRzfmU6NAHdVcow8qj_8-9Y,3240
|
|
127
|
-
robotic/include/rai/LGP/LGP_Tool.h,sha256=
|
|
128
|
+
robotic/include/rai/LGP/LGP_Tool.h,sha256=vcQ3ixwJ4wepPDX8ZGkDBKGIpchJQWMOoMu82_cS_8I,4230
|
|
128
129
|
robotic/include/rai/LGP/LGP_computers.h,sha256=paoCbDZnIo7OUeHKo5qkzTkKy1RIzDZocg4p6SXoObk,6480
|
|
129
130
|
robotic/include/rai/LGP/LGP_node.h,sha256=gMNQLfkbdMR1C-sNufI3K23Qt_Su3tqfIWz46Ta0JNo,4100
|
|
130
131
|
robotic/include/rai/LGP/LGP_tree.h,sha256=J6W4Qypr70g0EZg30tTZBuca_6_O0sDQAGGv6Ow8oaE,4001
|
|
@@ -133,29 +134,24 @@ robotic/include/rai/LGP/initFol.h,sha256=m67VqzKUQzMN0kBFL0lWACu0ls7eYj8ExyXVFju
|
|
|
133
134
|
robotic/include/rai/Logic/fol.h,sha256=ubWsZacmrRPGeDPKQVGKDoGC_4GxYGdVLJ0K3a3eZu0,3598
|
|
134
135
|
robotic/include/rai/Logic/folWorld.h,sha256=8tocnoOMORvfo23tsDBCD69KfrpbL467PAcCHnVVqkw,6063
|
|
135
136
|
robotic/include/rai/Logic/treeSearchDomain.h,sha256=sO5Y6o9wRTQxfST9YyJw3P0KcqGX7ISqbIN-uGQ5abU,3882
|
|
136
|
-
robotic/include/rai/MCTS/env_robert.h,sha256=VHqSahXnGCdwa1o-CZp1Q_V1EF5Ig7oy9oXBz7eJfMM,3990
|
|
137
|
-
robotic/include/rai/MCTS/problem_BlindBranch.h,sha256=GfrNZNz2tRHREJDgxSBgniY2GwweSGrbh17Xsl3qpc8,1446
|
|
138
|
-
robotic/include/rai/MCTS/solver_AStar.h,sha256=4PoJoLWGjh_jObNEHGloKA9G7iB1EK0ReWdjPXOUAkA,2792
|
|
139
|
-
robotic/include/rai/MCTS/solver_MBTS.h,sha256=vMZets4nMmopxtV8PcD__fq-UuMsx7LxVptodhVfDP8,3134
|
|
140
|
-
robotic/include/rai/MCTS/solver_PlainMC.h,sha256=8BPgycISlQj0BBcgGsP_aFl0dIL7qdEJcx6uXyS_YPQ,1955
|
|
141
|
-
robotic/include/rai/MCTS/solver_marc.h,sha256=lo4JpO7i0juvf1t8anw6ISRDerFbHADuU62k0KXDotk,2484
|
|
142
137
|
robotic/include/rai/Optim/BayesOpt.h,sha256=GqOqGk5Y0USf513duMPtt--TBYGqujdsvY2qi17jVxI,1241
|
|
143
138
|
robotic/include/rai/Optim/GlobalIterativeNewton.h,sha256=WRaTFUrx0A1FO7d7shgZbJVaC5AWKZT5PTD8LnuPXiE,801
|
|
144
139
|
robotic/include/rai/Optim/NLP.h,sha256=rWs2HDuaIQnrz2DZeiCuLjYrENb5mfdUiCcht6dQaus,8195
|
|
145
140
|
robotic/include/rai/Optim/NLP_Factory.h,sha256=xDn73B-u6fFvtu-udkXgyTiFyjTzfJNHwUm6z88FiOo,1979
|
|
146
141
|
robotic/include/rai/Optim/NLP_GraphSolver.h,sha256=VE_3t8l-NThDSGFh7FCGxONNXYatzRbZv1HY9lgXF9s,1162
|
|
147
|
-
robotic/include/rai/Optim/NLP_Sampler.h,sha256=
|
|
148
|
-
robotic/include/rai/Optim/NLP_Solver.h,sha256=
|
|
149
|
-
robotic/include/rai/Optim/
|
|
142
|
+
robotic/include/rai/Optim/NLP_Sampler.h,sha256=JaOEc8YJwatW5toOviTFXlOoF3Dg8ZWPM9zejyW9ND8,4643
|
|
143
|
+
robotic/include/rai/Optim/NLP_Solver.h,sha256=vPdZTjTJAX1mjtjLhtgS4jAc2qKGAaO73fyecfepJ3U,3359
|
|
144
|
+
robotic/include/rai/Optim/SlackGaussNewton.h,sha256=b5w2ti8AqqothZtCFevUNSs1Y5dz4LOLBJXZQvoKNmU,1338
|
|
150
145
|
robotic/include/rai/Optim/constrained.h,sha256=62pWGQMt3TK_KvbaAuEpahcNv0cHadoYyEGmrEpN4QE,1446
|
|
151
|
-
robotic/include/rai/Optim/gradient.h,sha256=
|
|
146
|
+
robotic/include/rai/Optim/gradient.h,sha256=dtpGXdKffzufV3qxOmsp6u9u73pjRUXF0RoD3VbhtyI,1837
|
|
152
147
|
robotic/include/rai/Optim/lagrangian.h,sha256=aG5MJvaZxGeE_Bfufjq4yJbAQZN62j__58WhuMkBHzQ,2377
|
|
153
148
|
robotic/include/rai/Optim/newton.h,sha256=3CLZn80ZOUQfdN3R3qkDVuOke9Tp5fDeRm9p932c2Xk,1150
|
|
154
149
|
robotic/include/rai/Optim/opt-ceres.h,sha256=bB-k-tlIDAh6g0_6Tue8Lc_Tnxol76kIssS_5GQeMVI,960
|
|
155
|
-
robotic/include/rai/Optim/opt-ipopt.h,sha256=
|
|
150
|
+
robotic/include/rai/Optim/opt-ipopt.h,sha256=1v147tZVY3MuNMRLaFFWxKC7fyNP5-59WJzKoVv8BsY,516
|
|
156
151
|
robotic/include/rai/Optim/opt-nlopt.h,sha256=R0ma9SjxcVU9nI7H39QOWUIPy95H4AiQwLRHz3DRe7k,970
|
|
157
|
-
robotic/include/rai/Optim/options.h,sha256=
|
|
152
|
+
robotic/include/rai/Optim/options.h,sha256=YXgBVLacCkJ59fui2gJnYXhjlqNpDS8xcduusXiDnqE,1817
|
|
158
153
|
robotic/include/rai/Optim/primalDual.h,sha256=BNotLDK43sveJ274eNojO_p14d2Fgqes4XEwXnFuJ30,1267
|
|
154
|
+
robotic/include/rai/Optim/testProblems_Opt.h,sha256=GBzuiO5lI3tSh9sHzhQuf5bElr3eejFbYHWAXYiUAdg,6532
|
|
159
155
|
robotic/include/rai/Optim/utils.h,sha256=lZcBjPtYl0JDY-DfjYOlOBBR-nRqu67XgYPF6nxfspU,3515
|
|
160
156
|
robotic/include/rai/PathAlgos/ConfigurationProblem.h,sha256=xNtvq0sK9sTtpWd_c8X6yzoYmFkACOvv_9VIRbG6R8s,1311
|
|
161
157
|
robotic/include/rai/PathAlgos/PathResult.h,sha256=xxZiD8ClGKO719mQR50BsIzOlHeoH0UH4QNzWifoz6c,1070
|
|
@@ -281,7 +277,7 @@ robotic/rai-robotModels/g1/meshes/waist_yaw_link.ply,sha256=fq4SIjvn8NkNqg661F_J
|
|
|
281
277
|
robotic/rai-robotModels/objects/kitchen.g,sha256=PLi7un2u3I29Mcngc08-9J3ocTU_c5TYlXplYXTgQHU,1223
|
|
282
278
|
robotic/rai-robotModels/objects/shelf.g,sha256=9_CH-LPhcvShNxmqOueMckNK70uWeRdkSFfanvp4z-w,817
|
|
283
279
|
robotic/rai-robotModels/objects/tables.g,sha256=z9GifBjAaCbu3Y2ISmzhVyU9_mw2NlR87eAyj0vNYnI,455
|
|
284
|
-
robotic/rai-robotModels/panda/panda.g,sha256=
|
|
280
|
+
robotic/rai-robotModels/panda/panda.g,sha256=AKF2C2mQ8KNUcU4QJQY6Zb_cXnT4LI6jlB2baYOrxs8,2667
|
|
285
281
|
robotic/rai-robotModels/panda/panda_clean.g,sha256=yqS8MZp38LCy3ZW2JDgXeifeDwu4-ApDYj5kDhfYDL4,3818
|
|
286
282
|
robotic/rai-robotModels/panda/panda_deformable.g,sha256=DvkhnJYSXc1S_GRBM3iJOm6WovKYrsckzAW-rXxLqH8,6037
|
|
287
283
|
robotic/rai-robotModels/panda/panda_gripper.g,sha256=WNEaU06yEJJGOVTsyS4l6ztTsteqgecqTgf1JWqinGI,943
|
|
@@ -360,7 +356,7 @@ robotic/rai-robotModels/robotiq/meshes/visual/robotiq_arg2f_85_outer_knuckle.ply
|
|
|
360
356
|
robotic/rai-robotModels/robotiq/meshes/visual/robotiq_arg2f_85_pad.ply,sha256=SjbdAIaUjNlUX7okwcDJWwfd0NaT6fazQwerbevKlbI,464
|
|
361
357
|
robotic/rai-robotModels/robotiq/meshes/visual/robotiq_ft300.ply,sha256=0zn76K_SIR85pVNO8hmbnflRsmeFKHCuCykpVTfQf6s,38626
|
|
362
358
|
robotic/rai-robotModels/robotiq/meshes/visual/robotiq_gripper_coupling.ply,sha256=ef10q5MdRRn2wjWPZTc3nrSVW401x9fHgkEdB_bdECA,30421
|
|
363
|
-
robotic/rai-robotModels/scenarios/ballFinger.g,sha256=
|
|
359
|
+
robotic/rai-robotModels/scenarios/ballFinger.g,sha256=BALhO2h83-r6AIoTy3LS-blB43MNibrKyl7JuN7xqho,456
|
|
364
360
|
robotic/rai-robotModels/scenarios/climber.g,sha256=fUbSlFq_PVev2AxqLgytyfud6NUxvyO5NSon9wXSOJo,2016
|
|
365
361
|
robotic/rai-robotModels/scenarios/climber2.g,sha256=xYGBfNgcLfPfI6WOxOOFpGCVkusoH7gVECEGj2bwc-4,2349
|
|
366
362
|
robotic/rai-robotModels/scenarios/gripper.g,sha256=-yvc-cxVMxz7OmqVzhg6dyh21hBk9hD9wo5Uc2c4roY,447
|
|
@@ -369,7 +365,7 @@ robotic/rai-robotModels/scenarios/k00.g,sha256=Bjei9rYaLLwOhOSHFjaDGc7LFDraL8sxQ
|
|
|
369
365
|
robotic/rai-robotModels/scenarios/kswing.g,sha256=k1bND_Hr-lE5sklOraw58HdUye6iW8jTdjBUwbyRCRM,3995
|
|
370
366
|
robotic/rai-robotModels/scenarios/liftRing.g,sha256=fRKPEfUH_kDL4r7PmpO0kB2t1KeLV9QypxEEN_BNrqQ,1349
|
|
371
367
|
robotic/rai-robotModels/scenarios/mobileMini.g,sha256=I7SE9YUUciZ1JrJG6BIAZ9Oho_eUa_Z76l5_h-B0wjY,1158
|
|
372
|
-
robotic/rai-robotModels/scenarios/mobilePanda.g,sha256=
|
|
368
|
+
robotic/rai-robotModels/scenarios/mobilePanda.g,sha256=AxH1JQJUgwnaLfrojvpP6DO83h_I6Vt3-la10TFpk0Y,608
|
|
373
369
|
robotic/rai-robotModels/scenarios/pandaFloatingGripper.g,sha256=62swwmxuYPd_DWT1ANw5qE-cCxjvSqURX_lAz0rK_jQ,1497
|
|
374
370
|
robotic/rai-robotModels/scenarios/pandaSingle.g,sha256=H_UnXdMUbk16os9StOZB0PZMPL3FaGbCAZy0uUAKEKA,1147
|
|
375
371
|
robotic/rai-robotModels/scenarios/panda_fixGripper.g,sha256=bhkRey6igLb18HlOFj7CpAjqF6R7Z3saxevipHAn4W0,337
|
|
@@ -379,7 +375,7 @@ robotic/rai-robotModels/scenarios/panda_moveGripper.g,sha256=HyyzCAg8ksvqGxjVrAq
|
|
|
379
375
|
robotic/rai-robotModels/scenarios/panda_noGripper.g,sha256=FL5vq3ysYJl7f_y9xOBfSTYuB6btJO22f6g2Z-HU1tw,670
|
|
380
376
|
robotic/rai-robotModels/scenarios/pandasTable-calibrated.g,sha256=Bt6jEu-OUGclBJFBs2Ga2j6qTmP2Nqwecj9k0CH2cNY,467
|
|
381
377
|
robotic/rai-robotModels/scenarios/pandasTable.g,sha256=BhXqZdyujDDnTCbsyHtwabTF6rRKW7WFJztmMhq2grQ,827
|
|
382
|
-
robotic/rai-robotModels/scenarios/pendulum.g,sha256=
|
|
378
|
+
robotic/rai-robotModels/scenarios/pendulum.g,sha256=bViHSQAV_y2uMzM0Wl7jfBiJioICtJ8V2d73_wtKX7o,669
|
|
383
379
|
robotic/rai-robotModels/scenarios/ringBox.g,sha256=as-lnOJd7tSujz3nulwrBL1qtSWpw8a3EDKmRcglwv0,706
|
|
384
380
|
robotic/rai-robotModels/scenarios/simpleArm.g,sha256=N2p5TNUNVnXtKZMK691OIqOrAv4ElOn3U4-z_hRanSw,1473
|
|
385
381
|
robotic/rai-robotModels/scenarios/walker.g,sha256=0h6yAacKSQsgdu_2zIfUB7z0H3fU258amygwHZ7NVlo,1103
|
|
@@ -387,7 +383,7 @@ robotic/rai-robotModels/scenarios/walker1.g,sha256=FTi0HxqU2fsKgqLCkdq5VCuc3Q9py
|
|
|
387
383
|
robotic/rai-robotModels/scenarios/walker3.g,sha256=zODCp1jzoFNLWs5f98qCkKeEcXxm8TKZ0RzPBFH1qq4,796
|
|
388
384
|
robotic/rai-robotModels/scenarios/workshop.g,sha256=2Xjh6cPk2xKbdvtDC89eDHZcRv8CxCnvDB2qR7AQWyY,5633
|
|
389
385
|
robotic/rai-robotModels/scenarios/workshopTable.g,sha256=zDvlVXHQlZV5Ppc9XbUJ6q5XjW1Fni-OsE2NHMdkGpY,4440
|
|
390
|
-
robotic/rai-robotModels/tests/arm.g,sha256=
|
|
386
|
+
robotic/rai-robotModels/tests/arm.g,sha256=5rIvASgj_L7e1aB7h7zq4L-GJjvlPfoTt36sT5DJceI,1671
|
|
391
387
|
robotic/rai-robotModels/tests/compound.g,sha256=V5crn5KdI5YgaKltLrG2QL4Jl3UN96IabPtQdbQDOeM,554
|
|
392
388
|
robotic/rai-robotModels/tests/pr2Shelf.g,sha256=axlVxDwuLMsNGdOga40nbzK3e6dWEthQEXm25XewNTw,329
|
|
393
389
|
robotic/rai-robotModels/tests/thin.g,sha256=1bWARayk8TJutfO8CZs3GWCcBwr_oL2SRLLCP1lDMRQ,222
|
|
@@ -400,15 +396,15 @@ robotic/rai-robotModels/ur10/ur_description/meshes/ur10/visual/UpperArm.ply,sha2
|
|
|
400
396
|
robotic/rai-robotModels/ur10/ur_description/meshes/ur10/visual/Wrist1.ply,sha256=Qmlgt3g046pi8GPzlUBKbDcR-4JehZkXfSRNabe_RVI,282487
|
|
401
397
|
robotic/rai-robotModels/ur10/ur_description/meshes/ur10/visual/Wrist2.ply,sha256=br9zVxfiGNlEMAuVm36e2dJ0chDKpVMe3H1MCh-318E,784726
|
|
402
398
|
robotic/rai-robotModels/ur10/ur_description/meshes/ur10/visual/Wrist3.ply,sha256=el2jO6EOzwgz3ybkKjz9XcjCIQJWCpOCgTA7DSFHz6U,25593
|
|
403
|
-
robotic-0.2.
|
|
404
|
-
robotic-0.2.
|
|
405
|
-
robotic-0.2.
|
|
406
|
-
robotic-0.2.
|
|
407
|
-
robotic-0.2.
|
|
408
|
-
robotic-0.2.
|
|
409
|
-
robotic-0.2.
|
|
410
|
-
robotic-0.2.
|
|
411
|
-
robotic-0.2.
|
|
412
|
-
robotic-0.2.
|
|
413
|
-
robotic-0.2.
|
|
414
|
-
robotic-0.2.
|
|
399
|
+
robotic-0.2.7.data/scripts/ry-bot,sha256=LBNbbQeNNNd_tupI5463Xe-RKSD6xy4HGTbJloisCGk,2280
|
|
400
|
+
robotic-0.2.7.data/scripts/ry-info,sha256=fL5QXJL4Xx-Q42L2C29HHbj1XsmWdWiKIv9rVfc5sm4,425
|
|
401
|
+
robotic-0.2.7.data/scripts/ry-meshTool,sha256=h4f4wFPNaey3ziz870SrEvy6SsQSL-ZnR_cH3UuAZxE,101
|
|
402
|
+
robotic-0.2.7.data/scripts/ry-test,sha256=61CnOEa-OqBsNznvXlZ_Xo5aCXx8QKYeokhsHcEUZac,962
|
|
403
|
+
robotic-0.2.7.data/scripts/ry-urdf2rai,sha256=oeLKgNzYKV5yZ_vkvCrw65CY3ZAxL2ssFQQKcRuCNeo,7722
|
|
404
|
+
robotic-0.2.7.data/scripts/ry-urdf2yaml,sha256=Nebu73TLTUx2p40-FLakek9n3y74cRJfRchV0vV0Gf0,8529
|
|
405
|
+
robotic-0.2.7.data/scripts/ry-view,sha256=_GjUbVS2X3AWnlXqIHwU5dofLmUKA2-NUPySgS-QJNI,599
|
|
406
|
+
robotic-0.2.7.dist-info/LICENSE,sha256=oT-pAsUSXiuMq2_3omR87-GFBeBnegQYixH4Bm_7wag,1071
|
|
407
|
+
robotic-0.2.7.dist-info/METADATA,sha256=sJOsa-sTnum4Wl0vHproqYztL1KP6qMMCAnkCwXdIcw,6689
|
|
408
|
+
robotic-0.2.7.dist-info/WHEEL,sha256=C0OANs-DVT8xkLtO9NVd4ZECqWX-G8uLVHB2gdrEbRg,102
|
|
409
|
+
robotic-0.2.7.dist-info/top_level.txt,sha256=x5A4haAZ18y9FpO1IhXSVJ2TFdhVAgT5JMkejHUg_9U,8
|
|
410
|
+
robotic-0.2.7.dist-info/RECORD,,
|
|
@@ -1,106 +0,0 @@
|
|
|
1
|
-
/* ------------------------------------------------------------------
|
|
2
|
-
Copyright (c) 2011-2024 Marc Toussaint
|
|
3
|
-
email: toussaint@tu-berlin.de
|
|
4
|
-
|
|
5
|
-
This code is distributed under the MIT License.
|
|
6
|
-
Please see <root-path>/LICENSE for details.
|
|
7
|
-
-------------------------------------------------------------- */
|
|
8
|
-
|
|
9
|
-
#pragma once
|
|
10
|
-
|
|
11
|
-
#include "../Logic/treeSearchDomain.h"
|
|
12
|
-
#include "AbstractEnvironment.h"
|
|
13
|
-
|
|
14
|
-
class InterfaceMarc: public AbstractEnvironment {
|
|
15
|
-
//----typedefs/classes----//
|
|
16
|
-
public:
|
|
17
|
-
struct InterfaceMarcAction: public Action {
|
|
18
|
-
InterfaceMarcAction(TreeSearchDomain::Handle action): action(action) {}
|
|
19
|
-
virtual bool operator==(const Action& other) const {
|
|
20
|
-
auto interface_action = dynamic_cast<const InterfaceMarcAction*>(&other);
|
|
21
|
-
return interface_action!=nullptr && *(interface_action->action)==*action;
|
|
22
|
-
}
|
|
23
|
-
virtual size_t get_hash() const {
|
|
24
|
-
return action->get_hash();
|
|
25
|
-
}
|
|
26
|
-
virtual void write(std::ostream& out) const {
|
|
27
|
-
action->write(out);
|
|
28
|
-
}
|
|
29
|
-
TreeSearchDomain::Handle action;
|
|
30
|
-
};
|
|
31
|
-
struct InterfaceMarcObservation: public Observation {
|
|
32
|
-
InterfaceMarcObservation(TreeSearchDomain::Handle observation): observation(observation) {}
|
|
33
|
-
virtual bool operator==(const Observation& other) const {
|
|
34
|
-
auto interface_observation = dynamic_cast<const InterfaceMarcObservation*>(&other);
|
|
35
|
-
return interface_observation!=nullptr && *(interface_observation->observation)==*(observation);
|
|
36
|
-
}
|
|
37
|
-
virtual size_t get_hash() const {
|
|
38
|
-
return observation->get_hash();
|
|
39
|
-
}
|
|
40
|
-
virtual void write(std::ostream& out) const {
|
|
41
|
-
observation->write(out);
|
|
42
|
-
}
|
|
43
|
-
TreeSearchDomain::Handle observation;
|
|
44
|
-
};
|
|
45
|
-
|
|
46
|
-
//----members----//
|
|
47
|
-
public:
|
|
48
|
-
std::shared_ptr<TreeSearchDomain> env_marc;
|
|
49
|
-
|
|
50
|
-
//----methods----//
|
|
51
|
-
public:
|
|
52
|
-
InterfaceMarc(std::shared_ptr<TreeSearchDomain> env_marc): env_marc(env_marc) {}
|
|
53
|
-
virtual observation_reward_pair_t transition(const action_handle_t& action_handle) {
|
|
54
|
-
auto interface_action = std::dynamic_pointer_cast<const InterfaceMarcAction>(action_handle);
|
|
55
|
-
assert(interface_action!=nullptr);
|
|
56
|
-
auto return_value = env_marc->transition(interface_action->action);
|
|
57
|
-
return observation_reward_pair_t(observation_handle_t(new InterfaceMarcObservation(return_value.first)), return_value.second);
|
|
58
|
-
}
|
|
59
|
-
template<class C>
|
|
60
|
-
static std::shared_ptr<AbstractEnvironment> makeAbstractEnvironment(C* env) {
|
|
61
|
-
auto mcts = dynamic_cast<TreeSearchDomain*>(env);
|
|
62
|
-
assert(mcts!=nullptr);
|
|
63
|
-
return std::shared_ptr<AbstractEnvironment>(
|
|
64
|
-
std::make_shared<InterfaceMarc>(
|
|
65
|
-
std::shared_ptr<TreeSearchDomain>(mcts)));
|
|
66
|
-
}
|
|
67
|
-
virtual action_container_t get_actions() {
|
|
68
|
-
action_container_t action_container;
|
|
69
|
-
for(auto action : env_marc->get_actions()) {
|
|
70
|
-
action_container.push_back(action_handle_t(new InterfaceMarcAction(action)));
|
|
71
|
-
}
|
|
72
|
-
return action_container;
|
|
73
|
-
}
|
|
74
|
-
virtual void make_current_state_new_start() {
|
|
75
|
-
env_marc->make_current_state_new_start();
|
|
76
|
-
}
|
|
77
|
-
virtual void reset_state() {
|
|
78
|
-
env_marc->reset_state();
|
|
79
|
-
}
|
|
80
|
-
|
|
81
|
-
virtual bool has_terminal_state() const {
|
|
82
|
-
return env_marc->get_info(TreeSearchDomain::InfoTag::hasTerminal);
|
|
83
|
-
}
|
|
84
|
-
virtual bool is_terminal_state() const {
|
|
85
|
-
return env_marc->is_terminal_state();
|
|
86
|
-
}
|
|
87
|
-
virtual bool is_deterministic() const {
|
|
88
|
-
return env_marc->get_info(TreeSearchDomain::InfoTag::isDeterministic);
|
|
89
|
-
}
|
|
90
|
-
virtual bool has_max_reward() const {
|
|
91
|
-
return env_marc->get_info(TreeSearchDomain::InfoTag::hasMaxReward);
|
|
92
|
-
}
|
|
93
|
-
virtual reward_t max_reward() const {
|
|
94
|
-
return (reward_t)env_marc->get_info_value(TreeSearchDomain::InfoTag::getMaxReward);
|
|
95
|
-
}
|
|
96
|
-
virtual bool has_min_reward() const {
|
|
97
|
-
return env_marc->get_info(TreeSearchDomain::InfoTag::hasMinReward);
|
|
98
|
-
}
|
|
99
|
-
virtual reward_t min_reward() const {
|
|
100
|
-
return (reward_t)env_marc->get_info_value(TreeSearchDomain::InfoTag::getMinReward);
|
|
101
|
-
}
|
|
102
|
-
virtual bool is_markov() const {
|
|
103
|
-
return env_marc->get_info(TreeSearchDomain::InfoTag::isMarkov);
|
|
104
|
-
}
|
|
105
|
-
};
|
|
106
|
-
|
|
@@ -1,47 +0,0 @@
|
|
|
1
|
-
/* ------------------------------------------------------------------
|
|
2
|
-
Copyright (c) 2011-2024 Marc Toussaint
|
|
3
|
-
email: toussaint@tu-berlin.de
|
|
4
|
-
|
|
5
|
-
This code is distributed under the MIT License.
|
|
6
|
-
Please see <root-path>/LICENSE for details.
|
|
7
|
-
-------------------------------------------------------------- */
|
|
8
|
-
|
|
9
|
-
#pragma once
|
|
10
|
-
|
|
11
|
-
#include "../Logic/treeSearchDomain.h"
|
|
12
|
-
#include "../Core/array.h"
|
|
13
|
-
|
|
14
|
-
struct BlindBranch : rai::TreeSearchDomain {
|
|
15
|
-
struct Action : SAO {
|
|
16
|
-
Action(int d):d(d) {}
|
|
17
|
-
int d;
|
|
18
|
-
bool operator==(const SAO& other) const { return d==dynamic_cast<const Action&>(other).d; }
|
|
19
|
-
};
|
|
20
|
-
|
|
21
|
-
struct State:SAO {
|
|
22
|
-
State(int sum, uint T):sum(sum), T(T) {}
|
|
23
|
-
int sum;
|
|
24
|
-
uint T;
|
|
25
|
-
bool operator==(const SAO& other) const {
|
|
26
|
-
const State& s = dynamic_cast<const State&>(other);
|
|
27
|
-
return sum==s.sum && T==s.T;
|
|
28
|
-
}
|
|
29
|
-
};
|
|
30
|
-
|
|
31
|
-
int state; //the state = sum of so-far actions
|
|
32
|
-
int T; //current time (part of the state, actually!)
|
|
33
|
-
int H; //horizon (parameter of the world)
|
|
34
|
-
rai::Array<Handle> actions; //will contain handles on the -1 and +1 action
|
|
35
|
-
|
|
36
|
-
BlindBranch(uint H);
|
|
37
|
-
void reset_state();
|
|
38
|
-
TransitionReturn transition(const Handle& action);
|
|
39
|
-
TransitionReturn transition_randomly();
|
|
40
|
-
const rai::Array<Handle> get_actions();
|
|
41
|
-
const Handle get_state();
|
|
42
|
-
void set_state(const Handle& _state);
|
|
43
|
-
bool is_terminal_state() const;
|
|
44
|
-
|
|
45
|
-
bool get_info(InfoTag tag) const;
|
|
46
|
-
double get_info_value(InfoTag tag) const;
|
|
47
|
-
};
|
|
@@ -1,90 +0,0 @@
|
|
|
1
|
-
/* ------------------------------------------------------------------
|
|
2
|
-
Copyright (c) 2011-2024 Marc Toussaint
|
|
3
|
-
email: toussaint@tu-berlin.de
|
|
4
|
-
|
|
5
|
-
This code is distributed under the MIT License.
|
|
6
|
-
Please see <root-path>/LICENSE for details.
|
|
7
|
-
-------------------------------------------------------------- */
|
|
8
|
-
|
|
9
|
-
#pragma once
|
|
10
|
-
|
|
11
|
-
#include "../Logic/treeSearchDomain.h"
|
|
12
|
-
#include "../Core/graph.h"
|
|
13
|
-
#include "../Algo/priorityQueue.h"
|
|
14
|
-
|
|
15
|
-
//===========================================================================
|
|
16
|
-
|
|
17
|
-
struct AStar;
|
|
18
|
-
struct AStar_Node;
|
|
19
|
-
typedef rai::Array<AStar_Node*> AStar_NodeL;
|
|
20
|
-
|
|
21
|
-
//===========================================================================
|
|
22
|
-
|
|
23
|
-
struct AStar_Node {
|
|
24
|
-
AStar& astar;
|
|
25
|
-
rai::TreeSearchDomain& world;
|
|
26
|
-
rai::TreeSearchDomain::Handle action;
|
|
27
|
-
rai::TreeSearchDomain::Handle state;
|
|
28
|
-
rai::TreeSearchDomain::TransitionReturn ret;
|
|
29
|
-
|
|
30
|
-
AStar_Node* parent;
|
|
31
|
-
rai::Array<AStar_Node*> children;
|
|
32
|
-
|
|
33
|
-
uint d; ///< decision depth of this node
|
|
34
|
-
double time; ///< real time
|
|
35
|
-
double g=0.; ///< cost-so-far, path cost (TODO: replace by array of bounds)
|
|
36
|
-
double h=0.; ///< cost-so-far, path cost (TODO: replace by array of bounds)
|
|
37
|
-
|
|
38
|
-
bool isExpanded=false;
|
|
39
|
-
bool isInfeasible=false;
|
|
40
|
-
bool isTerminal=false;
|
|
41
|
-
|
|
42
|
-
/// root node init
|
|
43
|
-
AStar_Node(AStar& astar, rai::TreeSearchDomain& world);
|
|
44
|
-
|
|
45
|
-
/// child node creation
|
|
46
|
-
AStar_Node(AStar_Node* parent, const rai::TreeSearchDomain::Handle& a);
|
|
47
|
-
|
|
48
|
-
~AStar_Node() { NIY; }
|
|
49
|
-
|
|
50
|
-
//- computations on the node
|
|
51
|
-
void expand(); ///< expand this node (symbolically: compute possible decisions and add their effect nodes)
|
|
52
|
-
|
|
53
|
-
//-- helpers
|
|
54
|
-
void labelInfeasible(); ///< sets the infeasible label AND removes all children!
|
|
55
|
-
AStar_NodeL getTreePath(); ///< return the decision path in terms of a list of nodes (just walking to the root)
|
|
56
|
-
AStar_Node* getRoot(); ///< return the decision path in terms of a list of nodes (just walking to the root)
|
|
57
|
-
void getAllChildren(AStar_NodeL& tree);
|
|
58
|
-
|
|
59
|
-
bool recomputeAllFolStates();
|
|
60
|
-
void recomputeAllMCStats(bool excludeLeafs=true);
|
|
61
|
-
|
|
62
|
-
void checkConsistency();
|
|
63
|
-
|
|
64
|
-
void write(ostream& os=cout, bool recursive=false) const;
|
|
65
|
-
void getGraph(rai::Graph& G, rai::Node* n=nullptr);
|
|
66
|
-
rai::Graph getGraph() { rai::Graph G; getGraph(G, nullptr); G.checkConsistency(); return G; }
|
|
67
|
-
|
|
68
|
-
void getAll(AStar_NodeL& L);
|
|
69
|
-
AStar_NodeL getAll() { AStar_NodeL L; getAll(L); return L; }
|
|
70
|
-
};
|
|
71
|
-
stdOutPipe(AStar_Node)
|
|
72
|
-
|
|
73
|
-
//===========================================================================
|
|
74
|
-
|
|
75
|
-
struct AStar {
|
|
76
|
-
AStar_Node* root;
|
|
77
|
-
PriorityQueue<AStar_Node*> queue;
|
|
78
|
-
rai::Array<AStar_Node*> solutions;
|
|
79
|
-
uint size, depth;
|
|
80
|
-
|
|
81
|
-
AStar(rai::TreeSearchDomain& world);
|
|
82
|
-
|
|
83
|
-
bool step();
|
|
84
|
-
void run();
|
|
85
|
-
|
|
86
|
-
void reportQueue();
|
|
87
|
-
};
|
|
88
|
-
|
|
89
|
-
//===========================================================================
|
|
90
|
-
|
|
@@ -1,109 +0,0 @@
|
|
|
1
|
-
/* ------------------------------------------------------------------
|
|
2
|
-
Copyright (c) 2011-2024 Marc Toussaint
|
|
3
|
-
email: toussaint@tu-berlin.de
|
|
4
|
-
|
|
5
|
-
This code is distributed under the MIT License.
|
|
6
|
-
Please see <root-path>/LICENSE for details.
|
|
7
|
-
-------------------------------------------------------------- */
|
|
8
|
-
|
|
9
|
-
#pragma once
|
|
10
|
-
|
|
11
|
-
#include "../Logic/treeSearchDomain.h"
|
|
12
|
-
#include "../Core/graph.h"
|
|
13
|
-
#include "../Algo/priorityQueue.h"
|
|
14
|
-
|
|
15
|
-
//===========================================================================
|
|
16
|
-
|
|
17
|
-
struct MBTS;
|
|
18
|
-
struct MBTS_Node;
|
|
19
|
-
typedef rai::Array<MBTS_Node*> MBTS_NodeL;
|
|
20
|
-
|
|
21
|
-
//===========================================================================
|
|
22
|
-
|
|
23
|
-
struct MBTS_Node {
|
|
24
|
-
MBTS& MBTS;
|
|
25
|
-
TreeSearchDomain& world;
|
|
26
|
-
TreeSearchDomain::Handle action;
|
|
27
|
-
TreeSearchDomain::Handle state;
|
|
28
|
-
TreeSearchDomain::TransitionReturn ret;
|
|
29
|
-
|
|
30
|
-
MBTS_Node* parent;
|
|
31
|
-
rai::Array<MBTS_Node*> children;
|
|
32
|
-
|
|
33
|
-
uint d; ///< decision depth of this node
|
|
34
|
-
double time; ///< real time
|
|
35
|
-
|
|
36
|
-
arr g; ///< cost-so-far for each level
|
|
37
|
-
arr h; ///< cost-to-go heuristic for each level
|
|
38
|
-
|
|
39
|
-
boolA isEvaluated; ///< for each level
|
|
40
|
-
boolA isInfeasible; ///< for each level
|
|
41
|
-
bool isTerminal=false; ///< for logic level only
|
|
42
|
-
|
|
43
|
-
/// root node init
|
|
44
|
-
MBTS_Node(MBTS& MBTS, TreeSearchDomain& world);
|
|
45
|
-
|
|
46
|
-
/// child node creation
|
|
47
|
-
MBTS_Node(MBTS_Node* parent, const TreeSearchDomain::Handle& a);
|
|
48
|
-
|
|
49
|
-
~MBTS_Node() { NIY; }
|
|
50
|
-
|
|
51
|
-
//- computations on the node
|
|
52
|
-
void expand(); ///< expand this node (symbolically: compute possible decisions and add their effect nodes)
|
|
53
|
-
|
|
54
|
-
virtual void evaluate(int level=-1) { NIY; }
|
|
55
|
-
|
|
56
|
-
//-- helpers
|
|
57
|
-
void labelInfeasible(); ///< sets the infeasible label AND removes all children!
|
|
58
|
-
MBTS_NodeL getTreePath(); ///< return the decision path in terms of a list of nodes (just walking to the root)
|
|
59
|
-
MBTS_Node* getRoot(); ///< return the decision path in terms of a list of nodes (just walking to the root)
|
|
60
|
-
void getAllChildren(MBTS_NodeL& tree);
|
|
61
|
-
|
|
62
|
-
bool recomputeAllFolStates();
|
|
63
|
-
void recomputeAllMCStats(bool excludeLeafs=true);
|
|
64
|
-
|
|
65
|
-
void checkConsistency();
|
|
66
|
-
|
|
67
|
-
void write(ostream& os=cout, bool recursive=false) const;
|
|
68
|
-
void getGraph(Graph& G, Node* n=nullptr);
|
|
69
|
-
Graph getGraph() { Graph G; getGraph(G, nullptr); G.checkConsistency(); return G; }
|
|
70
|
-
|
|
71
|
-
void getAll(MBTS_NodeL& L);
|
|
72
|
-
MBTS_NodeL getAll() { MBTS_NodeL L; getAll(L); return L; }
|
|
73
|
-
};
|
|
74
|
-
stdOutPipe(MBTS_Node)
|
|
75
|
-
|
|
76
|
-
//===========================================================================
|
|
77
|
-
|
|
78
|
-
struct MBTS_Heuristic {
|
|
79
|
-
struct Return {
|
|
80
|
-
double g;
|
|
81
|
-
double h;
|
|
82
|
-
bool terminal;
|
|
83
|
-
bool feasible;
|
|
84
|
-
};
|
|
85
|
-
|
|
86
|
-
virtual ~MBTS_Heuristic() {}
|
|
87
|
-
virtual Return evaluate(MBTS_Node* n, int level);
|
|
88
|
-
};
|
|
89
|
-
|
|
90
|
-
//===========================================================================
|
|
91
|
-
|
|
92
|
-
struct MBTS {
|
|
93
|
-
MBTS_Node* root;
|
|
94
|
-
rai::Array<PriorityQueue<MBTS_Node*>> queue; //for each level
|
|
95
|
-
MBTS_Heuristic& heuristic;
|
|
96
|
-
|
|
97
|
-
rai::Array<MBTS_Node*> solutions;
|
|
98
|
-
uint size, depth;
|
|
99
|
-
|
|
100
|
-
MBTS(TreeSearchDomain& world, MBTS_Heuristic& heuristic, uint L);
|
|
101
|
-
|
|
102
|
-
bool step(int level);
|
|
103
|
-
void run();
|
|
104
|
-
|
|
105
|
-
void reportQueue();
|
|
106
|
-
};
|
|
107
|
-
|
|
108
|
-
//===========================================================================
|
|
109
|
-
|