final presentation
play

Final Presentation CPG and Tegotae based Locomotion Control of - PowerPoint PPT Presentation

Final Presentation CPG and Tegotae based Locomotion Control of Quadrupedal Modular Robots Author: Rui Vasconcelos Supervisors: Simon Hauser Florin Dzeladini Prof. Auke Ijspeert Prof. Paulo Oliveira 1 Control Problem Is there a general


  1. Final Presentation CPG and Tegotae based Locomotion Control of Quadrupedal Modular Robots Author: Rui Vasconcelos Supervisors: Simon Hauser Florin Dzeladini Prof. Auke Ijspeert Prof. Paulo Oliveira 1

  2. Control Problem Is there a general approach to control arbitrary modular robots? 2

  3. Control Problem Is there a general approach to control quadrupedal arbitrary modular robots? Simplifications: 1. 8 degrees of freedom 2. Symmetric configuration 3. Central body 3

  4. Bioinspiration [Ijspeert A.] 4

  5. Methods

  6. Base Morphology Simulation Hardware 𝐢 π‘₯𝑕 = 2 Kg 𝐢 π‘₯𝑕 = 1.4 Kg Simplifications: 1. Planar Limbs 2. Specialized foot 6

  7. Base Morphology Simulation (𝑦, 𝑧, 𝑨) (Ξ¦, Θ, Ξ¨) 𝜘 𝑠𝑓𝑔 𝜘 𝜘 𝜐 (𝐺 𝑦 , 𝐺 𝑧 , 𝐺 𝑨 ) 7

  8. Base Morphology Hardware 18V 18V 12V RS-485 TTL 8

  9. Base Morphology Joint Reference Hardware Joint Position Current New IMU 3D force 9

  10. Step Trajectory Stance phase Swing phase Parameters: πœ„ 𝑛𝑏𝑦 πœ„ 𝑛𝑏𝑦 π‘š 1 π‘š 1 1. πœ„ 𝑛𝑏𝑦 π‘š 2 2. β„Ž 𝑑𝑒 π‘š 2 3. β„Ž 𝑑π‘₯ π‘ž 3 π‘ž 3 π‘ž 1 π‘ž 1 π‘ž 4 π‘ž 2 β„Ž 𝑑π‘₯ β„Ž 𝑑𝑒 10

  11. Control Approaches Open Loop CPG Tegotae π‘ž 4 𝑗 = 2 𝑗 = 1 𝑗 = 2 𝑗 = 1 π‘ž 3 π‘ž 1 𝜚 𝑒 𝜚 𝑗 π‘ž 2 Parameters: Parameters : 1. 𝑔 𝑗 = 4 𝑗 = 3 𝑗 = 4 𝑗 = 3 1. 𝑔 2. 𝑒𝑔 2. 𝜏 3. πœ” π‘—π‘˜ = βˆ’πœ” π‘˜π‘— 11

  12. Control Approaches Open Loop CPG Tegotae π‘ž 4 Binary Tegotae 𝑗 = 2 𝑗 = 1 π‘ž 3 π‘ž 1 𝜚 𝑒 𝜚 𝑗 π‘ž 2 Parameters: 1. 𝑔 𝑗 = 4 𝑗 = 3 2. 𝑒𝑔 3. πœ” π‘—π‘˜ = βˆ’πœ” π‘˜π‘— 12

  13. Goals

  14. Thesis Goals Open Loop CPG Tegotae 1. Trajectory 1. Trajectory 2. Effect of 𝜏 2. Duty factor 3. Scaled by Steady frequency? State Energy 4. Binary Tegotae? Speed Convergence Stability 14

  15. Results

  16. Control Approaches Open Loop CPG Tegotae π‘ž 4 Binary Tegotae 𝑗 = 2 𝑗 = 1 π‘ž 3 π‘ž 1 𝜚 𝑒 𝜚 𝑗 π‘ž 2 Parameters: 1. 𝑔 𝑗 = 4 𝑗 = 3 2. 𝑒𝑔 3. πœ” π‘—π‘˜ = βˆ’πœ” π‘˜π‘— 16

  17. Particle Swarm Optimization Open Loop CPG Maximize : > β„Ž π‘›π‘—π‘œ Subject to: Validation on hardware 17

  18. Particle Swarm Optimization Open Loop CPG Maximize : Subject to: 18

  19. Particle Swarm Optimization Open Loop CPG Maximize Trot 𝑀 𝑒 [𝑛 βˆ™ 𝑑 βˆ’1 ] : 0.25 0.5 0.75 1 BL 19

  20. Particle Swarm Optimization Open Loop CPG Rotary Gallop Maximize Trot 𝑀 𝑒 [𝑛 βˆ™ 𝑑 βˆ’1 ] : 0.25 0.5 0.75 1 BL 20

  21. Particle Swarm Optimization Bound Open Loop CPG Rotary Gallop Maximize Trot 𝑀 𝑒 [𝑛 βˆ™ 𝑑 βˆ’1 ] : 0.25 0.5 0.75 1 BL 21

  22. Particle Swarm Optimization Bound Open Loop CPG Rotary Gallop Maximize Validated on hardware Trot 𝑀 𝑒 [𝑛 βˆ™ 𝑑 βˆ’1 ] Trot 0 : 0.25 0.5 0.75 1 β‰₯ 0.5 BL Imposed Trot Validation on hardware 𝑔 = 0.25 𝐼𝑨 , πœ„ 𝑛𝑏𝑦 = 0.3 𝑠𝑏𝑒 , β„Ž 𝑑π‘₯ = 15 𝑛𝑛, β„Ž 𝑑𝑒 = 0 𝑛𝑛 22

  23. Steady State Systematic Search: Trajectories Open Loop CPG Simulation 𝑔 = 0.25 𝐼𝑨 23

  24. Steady State Systematic Search: Trajectories Open Loop CPG Hardware 𝑔 = 0.25 𝐼𝑨 𝑒𝑔 = 0.5 24

  25. Control Approaches Open Loop CPG Tegotae π‘ž 4 Binary Tegotae 𝑗 = 2 𝑗 = 1 π‘ž 3 π‘ž 1 𝜚 𝑒 𝜚 𝑗 π‘ž 2 Parameters: 1. 𝑔 𝑗 = 4 𝑗 = 3 2. 𝑒𝑔 1. Convergence 3. πœ” π‘—π‘˜ = βˆ’πœ” π‘˜π‘— 2. Steady State 25

  26. 1. Convergence Tegotae Trot 𝝉 = 𝟏. πŸ‘πŸ” Hardware 𝜚 0 = [0,0,0,0] 26 𝑔 = 0.25 𝐼𝑨 , πœ„ 𝑛𝑏𝑦 = 0.3 𝑠𝑏𝑒 , β„Ž 𝑑π‘₯ = 15 𝑛𝑛, β„Ž 𝑑𝑒 = 0 𝑛𝑛

  27. 1. Convergence Binary Tegotae 𝝉 𝒄 = 𝟏. πŸ• 27

  28. 1. Convergence Binary Tegotae 28

  29. 2. Steady State Tegotae 1. Trajectory Simulation 2. Effect of 𝜏 29

  30. 2. Steady State Tegotae 1. Trajectory Simulation 2. Effect of 𝜏 3. Scaled by frequency? 30

  31. 2. Steady State Tegotae 1. Trajectory Simulation 2. Effect of 𝜏 3. Scaled by frequency? Best Best 15 Energy 15 Efficiency Speed 31

  32. 2. Steady State Tegotae Hardware 𝑔 = 0.25 𝐼𝑨 , πœ„ 𝑛𝑏𝑦 = 0.3 𝑠𝑏𝑒 , β„Ž 𝑑π‘₯ = 15 𝑛𝑛, β„Ž 𝑑𝑒 = 0 𝑛𝑛 32

  33. 2. Steady State Tegotae Hardware 𝝉 = 𝟏 𝝉 = 𝟏. πŸ’ 33

  34. 2. Steady State Tegotae Hardware 𝝉 = 𝟏 𝝉 = 𝟏. πŸ’ Step cycle 34

  35. 2. Steady State Tegotae Hardware 𝝉 = 𝟏 𝝉 = 𝟏. πŸ’ 35

  36. 2. Steady State Tegotae Hardware 𝝉 = 𝟏. πŸ” 𝝉 = 𝟐 36

  37. 2. Steady State Binary Tegotae 𝝉 𝒄 = 𝟏. πŸ• 𝝉 𝒄 = 𝟏. πŸ• 37

  38. Conclusions

  39. Conclusions Open Loop CPG Tegotae 𝜏(𝑒) Convergence: 𝜏 Particle Swarm Optimizations: Trot Bound Steady 𝜏 Fast + Efficient 𝜏 Rotary Gallop state: Stable β„Ž 𝑑𝑒 = 0 Trot 𝑀 𝑒 [𝑛 βˆ™ 𝑑 βˆ’1 ] 0.25 0.5 0.75 1 BL Binary Tegotae Systematic Search: β„Ž 𝑑π‘₯ ∈ 10,20 𝑛𝑛 1. Slower convergence πœ„ 𝑛𝑏𝑦 Fast + H: 2. Less efficient steady state Efficient πœ„ 𝑛𝑏𝑦 Slow + S: Simulation VS Hardware Efficient 39

  40. Future Work Tegotae 1. More experiments! 2. Rough Terrain 3. Compliance Crawling? 4. Mophology changes 40

  41. Future Work Tegotae 1. More experiments! 2. Rough Terrain 3. Compliance Ground Reaction Force [N] 4. Mophology changes 41

  42. Acknowledgements 42

  43. Final Presentation CPG and Tegotae based Locomotion Control of Quadrupedal Modular Robots Author: Rui Vasconcelos Supervisors: Simon Hauser Florin Dzeladini Prof. Auke Ijspeert Prof. Paulo Oliveira 43

  44. Appendix: Cat Gallop 44

  45. Appendix: Validation on β„Ž 𝑑𝑒 β‰  0 π’Š 𝒕𝒖 = πŸ” 𝒏𝒏 Validation on hardware 45

  46. Appendix: Statistics on CLSS 46

  47. Appendix: Simulation VS Hardware 47

  48. Appendix: Open Loop Systematic Search 48

  49. Appendix: Open Loop Systematic Search 49

  50. Appendix: D-S run Open Loop CPG D-S run Rotary Gallop Trot 𝑀 𝑒 [𝑛 βˆ™ 𝑑 βˆ’1 ] 0.25 0.5 0.75 1 50

  51. Appendix: 0.75 Hz Binary Convergence 51

  52. Appendix: Robot version 1 52

  53. Appendix: Hardware Limitations 53

  54. Appendix: PSO Results 54

  55. Appendix: PSO Results 55

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend