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. Journal articles
  4. Just-in-Time Informed Trees: Manipulability-Aware Asymptotically Optimized Motion Planning
 
research article

Just-in-Time Informed Trees: Manipulability-Aware Asymptotically Optimized Motion Planning

Cai, Kuanqi  
•
Zhang, Liding
•
Su, Xinwen
Show more
2025
IEEE/ASME Transactions on Mechatronics

In high-dimensional robotic path planning, traditional sampling-based methods often struggle to efficiently identify both feasible and optimal paths in complex, multiobstacle environments. This challenge is intensified in robotic manipulators, where the risk of kinematic singularities and self-collisions further complicates motion efficiency and safety. To address these issues, we introduce the just-in-time informed trees (JIT*) algorithm, an enhancement over effort informed trees, designed to improve path planning through two core modules: 1) the just-in-time module; and 2) the motion performance module. The just-in-time module includes “Just-in-Time Edge,” which dynamically refines edge connectivity, and “Just-in-Time Sample,” which adjusts sampling density in bottleneck areas to enable faster initial path discovery. The motion performance module balances manipulability and trajectory cost through dynamic switching, optimizing motion control while reducing the risk of singularities. Comparative analysis shows that JIT* consistently outperforms traditional sampling-based planners across \mathbb {R}^{4} to \mathbb {R}^{16} dimensions.

  • Details
  • Metrics
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