mlsanityData to 14 Oct 2026

Dual-Objective Reinforcement Learning with Novel Hamilton-Jacobi-Bellman Formulations

arXiv 2506.16016 ↗First posted 19 Jun 2025cs.AI cs.SY eess.SYcited by 3

On the map: Deep reinforcement learning methods → RL theory and sample complexity

Abstract (arXiv)

Hard constraints in reinforcement learning (RL) often degrade policy performance. Lagrangian methods offer a way to blend objectives with constraints, but require intricate reward engineering and parameter tuning. In this work, we extend recent advances that connect Hamilton-Jacobi (HJ) equations with RL to propose two novel value functions for dual-objective satisfaction. Namely, we address: 1) the Reach-Always-Avoid (RAA) problem -- of achieving distinct reward and penalty thresholds -- and 2) the Reach-Reach (RR) problem -- of achieving thresholds of two distinct rewards. In contrast with temporal logic approaches, which typically involve representing an automaton, we derive explicit, tractable Bellman forms in this context via decomposition. Specifically, we prove that the RAA and RR problems may be rewritten as compositions of previously studied HJ-RL problems. We leverage our analysis to propose a variation of Proximal Policy Optimization (DOHJ-PPO), and demonstrate that it produces distinct behaviors from previous approaches, outcompeting a number of baselines in success, safety and speed across a range of tasks for safe-arrival and multi-target achievement.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 36 of its 58 references that are in the map. First posted on arXiv 19 Jun 2025.

Builds on

36 of 58 references.

Closest ancestors · 1

Same direction, newest first

  1. 2024Solving Minimum-Cost Reach Avoid using Reinforcement Learning29 Oct

Other references · 35

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,745
  3. 2017Constrained Policy Optimizationcited by 983
  4. 2020Responsive Safety in Reinforcement Learning by PID Lagrangian Methodscited by 316
  5. 2016Control Barrier Function Based Quadratic Programs for Safety Critical Systemscited by 287
  6. 2018Multi-Goal Reinforcement Learning: Challenging Robotics Environments and Request for Researchcited by 260
  7. 2022Contrastive Learning as Goal-Conditioned Reinforcement Learningcited by 253
  8. 2020Projection-Based Constrained Policy Optimizationcited by 203
  9. 2019A Generalized Algorithm for Multi-Objective Reinforcement Learning and Policy Adaptationcited by 177
  10. 2015Risk-Sensitive and Robust Decision-Making: a CVaR Optimization Approachcited by 170
  11. 2022Goal-Conditioned Reinforcement Learning: Problems and Solutionscited by 158
  12. 2021Goal-Conditioned Reinforcement Learning with Imagined Subgoalscited by 134
23 more
  1. 2016Reinforcement Learning With Temporal Logic Rewardscited by 117
  2. 2020Safe Reinforcement Learning in Constrained Markov Decision Processescited by 115
  3. 2018Dynamic Weights in Multi-Objective Deep Reinforcement Learningcited by 100
  4. 2020Learning with AMIGo: Adversarially Motivated Intrinsic Goalscited by 88
  5. 2016Multi-Objective Deep Reinforcement Learningcited by 83
  6. 2019Keeping Your Distance: Solving Sparse Reward Tasks Using Self-Balancing Shaped Rewardscited by 78
  7. 2022How Far I'll Go: Offline Goal-Conditioned Reinforcement Learning via f-Advantage Regressioncited by 66
  8. 2022Reachability Constrained Reinforcement Learningcited by 59
  9. 2017Hybrid Reward Architecture for Reinforcement Learningcited by 58
  10. 2019Exploration via Hindsight Goal Generationcited by 54
  11. 2014A Learning Based Approach to Control Synthesis of Markov Decision Processes for Linear Temporal Logic Specificationscited by 49
  12. 2021Safety and Liveness Guarantees through Reach-Avoid Reinforcement Learningcited by 49
  13. 2014Reach-Avoid Problems with Time-Varying Dynamics, Targets and Constraintscited by 44
  14. 2021A Primal-Dual Approach to Constrained Markov Decision Processescited by 42
  15. 2014Verification of Markov Decision Processes using Learning Algorithmscited by 39
  16. 2021A Simple Reward-free Approach to Constrained Reinforcement Learningcited by 30
  17. 2023Solving Stabilize-Avoid Optimal Control via Epigraph Form and Deep Reinforcement Learningcited by 24
  18. 2021Faster Algorithm and Sharper Analysis for Constrained Markov Decision Processcited by 19
  19. 2022Safe Model-Based Reinforcement Learning with an Uncertainty-Aware Reachability Certificatecited by 18
  20. 2024Constrained Reinforcement Learning with Smoothed Log Barrier Functioncited by 15
  21. 2023Learning Stabilization Control from Observations by Learning Lyapunov-like Proxy Modelscited by 10
  22. 2023Consistent Aggregation of Objectives with Diverse Time Preferences Requires Non-Markovian Rewardscited by 8
  23. 2023Reinforcement Learning with Non-Cumulative Objectivecited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024On the Limitations of Markovian Rewards to Express Multi-Objective, Risk-Sensitive, and Modal Tasks
  2. 2026Unifying Hamilton-Jacobi Reachability and Reinforcement Learning
  3. 2024A Dual Perspective of Reinforcement Learning for Imposing Policy Constraints
  4. 2026Mathematical methods of reinforcement learning
  5. 2021On Multi-objective Policy Optimization as a Tool for Reinforcement Learning: Case Studies in Offline RL and Finetuning
  6. 2026Deterministic Pareto-Optimal Policy Synthesis for Multi-Objective Reinforcement Learning
  7. 2026Certifying Hamilton-Jacobi Reachability Learned via Reinforcement Learning
  8. 2024A General Control-Theoretic Approach for Reinforcement Learning: Theory and Algorithms