73 citations · 129 across the 17 of their papers we have counts for
8 papers · 1 filter
Efficient Collision Detection Framework for Enhancing Collision-Free Robot Motion
Xiankun Zhu, Yucheng Xin, Shoujie Li +3
Fast and efficient collision detection is essential for motion generation in robotics. In this paper, we propose an efficient collision detection framework based on the Signed Dist…
MuxHand: A Cable-driven Dexterous Robotic Hand Using Time-division Multiplexing Motors
Jianle Xu, Shoujie Li, Hong Luo +4
The robotic dexterous hand is responsible for both grasping and dexterous manipulation. The number of motors directly influences both the dexterity and the cost of such systems. In…
Safe Expeditious Whole-Body Control of Mobile Manipulators for Collision Avoidance
Bingjie Chen, Yancong Wei, Rihao Liu +5
Whole-body reactive obstacle avoidance for mobile manipulators (MM) remains an open research problem. Control Barrier Functions (CBF), combined with Quadratic Programming (QP), hav…
CushionCatch: A Compliant Catching Mechanism for Mobile Manipulators via Combined Optimization and Learning
Bingjie Chen, Keyu Fan, Qi Yang +6
Catching flying objects with a cushioning process is a skill commonly performed by humans, yet it remains a significant challenge for robots. In this paper, we present a framework…
ViIK: Flow-based Vision Inverse Kinematics Solver with Fusing Collision Checking
Qinglong Meng, Chongkun Xia, Xueqian Wang
Inverse Kinematics (IK) is to find the robot's configurations that satisfy the target pose of the end effector. In motion planning, diverse configurations were required in case a f…
PaddingFlow: Improving Normalizing Flows with Padding-Dimensional Noise
Qinglong Meng, Chongkun Xia, Xueqian Wang
Normalizing flow is a generative modeling approach with efficient sampling. However, Flow-based models suffer two issues: 1) If the target distribution is manifold, due to the unma…
PPNet: A Two-Stage Neural Network for End-to-end Path Planning
Qinglong Meng, Chongkun Xia, Xueqian Wang +2
The classical path planners, such as sampling-based path planners, can provide probabilistic completeness guarantees in the sense that the probability that the planner fails to ret…
Geometric Structure and Polynomial-time Algorithm of Game Equilibria
Hongbo Sun, Chongkun Xia, Junbo Tan +3
Whether a PTAS (polynomial-time approximation scheme) exists for game equilibria has been an open question, and its absence has indications and consequences in three fields: the pr…