Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Multi-Arm Self-Collision Avoidance: A Sparse Solution for a Big Data Problem.
 
conference paper

Multi-Arm Self-Collision Avoidance: A Sparse Solution for a Big Data Problem.

Figueroa Fernandez, Nadia Barbara  
•
Mirrazavi Salehian, Seyed Sina  
•
Billard, Aude  
Show more
May 28, 2018
Proceedings of the Third Machine Learning in Planning and Control of Robot Motion (MLPC) Workshop

In this work, we propose a data-driven approach for real-time self-collision avoidance in multi-arm systems. The approach consists of modeling the regions in joint-space that lead to collisions via a Self-Collision Avoidance (SCA) boundary and use it as a constraint for a centralized Inverse Kinematics (IK) solver. This problem is particularly challenging as the dimensionality of the joint-configurations is in the order of millions (for a dual-arm system), while the IK solver must run within a control loop of 2ms. Hence, an extremely sparse solution is needed for this big data problem. The SCA region is modeled through a sparse non-linear kernel classification method that yields a runtime of less than 2ms (on a single thread CPU process) and has a False Positive Rate (FPR)=1.5%. Code for generating multi-arm datasets and learning the sparse SCA boundary are available at: https://github.com/nbfigueroa/SCA-Boundary-Learning

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

Multi-Arm-SCA_WS_final.pdf

Access type

openaccess

Size

7.96 MB

Format

Adobe PDF

Checksum (MD5)

c84619ec2bc7cb027d6b12f4056c23ab

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés