Kechun Xu

Kechun Xu

Auto-generated profile, based on publicly available information

Kechun Xu

State Key Laboratory of Industrial Control and Technology and the Institute of Cyber-Systems and Control, Zhejiang University, Hangzhou, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 November 2022
Verified
Book Chapter
Closed access
PDF file
ZLZizhang Li
Zizhang Li
MWMengmeng Wang
Mengmeng Wang
HPHuaijin Pi
Huaijin Pi
KXKechun Xu
Kechun Xu
JMJianbiao Mei
Jianbiao Mei
YLYong Liu
Yong Liu

25 June 2021 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
KXKechun Xu
Kechun Xu
HYHongxiang Yu
Hongxiang Yu
QLQianen Lai
Qianen Lai
Yue WangYue Wang
Yue Wang
RXRong Xiong
Rong Xiong
We focus on the task of goal-oriented grasping, in which a robot is supposed to grasp a pre-assigned goal object in clutter and needs some pre-grasp actions such as pushes to enable stable grasps. However, in this task, the robot gets positive rewards from environment only when successfully grasping the goal object. Besides, joint pushing and grasping elongates the action sequence, compounding the problem of reward delay. Thus, sample inefficiency remains a main challenge in this task. In this paper, a goal-conditioned hierarchical reinforcement learning formulation with high sample efficiency is proposed to learn a push-grasping policy for grasping a specific object in clutter. In our work, sample efficiency is improved by two means. First, we use a goal-conditioned mechanism by goal relabeling to enrich the replay buffer. Second, the pushing and grasping policies are respectively regarded as a generator and a discriminator and the pushing policy is trained with supervision of the grasping discriminator, thus densifying pushing rewards. To deal with the problem of distribution mismatch caused by different training settings of two policies, an alternating training stage is added to learn pushing and grasping in turn. A series of experiments carried out in simulation and real world indicate that our method can quickly learn effective pushing and grasping policies and outperforms existing methods in task completion rate and goal grasp success rate by less times of motion. Furthermore, we validate that our system can also adapt to goal-agnostic conditions with better performance. Note that our system can be transferred to the real world without any fine-tuning.

19 November 2024 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
KXKechun Xu
Kechun Xu
ZZZhongxiang Zhou
Zhongxiang Zhou
JWJun Wu
Jun Wu
Haojian LUHaojian LU
Haojian LU
RXRong Xiong
Rong Xiong
Yue WangYue Wang
Yue Wang
We focus on the task of unknown object rearrangement, where a robot is supposed to reconfigure the objects into a desired goal configuration specified by an RGB-D image. Recent works explore unknown object rearrangement systems by incorporating learning-based perception modules. However, they are sensitive to perception error, and pay less attention to task-level performance. In this article, we aim to develop an effective system for unknown object rearrangement amidst perception noise. We theoretically reveal that the noisy perception impacts grasp and place in a decoupled way, and show such a decoupled structure is valuable to improve task optimality. We propose grasp, see, and place (GSP), a dual-loop system with the decoupled structure as prior. For the inner loop, we learn a see policy for self-confident in-hand object matching. For the outer loop, we learn a grasp policy aware of object matching and grasp capability guided by task-level rewards. We leverage the foundation model CLIP for object matching, policy learning, and self-termination. A series of experiments indicate that GSP can conduct unknown object rearrangement with higher completion rates and fewer steps.

21 June 2023 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
HYHongxiang Yu
Hongxiang Yu
ACAnzhe Chen
Anzhe Chen
KXKechun Xu
Kechun Xu
ZZZhongxiang Zhou
Zhongxiang Zhou
WJWei Jing
Wei Jing
RXRong Xiong
Rong Xiong
Recently, several works achieve end-to-end visual servoing (VS) for robotic manipulation by replacing traditional controller with differentiable neural networks, but lose the ability to servo arbitrary desired poses. This letter proposes a differentiable architecture for arbitrary pose servoing: a hyper-network based neural controller (HPN-NC). To achieve this, HPN-NC consists of a hyper net and a low-level controller, where the hyper net learns to generate the parameters of the low-level controller and the controller uses the 2D keypoints error for control like traditional image-based visual servoing (IBVS). HPN-NC can complete 6 $^{\circ }$ of freedom visual servoing with large initial offset. Taking advantage of the fully differentiable nature of HPN-NC, we provide a three-stage training procedure to servo real world objects. With self-supervised end-to-end training, the performance of the integrated model can be further improved in unseen scenes and the amount of manual annotations can be significantly reduced.

5 September 2025 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
KXKechun Xu
Kechun Xu
XXXunlong Xia
Xunlong Xia
KWKaixuan Wang
Kaixuan Wang
YYYifei Yang
Yifei Yang
YMYunxuan Mao
Yunxuan Mao
Yue WangYue Wang
Yue Wang
We study the task of language-conditioned pick and place in clutter, where a robot should grasp a target object in open clutter and move it to a specified place. Some approaches learn end-to-end policies with features from vision foundation models, requiring large datasets. Others combine foundation models in a zero-shot setting, suffering from cascading errors. In addition, they primarily leverage vision and language foundation models, focusing less on action priors. In this paper, we aim to develop an effective policy by integrating foundation priors from vision, language, and action. We propose A2, an action prior alignment method that aligns unconditioned action priors with 3D vision-language priors by learning one attention layer. The alignment formulation enables our policy to train with less data and preserve zero-shot generalization capabilities. We show that a shared policy for both pick and place actions enhances the performance for each task, and introduce a policy adaptation scheme to accommodate the multi-modal nature of actions. Extensive experiments in simulation and the real-world show that our policy achieves higher task success rates with fewer steps for both pick and place tasks in clutter, effectively generalizing to unseen objects and language instructions. Videos and codes are available at https://xukechun.github.io/papers/A2.

4 June 2026 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
LLLongzhong Lin
Longzhong Lin
XLXuewu Lin
Xuewu Lin
KXKechun Xu
Kechun Xu
Haojian LUHaojian LU
Haojian LU
LHLichao Huang
Lichao Huang
Yue WangYue Wang
Yue Wang
Simulation plays a crucial role in assessing autonomous driving systems, where the generation of realistic multi-agent behaviors is a key aspect. In multi-agent simulation, the primary challenges include behavioral multimodality and closed-loop distributional shifts. In this study, we formulate a unified mixture model (UniMM) framework revisit mixture models for generating multimodal agent behaviors, which can cover the mainstream methods including regression-based continuous mixture models and discrete NTP GPT-like discrete models. Furthermore, we introduce a closed-loop sample generation approach tailored for mixture models to mitigate distributional shifts. Within the UniMM framework, we recognize critical configurations from both the model and data perspectives. We conduct a systematic examination of various model configurations, and comprehensively characterize their effects including positive component matching, continuous regression, prediction horizon, and the number of components. Moreover, our investigation into the data configuration highlights the pivotal role of closed-loop samples in achieving realistic simulations. To extend the benefits of closed-loop samples across a broader range of mixture models, we further introduce a temporal disentanglement-and-alignment mechanism to address the shortcut learning and off-policy learning issues. Leveraging insights from our exploration, the distinct variants proposed within the UniMM framework, including discrete, anchor-free, and anchor-based models, all achieve state-of-the-art performance on the WOSAC benchmark.