Xuemin Chi

dblp:144/2646 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0002-0913-6700ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1
YearPublicationVenuePosition
2025 Efficient and Real-Time Motion Planning for Robotics Using Projection-Based Optimization
abstract
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 these problems as constrained optimization, many existing solvers focus on specific problem domains or do not exploit geometric constraints effectively. We propose an efficient first-order method, Augmented Lagrangian Spectral Projected Gradient Descent (ALSPG), which leverages geometric projections via Euclidean projections, Minkowski sums, and basis functions. We show that by using geometric constraints rather than full constraints and gradients, ALSPG significantly improves real-time performance. Compared to second-order methods like iLQR, ALSPG remains competitive in the unconstrained case. We validate our method through toy examples and extensive simulations, and demonstrate its effectiveness on a 7-axis Franka robot, a 6-axis P-Rob robot and a 1:10 scale car in real-world experiments. Source codes, experimental data and videos are available on the project webpage: https://sites.google.com/view/alspg-oc
Xuemin Chi, Hakan Girgin, Tobias Löw, Yangyang Xie, Teng Xue, Jihao Huang, Zhitao Liu, Sylvain Calinon
IROS1
2025 FSDP: Fast and Safe Data-Driven Overtaking Trajectory Planning for Head-to-Head Autonomous Racing Competitions
abstract
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 challenge. Sparse Gaussian predictions are introduced to improve both the computational efficiency and accuracy of opponent predictions. Furthermore, the proposed approach employs a bi-level quadratic programming framework to generate an overtaking trajectory leveraging the opponent predictions. The first level uses polynomial fitting to generate a rough trajectory, from which reference states and control inputs are derived for the second level. The second level formulates a model predictive control optimization problem in the Frenet frame, generating a trajectory that satisfies both kinematic feasibility and safety. Experimental results on the F1TENTH platform show that our method outperforms the State-of-the-Art, achieving an 8.93% higher overtaking success rate, allowing the maximum opponent speed, ensuring a smoother ego trajectory, and reducing 74.04% computational time compared to the Predictive Spliner method. The code is available at: https://github.com/ZJU-DDRX/FSDP.
Jihao Huang, Wule Mao, Yonghao Fu, Xuemin Chi, Haotong Qin, Nicolas Baumann, Zhitao Liu, Michele Magno, Lei Xie 0007
IROS5
2023 Obstacle Avoidance for Unicycle-Modelled Mobile Robots with Time-Varying Control Barrier Functions
abstract
In this paper, we propose a safety-critical controller based on time-varying control barrier functions (CBFs) for a robot with an unicycle model in the continuous-time domain to achieve navigation and dynamic collision avoidance. Unlike previous works, our proposed approach can control both linear and angular velocity to avoid collision with obstacles, overcoming the limitation of confined control performance due to the lack of control variable. To ensure that the robot reaches its destination, we also design a control Lyapunov function (CLF). Our safety-critical controller is formulated as a quadratic program (QP) optimization problem that incorporates CLF and CBFs as constraints, enabling real-time application for navigation and dynamic collision avoidance. Numerical simulations are conducted to verify the effectiveness of our proposed approach.
Jihao Huang, Zhitao Liu, Xuemin Chi
IECON4
2007 Manual Transcription of Conversational Speech at the Articulatory Feature Level
abstract
We present an approach for the manual labeling of speech at the articulatory feature level, and a new set of labeled conversational speech collected using this approach. A detailed transcription, including overlapping or reduced gestures, is useful for studying the great pronunciation variability in conversational speech. It also facilitates the testing of feature classifiers, such as those used in articulatory approaches to automatic speech recognition. We describe an effort to transcribe a small set of utterances drawn from the Switchboard database using eight articulatory tiers. Two transcribers have labeled these utterances in a multi-pass strategy, allowing for correction of errors. We describe the data collection methods and analyze the data to determine how quickly and reliably this type of transcription can be done. Finally, we demonstrate one use of the new data set by testing a set of multilayer perceptron feature classifiers against both the manual labels and forced alignments.
Karen Livescu, Ari Bezman, Nash M. Borges, Lisa Yung, Özgür Çetin, Joe Frankel, Simon King 0001, Mathew Magimai-Doss, Xuemin Chi, Lisa Lavoie
ICASSP (4)9