Contents Menu Expand Light mode Dark mode Auto light/dark, in light mode Auto light/dark, in dark mode Skip to content
Multi and Single Agent Safe Reinforcement Learning
Multi and Single Agent Safe Reinforcement Learning

Get Started

  • Quick Start
  • Core Concepts
    • Labelling Function
    • Cost Function
  • Basic Usage

Common API

  • Constraints
    • Constrained Markov Decision Process (CMDP)
    • Linear Temporal Logic (LTL) Safety Constraint
    • Probabilistic Computation Tree Logic (PCTL) Constraint
    • Step-wise Probabilistic Constraint
    • Reach-avoid Constraint
    • Multi Agent Constraints
      • Alternating-Time Temporal Logic (ATL) Safety
  • Wrappers
    • Core Wrappers
    • Misc Wrappers
    • Vectorized Envs
  • Metrics
    • Logging
  • Linear Temporal Logic (LTL)
    • Propositional Formula
    • DFA
    • Cost Function as a DFA
    • Shaped Cost Function
  • Probabilistic Computation Tree Logic (PCTL)

Environments

  • Multi Agent
    • Parallel Multi Agent Environments
      • Markov Stag Hunt
      • Prisoners Dilemma
      • Battle of the Sexes
    • Turn-Based (AEC) Multi Agent Environments
  • Single Agent
    • Pacman

Algorithms

  • PPO Lagrangian
  • Constrained Policy Optimization

Tutorials

  • Basics
  • Constraints
  • LTL-Safety
  • Wrappers
  • Environments
  • Algorithms

Misc

  • Probabilistic Shielding
Back to top
View this page
Edit this page

Multi Agent ConstraintsΒΆ

Here, we consider constraints only applicable to multi-agent environments.

  • Alternating-Time Temporal Logic (ATL) Safety
Next
Alternating-Time Temporal Logic (ATL) Safety
Previous
Reach-avoid Constraint
Copyright © 2025, Alexander Goodall, Edwin Hamel De Le Court, Omar Adalat, Francesco Belardinelli
Made with Sphinx and @pradyunsg's Furo