Peng Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Peng Liu has a total of 85 co-authors. Here are the top co-authors by number of shared publications:
- Wei Zhao
Harbin Institute of Technology
13 shared publications - Xianglong Tang
School of Computer Science and Technology, Harbin Institute of Technology, 92 West Dazhi Street, Nangang District, Harbin 150001, China
8 shared publications - Siyuan Li
Faculty of Computing, Harbin Institute of Technology, Harbin, China
7 shared publications - Chenjia Bai
Institute of Artificial Intelligence (TeleAI), China Telecom, Shanghai, China
5 shared publications - Lingxiao Wang
Northwestern University
5 shared publications - Ye Jin
Faculty of Computing, Harbin Institute of Technology, Harbin, China
4 shared publications
Latest Publications
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (6) , 6584-6591
Adaptive Visual-Tactile Fusion for Contact-Rich Dexterous Manipulation
Effective dexterous manipulation hinges on the dynamic integration of visual context with fine-grained tactile feedback. This remains a significant challenge, as existing methods often rely on static fusion strategies and struggle to learn from isolated tactile features. To address this, we propose a hardware-decoupled tactile representation that learns cross-finger spatial features by training a sparse Transformer on unified tactile images, enabling cross-device generalization. Furthermore, we introduce a tactile-activity-guided adaptive visual-tactile fusion mechanism that dynamically adjusts the influence of vision and touch, showing the contribution of touch feedback upon physical contact. We evaluate our method on a series of contact-rich manipulation tasks requiring fine force control. Experimental results show that our method has an average success rate of over 90%, demonstrating effectiveness compared to other methods. Further analysis shows that adaptive multimodal fusion is essential to complete the dexterous manipulation tasks. The videos can be viewed at https://avtf-dex.github.io.
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (6) , 6584-6591
Adaptive Visual-Tactile Fusion for Contact-Rich Dexterous Manipulation
Effective dexterous manipulation hinges on the dynamic integration of visual context with fine-grained tactile feedback. This remains a significant challenge, as existing methods often rely on static fusion strategies and struggle to learn from isolated tactile features. To address this, we propose a hardware-decoupled tactile representation that learns cross-finger spatial features by training a sparse Transformer on unified tactile images, enabling cross-device generalization. Furthermore, we introduce a tactile-activity-guided adaptive visual-tactile fusion mechanism that dynamically adjusts the influence of vision and touch, showing the contribution of touch feedback upon physical contact. We evaluate our method on a series of contact-rich manipulation tasks requiring fine force control. Experimental results show that our method has an average success rate of over 90%, demonstrating effectiveness compared to other methods. Further analysis shows that adaptive multimodal fusion is essential to complete the dexterous manipulation tasks. The videos can be viewed at https://avtf-dex.github.io.
- Open Access
MarsBird-VII: An Autonomous Stereo–Inertial Navigation System with Real-Time Optimization for a Mars Rotorcraft Space Drone
Reliable autonomous navigation for Tianwen-3-class Mars rotorcraft must satisfy both sampling-level accuracy and hard real-time execution under severe onboard computational constraints. To address this challenge, we develop MarsBird-VII, a mission-constrained stereo visual–inertial navigation system that combines a computation-aware vision front-end with a Parity-Window sliding-window optimization back-end. The front-end decouples high-rate tracking from feature replenishment to bound perception latency, while the back-end alternates updates over interleaved state subsets and preserves full-window coupling through unified marginalization. Unlike simply reducing the sliding-window size, the proposed strategy reduces the per-update optimization cost without shrinking the geometric observation horizon, thereby improving the accuracy–runtime trade-off for embedded avionics. Earth-analog flight experiments demonstrate strong navigation performance under mission-relevant conditions. In full-sequence evaluation, the proposed system achieves an SE(3)-aligned translation APE of 0.31 m RMSE/0.47 m Max and further reaches 0.06 m RMSE/0.15 m Max on a nominal stable segment. Runtime profiling over 5000+ update cycles shows that the Parity-Window back-end keeps the maximum optimization latency below 58.32 ms, satisfying the 66.7 ms hard real-time deadline while maintaining accuracy close to full-window optimization. These results show that the proposed system provides a practical balance of accuracy, robustness, and deterministic real-time performance for Tianwen-3-class Mars rotorcraft navigation.
Open AccessMarsBird-VII: An Autonomous Stereo–Inertial Navigation System with Real-Time Optimization for a Mars Rotorcraft Space Drone
Reliable autonomous navigation for Tianwen-3-class Mars rotorcraft must satisfy both sampling-level accuracy and hard real-time execution under severe onboard computational constraints. To address this challenge, we develop MarsBird-VII, a mission-constrained stereo visual–inertial navigation system that combines a computation-aware vision front-end with a Parity-Window sliding-window optimization back-end. The front-end decouples high-rate tracking from feature replenishment to bound perception latency, while the back-end alternates updates over interleaved state subsets and preserves full-window coupling through unified marginalization. Unlike simply reducing the sliding-window size, the proposed strategy reduces the per-update optimization cost without shrinking the geometric observation horizon, thereby improving the accuracy–runtime trade-off for embedded avionics. Earth-analog flight experiments demonstrate strong navigation performance under mission-relevant conditions. In full-sequence evaluation, the proposed system achieves an SE(3)-aligned translation APE of 0.31 m RMSE/0.47 m Max and further reaches 0.06 m RMSE/0.15 m Max on a nominal stable segment. Runtime profiling over 5000+ update cycles shows that the Parity-Window back-end keeps the maximum optimization latency below 58.32 ms, satisfying the 66.7 ms hard real-time deadline while maintaining accuracy close to full-window optimization. These results show that the proposed system provides a practical balance of accuracy, robustness, and deterministic real-time performance for Tianwen-3-class Mars rotorcraft navigation.
- Top Cited Papers
- 23 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 324
A knowledge-guided multimodal network for video summarization
- 23 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 324
Top Cited PapersA knowledge-guided multimodal network for video summarization
- Open Access
- 10 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Autonomous and Adaptive Systems
- Vol. 21 (1) , 1-20
An Imitative Reinforcement Learning Framework for Pursuit-Lock-Launch Missions
Unmanned combat aerial vehicle (UCAV) within-visual-range (WVR) engagement, referring to a fight between two or more UCAVs at close quarters, plays a decisive role on the aerial battlefields. With the development of artificial intelligence, WVR engagement progressively advances toward intelligent and autonomous modes. However, autonomous WVR engagement policy learning is hindered by challenges such as weak exploration capabilities, low learning efficiency, and unrealistic simulated environments. To overcome these challenges, we propose a novel imitative reinforcement learning framework, which efficiently leverages expert data while enabling autonomous exploration. The proposed framework not only enhances learning efficiency through expert imitation but also ensures adaptability to dynamic environments via autonomous exploration with reinforcement learning. Therefore, the proposed framework can learn a successful policy of “pursuit-lock-launch” for UCAVs. To support data-driven learning, we establish an environment based on the Harfang3D sandbox. The extensive experimental results indicate that the proposed framework excels in this multistage task and significantly outperforms state-of-the-art reinforcement learning and imitation learning methods. Thanks to the ability of imitating experts and autonomous exploration, our framework can quickly learn the critical knowledge in complex aerial combat tasks, achieving up to a 100% success rate and demonstrating excellent robustness.
- 10 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Autonomous and Adaptive Systems
- Vol. 21 (1) , 1-20
Open AccessAn Imitative Reinforcement Learning Framework for Pursuit-Lock-Launch Missions
Unmanned combat aerial vehicle (UCAV) within-visual-range (WVR) engagement, referring to a fight between two or more UCAVs at close quarters, plays a decisive role on the aerial battlefields. With the development of artificial intelligence, WVR engagement progressively advances toward intelligent and autonomous modes. However, autonomous WVR engagement policy learning is hindered by challenges such as weak exploration capabilities, low learning efficiency, and unrealistic simulated environments. To overcome these challenges, we propose a novel imitative reinforcement learning framework, which efficiently leverages expert data while enabling autonomous exploration. The proposed framework not only enhances learning efficiency through expert imitation but also ensures adaptability to dynamic environments via autonomous exploration with reinforcement learning. Therefore, the proposed framework can learn a successful policy of “pursuit-lock-launch” for UCAVs. To support data-driven learning, we establish an environment based on the Harfang3D sandbox. The extensive experimental results indicate that the proposed framework excels in this multistage task and significantly outperforms state-of-the-art reinforcement learning and imitation learning methods. Thanks to the ability of imitating experts and autonomous exploration, our framework can quickly learn the critical knowledge in complex aerial combat tasks, achieving up to a 100% success rate and demonstrating excellent robustness.
- 15 January 2026
- Published by Springer Nature
- p. 292-305
ML-NC-TTT: Multi-layer Noise Contrastive Learning for Test-Time Training
- 15 January 2026
- Published by Springer Nature
- p. 292-305
ML-NC-TTT: Multi-layer Noise Contrastive Learning for Test-Time Training
- 26 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 13728-13740
Auxiliary Reward Generation With Transition Distance Representation Learning
Reinforcement learning (RL) has shown strengths in challenging sequential decision-making problems. The reward function in RL is crucial to the learning performance, as it quantifies the degree of task completion. In real-world problems, the rewards are predominantly human-designed, which requires laborious tuning, and is susceptible to human cognitive biases. To achieve automatic auxiliary reward generation, we propose a novel representation learning approach that can measure the “transition distance” between states. Building upon these representations, we introduce an auxiliary reward generation technique for both single-task and skill-chaining scenarios without the need for human knowledge. Furthermore, we theoretically show that the proposed auxiliary rewards maintain the policy invariance property, i.e., the generated rewards will not hurt the policy optimality under the original rewards. In the experiment section, we evaluate the proposed approach in both online and offline learning settings in a wide range of tasks, including robot manipulation and locomotion. The experiment results demonstrate the effectiveness of measuring the transition distance and the induced improvement by auxiliary rewards, which promotes better learning efficiency and increases convergent stability. Beyond that, we demonstrate that the learned manipulation policy with the auxiliary rewards in a simulator can be transferred to the real robot, as shown in https://sites.google.com/view/transition-distance-rp/tdrp.
- 26 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 13728-13740
Auxiliary Reward Generation With Transition Distance Representation Learning
Reinforcement learning (RL) has shown strengths in challenging sequential decision-making problems. The reward function in RL is crucial to the learning performance, as it quantifies the degree of task completion. In real-world problems, the rewards are predominantly human-designed, which requires laborious tuning, and is susceptible to human cognitive biases. To achieve automatic auxiliary reward generation, we propose a novel representation learning approach that can measure the “transition distance” between states. Building upon these representations, we introduce an auxiliary reward generation technique for both single-task and skill-chaining scenarios without the need for human knowledge. Furthermore, we theoretically show that the proposed auxiliary rewards maintain the policy invariance property, i.e., the generated rewards will not hurt the policy optimality under the original rewards. In the experiment section, we evaluate the proposed approach in both online and offline learning settings in a wide range of tasks, including robot manipulation and locomotion. The experiment results demonstrate the effectiveness of measuring the transition distance and the induced improvement by auxiliary rewards, which promotes better learning efficiency and increases convergent stability. Beyond that, we demonstrate that the learned manipulation policy with the auxiliary rewards in a simulator can be transferred to the real robot, as shown in https://sites.google.com/view/transition-distance-rp/tdrp.
- Open Access
SkillTree: Explainable Skill-Based Deep Reinforcement Learning for Long-Horizon Control Tasks
Deep reinforcement learning (DRL) has achieved remarkable success in various research domains. However, its reliance on neural networks results in a lack of transparency, which limits its practical applications. To achieve explainability, decision trees have emerged as a popular and promising alternative to neural networks. Nonetheless, due to their limited expressiveness, traditional decision trees struggle with high-dimensional long-horizon continuous control tasks. In this paper, we proposes SkillTree, a novel framework that reduces complex continuous action spaces into discrete skill spaces. Our hierarchical approach integrates a differentiable decision tree within the high-level policy to generate skill embeddings, which subsequently guide the low-level policy in executing skills. By making skill decisions explainable, we achieve skill-level explainability, enhancing the understanding of the decision-making process in complex tasks. Experimental results demonstrate that our method achieves performance comparable to skill-based neural networks in complex robotic arm control domains. Furthermore, SkillTree offers explanations at the skill level, thereby increasing the transparency of the decision-making process.
Open AccessSkillTree: Explainable Skill-Based Deep Reinforcement Learning for Long-Horizon Control Tasks
Deep reinforcement learning (DRL) has achieved remarkable success in various research domains. However, its reliance on neural networks results in a lack of transparency, which limits its practical applications. To achieve explainability, decision trees have emerged as a popular and promising alternative to neural networks. Nonetheless, due to their limited expressiveness, traditional decision trees struggle with high-dimensional long-horizon continuous control tasks. In this paper, we proposes SkillTree, a novel framework that reduces complex continuous action spaces into discrete skill spaces. Our hierarchical approach integrates a differentiable decision tree within the high-level policy to generate skill embeddings, which subsequently guide the low-level policy in executing skills. By making skill decisions explainable, we achieve skill-level explainability, enhancing the understanding of the decision-making process in complex tasks. Experimental results demonstrate that our method achieves performance comparable to skill-based neural networks in complex robotic arm control domains. Furthermore, SkillTree offers explanations at the skill level, thereby increasing the transparency of the decision-making process.
- Open Access
- 4 November 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (21) , 3440
Joint Learning of Volume Scheduling and Order Placement Policies for Optimal Order Execution
Order execution is an extremely important problem in the financial domain, and recently, more and more researchers have tried to employ reinforcement learning (RL) techniques to solve this challenging problem. There are a lot of difficulties for conventional RL methods to tackle the order execution problem, such as the large action space including price and quantity, and the long-horizon property. As naturally order execution is composed of a low-frequency volume scheduling stage and a high-frequency order placement stage, most existing RL-based order execution methods treat these stages as two distinct tasks and offer a partial solution by addressing either one individually. However, the current literature fails to model the non-negligible mutual influence between these two tasks, leading to impractical order execution solutions. To address these limitations, we propose a novel automatic order execution approach based on the hierarchical RL framework (OEHRL), which jointly learns the policies for volume scheduling and order placement. OEHRL first extracts the state embeddings at both the macro and micro levels with a sequential variational auto-encoder model. Based on the effective embeddings, OEHRL generates a hindsight expert dataset, which is used to train a hierarchical order execution policy. In the hierarchical structure, the high-level policy is in charge of the target volume and the low-level learns to determine the prices for a series of the allocated sub-orders from the high level. These two levels collaborate seamlessly and contribute to the optimal order execution policy. Extensive experiment results on 200 stocks across the US and China A-share markets validate the effectiveness of the proposed approach.
- 4 November 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (21) , 3440
Open AccessJoint Learning of Volume Scheduling and Order Placement Policies for Optimal Order Execution
Order execution is an extremely important problem in the financial domain, and recently, more and more researchers have tried to employ reinforcement learning (RL) techniques to solve this challenging problem. There are a lot of difficulties for conventional RL methods to tackle the order execution problem, such as the large action space including price and quantity, and the long-horizon property. As naturally order execution is composed of a low-frequency volume scheduling stage and a high-frequency order placement stage, most existing RL-based order execution methods treat these stages as two distinct tasks and offer a partial solution by addressing either one individually. However, the current literature fails to model the non-negligible mutual influence between these two tasks, leading to impractical order execution solutions. To address these limitations, we propose a novel automatic order execution approach based on the hierarchical RL framework (OEHRL), which jointly learns the policies for volume scheduling and order placement. OEHRL first extracts the state embeddings at both the macro and micro levels with a sequential variational auto-encoder model. Based on the effective embeddings, OEHRL generates a hindsight expert dataset, which is used to train a hierarchical order execution policy. In the hierarchical structure, the high-level policy is in charge of the target volume and the low-level learns to determine the prices for a series of the allocated sub-orders from the high level. These two levels collaborate seamlessly and contribute to the optimal order execution policy. Extensive experiment results on 200 stocks across the US and China A-share markets validate the effectiveness of the proposed approach.
- 15 June 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 255
Curriculum adaptation method based on graph neural networks for universal domain adaptation
- 15 June 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 255
Curriculum adaptation method based on graph neural networks for universal domain adaptation
- Open Access
Variational Dynamic for Self-Supervised Exploration in Deep Reinforcement Learning
Efficient exploration remains a challenging problem in reinforcement learning, especially for tasks where extrinsic rewards from environments are sparse or even totally disregarded. Significant advances based on intrinsic motivation show promising results in simple environments but often get stuck in environments with multimodal and stochastic dynamics. In this work, we propose a variational dynamic model based on the conditional variational inference to model the multimodality and stochasticity. We consider the environmental state-action transition as a conditional generative process by generating the next-state prediction under the condition of the current state, action, and latent variable, which provides a better understanding of the dynamics and leads a better performance in exploration. We derive an upper bound of the negative log-likelihood of the environmental transition and use such an upper bound as the intrinsic reward for exploration, which allows the agent to learn skills by self-supervised exploration without observing extrinsic rewards. We evaluate the proposed method on several image-based simulation tasks and a real robotic manipulating task. Our method outperforms several state-of-the-art environment model-based exploration approaches.
Open AccessVariational Dynamic for Self-Supervised Exploration in Deep Reinforcement Learning
Efficient exploration remains a challenging problem in reinforcement learning, especially for tasks where extrinsic rewards from environments are sparse or even totally disregarded. Significant advances based on intrinsic motivation show promising results in simple environments but often get stuck in environments with multimodal and stochastic dynamics. In this work, we propose a variational dynamic model based on the conditional variational inference to model the multimodality and stochasticity. We consider the environmental state-action transition as a conditional generative process by generating the next-state prediction under the condition of the current state, action, and latent variable, which provides a better understanding of the dynamics and leads a better performance in exploration. We derive an upper bound of the negative log-likelihood of the environmental transition and use such an upper bound as the intrinsic reward for exploration, which allows the agent to learn skills by self-supervised exploration without observing extrinsic rewards. We evaluate the proposed method on several image-based simulation tasks and a real robotic manipulating task. Our method outperforms several state-of-the-art environment model-based exploration approaches.