Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhile Zhao

dblp:354/6455 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2024
0009-0000-4039-7960ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Reinforcement learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › deep reinforcement learning › visual reinforcement learning
generalization in visual reinforcement learning
0.712023
Improving Generalization in Visual Reinforcement Learning via Conflict-aware Gradient Agreement Augmentation · ICCV 2023
Machine learning › Reinforcement learning › deep reinforcement learning
visual reinforcement learning
0.712023
Improving Generalization in Visual Reinforcement Learning via Conflict-aware Gradient Agreement Augmentation · ICCV 2023
Machine learning › Reinforcement learning › policy optimization
policy gradient
0.212023
Improving Generalization in Visual Reinforcement Learning via Conflict-aware Gradient Agreement Augmentation · ICCV 2023

Methods — techniques the papers use, named apart from their topics

gradient surgery · 0.7gradient agreement · 0.7data augmentation · 0.7
YearPublicationVenuePosition
2024 Heterogeneous Robot Swarms with an Attention Mechanism for Dynamic Target Tracking
abstract
Multirobot collaboration offers significant potential for diverse applications, including tracking and surveillance. In this paper, we introduce an attention mechanism tailored for heterogeneous robot swarms characterized by varied sensing ranges. This mechanism effectively utilizes the swarm's intrinsic characteristics, enabling rapid information transmission and ensuring consistent collective responses to external stimuli. Additionally, we introduce a pigeon-inspired navigation strategy that effectively replaces the traditional obstacle repulsion term by preventing the swarm from becoming trapped in local min-ima and reducing oscillatory behaviors. To validate the efficacy of our algorithm, we have developed an autonomously designed PlusBot swarm platform, which consists of agile vibration-driven miniature robots. Each of them is equipped with its own computing and communication system and is capable of precise closed-loop motion control. This setup meets the requirements for conducting heterogeneous swarm movement experiments in indoor environments. Through comprehensive numerical simulations and real-world experiments, our method has demonstrated exceptional precision and adaptability in tracking dynamic targets. The comparative analysis under-scores the superiority of our approach, particularly in minimizing swarm collisions and ensuring safe navigation in dynamic target-tracking scenarios involving obstacles.
Ziqing Zhou, Chun Ouyang 0002, Xinyang Dong, Siao Liu, Linqiang Hu, Zhile Zhao, Zhongxue Gan 0001
SMC8
2024 DiffSkill: Improving Reinforcement Learning through diffusion-based skill denoiser for robotic manipulation
Siao Liu, Yang Liu 0246, Linqiang Hu, Ziqing Zhou, Zhile Zhao, Wei Li 0055, Zhongxue Gan 0001
Knowl. Based Syst.6
2023 Improving Generalization in Visual Reinforcement Learning via Conflict-aware Gradient Agreement Augmentation
abstract
Learning a policy with great generalization to unseen environments remains challenging but critical in visual reinforcement learning. Despite the success of augmentation combination in the supervised learning generalization, naively applying it to visual RL algorithms may damage the training efficiency, suffering from serve performance degradation. In this paper, we first conduct qualitative analysis and illuminate the main causes: (i) high-variance gradient magnitudes and (ii) gradient conflicts existed in various augmentation methods. To alleviate these issues, we propose a general policy gradient optimization framework, named Conflict-aware Gradient Agreement Augmentation (CG2A), and better integrate augmentation combination into visual RL algorithms to address the generalization bias. In particular, CG2A develops a Gradient Agreement Solver to adaptively balance the varying gradient magnitudes, and introduces a Soft Gradient Surgery strategy to alleviate the gradient conflicts. Extensive experiments demonstrate that CG2A significantly improves the generalization performance and sample efficiency of visual RL algorithms.
Siao Liu, Zhaoyu Chen 0001, Yang Liu 0246, Dingkang Yang, Zhile Zhao, Ziqing Zhou, Xie Yi, Wei Li 0055, Zhongxue Gan 0001
ICCV6