Journal article · 2024 · Open access
Probabilistic Constraint for Safety-Critical Reinforcement Learning
IEEE Transactions on Automatic Control, 69(10), 6789–6804 · Published 19 March 2024 · DOI 10.1109/tac.2024.3379246
In brief
“Probabilistic Constraint for Safety-Critical Reinforcement Learning” is a 2024 journal article by Weiqin Chen and 2 co-authors, published in IEEE Transactions on Automatic Control. OpenAlex counts 36 citations as of 22 November 2026, which puts it in the top 6% of works published in 2024 by citations. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 36
- Most cited in
- 2026 (14)
- Field-weighted impact
- 2.63
- References
- 64
- Authors
- 3
Abstract
In this paper, we consider the problem of learning safe policies for probabilistic-constrained reinforcement learning (RL). Specifically, a safe policy or controller is one that, with high probability, maintains the trajectory of the agent in a given safe set. We establish a connection between this probabilisticconstrained setting and the cumulative-constrained formulation that is frequently explored in the existing literature. We provide theoretical bounds elucidating that the probabilistic-constrained setting offers a better trade-off in terms of optimality and safety (constraint satisfaction). The challenge encountered when dealing with the probabilistic constraints, as explored in this work, arises from the absence of explicit expressions for their gradients. Our prior work provides such an explicit gradient expression for probabilistic constraints which we term Safe Policy Gradient-REINFORCE (SPG-REINFORCE). In this work, we provide an improved gradient SPG-Actor-Critic that leads to a lower variance than SPG-REINFORCE, which is substantiated by our theoretical results. A noteworthy aspect of both SPGs is their inherent algorithm independence, rendering them versatile for application across a range of policy-based algorithms. Furthermore, we propose a Safe Primal-Dual algorithm that can leverage both SPGs to learn safe policies. It is subsequently followed by theoretical analyses that encompass the convergence of the algorithm, as well as the near-optimality and feasibility on average. In addition, we test the proposed approaches by a series of empirical experiments. These experiments aim to examine and analyze the inherent trade-offs between the optimality and safety, and serve to substantiate the efficacy of two SPGs, as well as our theoretical contributions.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Chen, W., Subramanian, D., & Paternain, S. (2024). Probabilistic Constraint for Safety-Critical Reinforcement Learning. IEEE Transactions on Automatic Control, 69(10), 6789–6804. https://doi.org/10.1109/tac.2024.3379246
MLA 9
Chen, Weiqin, et al. “Probabilistic Constraint for Safety-Critical Reinforcement Learning.” IEEE Transactions on Automatic Control, vol. 69, no. 10, 2024, pp. 6789–6804. https://doi.org/10.1109/tac.2024.3379246.
Chicago
Chen, Weiqin, Dharmashankar Subramanian, and Santiago Paternain. 2024. “Probabilistic Constraint for Safety-Critical Reinforcement Learning.” IEEE Transactions on Automatic Control 69 (10): 6789–6804. https://doi.org/10.1109/tac.2024.3379246.
Harvard
Chen, W., Subramanian, D. and Paternain, S. (2024) ‘Probabilistic Constraint for Safety-Critical Reinforcement Learning’, IEEE Transactions on Automatic Control, 69(10), pp. 6789–6804. doi:10.1109/tac.2024.3379246.
IEEE
W. Chen, D. Subramanian, and S. Paternain, “Probabilistic Constraint for Safety-Critical Reinforcement Learning,” IEEE Transactions on Automatic Control, vol. 69, no. 10, pp. 6789–6804, 2024, doi: 10.1109/tac.2024.3379246.
BibTeX
@article{chen2024probabilistic,
title = {{Probabilistic Constraint for Safety-Critical Reinforcement Learning}},
author = {Chen, Weiqin and Subramanian, Dharmashankar and Paternain, Santiago},
journal = {IEEE Transactions on Automatic Control},
year = {2024},
volume = {69},
number = {10},
pages = {6789--6804},
doi = {10.1109/tac.2024.3379246},
url = {https://doi.org/10.1109/tac.2024.3379246}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2023 | 3 | |
| 2024 | 6 | |
| 2025 | 13 | |
| 2026 | 14 |
Its field-weighted citation impact is 2.63: it has been cited 2.63 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- chance constraints
- gradient-based optimization
- variance reduction
- convergence analysis
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Chen, W., Subramanian, D., & Paternain, S. (2024). Probabilistic Constraint for Safety-Critical Reinforcement Learning. IEEE Transactions on Automatic Control, 69(10), 6789–6804. https://doi.org/10.1109/tac.2024.3379246
How many times has this paper been cited?
36 times, according to OpenAlex on 22 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Weiqin Chen, Dharmashankar Subramanian, Santiago Paternain.
What is the DOI of this paper?
10.1109/tac.2024.3379246, permanently at https://doi.org/10.1109/tac.2024.3379246. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 22 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.