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

Kaitian Chen

dblp:399/4658 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 · 83% Trustworthy machine learning · 8% Motion planning and robot control · 8%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
maximum entropy reinforcement learning
1.012026
Safe Multi-Agent Reinforcement Learning via Distributional Safety Critic and Maximum Entropy Optimization · AAAI 2026
Machine learning › Reinforcement learning
multi-agent reinforcement learning
1.012026
Safe Multi-Agent Reinforcement Learning via Distributional Safety Critic and Maximum Entropy Optimization · AAAI 2026
Machine learning › Reinforcement learning › multi-agent reinforcement learning
safe multi-agent reinforcement learning
1.012026
Safe Multi-Agent Reinforcement Learning via Distributional Safety Critic and Maximum Entropy Optimization · AAAI 2026
Robotics › Motion planning and robot control › robot control › safe control
risk-aware control
0.312026
Safe Multi-Agent Reinforcement Learning via Distributional Safety Critic and Maximum Entropy Optimization · AAAI 2026
Machine learning › Trustworthy machine learning
robustness
0.312026
Safe Multi-Agent Reinforcement Learning via Distributional Safety Critic and Maximum Entropy Optimization · AAAI 2026

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

soft actor-critic · 1.0distributed safety critics · 1.0conditional value-at-risk · 1.0
YearPublicationVenuePosition
2026 Safe Multi-Agent Reinforcement Learning via Distributional Safety Critic and Maximum Entropy Optimization
abstract
Deploying multi-agent reinforcement learning (MARL) in safety-critical systems faces significant challenges due to insufficient agent exploration and inadequate safety constraint guarantees. Current approaches are constrained by two fundamental limitations: inefficient exploration leading to suboptimal policies, and expected-cost-based constraint frameworks failing to ensure full-process safety. To address these challenges, this paper proposes a novel safety-aware maximum entropy MARL framework using Conditional Value-at-Risk (CVaR) as a joint safety metric, which quantifies constraint satisfaction under worst-case scenarios for multi-agent systems. Moreover, we develop the Worst-Case Multi-Agent Soft Actor-Critic (WCMASAC) algorithm, incorporating sequential update mechanisms and maximum entropy optimization for heterogeneous agents, enhanced with distributed safety critics. Theoretically, we establish the monotonic improvement property, guaranteed constraint satisfaction, and convergence to a generalized Nash equilibrium for WCMASAC. Extensive experiments on Safety-Gymnasium based benchmarks demonstrate that WCMASAC outperforms state-of-the-art baselines in both task reward acquisition and safety constraint violation reduction, while exhibiting superior exploration efficiency and risk-aware control capabilities.
Lingyue Zhang, Kaitian Chen, Yunkai Lv, Huaicheng Yan 0001
AAAI4