Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence 2021
DOI: 10.24963/ijcai.2021/565
|View full text |Cite
|
Sign up to set email alerts
|

LTL-Constrained Steady-State Policy Synthesis

Abstract: Decision-making policies for agents are often synthesized with the constraint that a formal specification of behaviour is satisfied. Here we focus on infinite-horizon properties. On the one hand, Linear Temporal Logic (LTL) is a popular example of a formalism for qualitative specifications. On the other hand, Steady-State Policy Synthesis (SSPS) has recently received considerable attention as it provides a more quantitative and more behavioural perspective on specifications, in terms of the frequency with wh… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…The problem of computing a deterministic strategy achieving a given invariant distribution has been shown NP-hard and solvable by integer programming in (Velasquez et al 2023). More recently, steady-state strategy synthesis under LTL constraints has been solved in (Křetínský 2021).…”
Section: Related Workmentioning
confidence: 99%
“…The problem of computing a deterministic strategy achieving a given invariant distribution has been shown NP-hard and solvable by integer programming in (Velasquez et al 2023). More recently, steady-state strategy synthesis under LTL constraints has been solved in (Křetínský 2021).…”
Section: Related Workmentioning
confidence: 99%