← Search

Xuemin Chi

5 accepted papers

2026

Safety-Critical Dynamic Motion Generation for Manipulators Using Differentiable Distance Fields in Configuration Space

ICRA 2026poster

Generating collision-free motions in dynamic environments is a challenging problem for high-dimensional robotics, particularly under real-time constraints. Control Barrier Functions (CBFs), widely utilized in safety-critical control, have shown significant potential for motion generation. However, f…

Cited by 0Scholar
2025

Efficient and Real-Time Motion Planning for Robotics Using Projection-Based Optimization

IROS 2025

Generating motions for robots interacting with objects of various shapes is a complex challenge, further complicated by the robot’s geometry and multiple desired behaviors. While current robot programming tools (such as inverse kinematics, collision avoidance, and manipulation planning) often treat

Cited by 0SourceScholar
2025

FSDP: Fast and Safe Data-Driven Overtaking Trajectory Planning for Head-to-Head Autonomous Racing Competitions

IROS 2025

Generating overtaking trajectories in autonomous racing is a challenging task, as the trajectory must satisfy the vehicle’s dynamics and ensure safety and real-time performance running on resource-constrained hardware. This work proposes the Fast and Safe Data-Driven Planner to address this challeng

Cited by 2SourcecodeScholar
2024

Configuration Space Distance Fields for Manipulation Planning

RSS 2024poster

The signed distance field (SDF) is a popular implicit shape representation in robotics, providing geometric information about objects and obstacles in a form that can easily be combined with control, optimization and learning techniques. Most often, SDFs are used to represent distances in task space…

Cited by 14SourcePDFScholar
2023

Velocity Obstacle for Polytopic Collision Avoidance for Distributed Multi-Robot Systems

RA-L 2023

Obstacle avoidance for multi-robot navigation with polytopic shapes is challenging. Existing works simplify the system dynamics or consider it as a convex or non-convex optimization problem with positive distance constraints between robots, which limits real-time performance and scalability. Additio

Cited by 24SourceScholar