2019
DOI: 10.1109/lra.2018.2889191
|View full text |Cite
|
Sign up to set email alerts
|

Automated Abstraction of Manipulation Domains for Cost-Based Reactive Synthesis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
2
1
1

Relationship

2
8

Authors

Journals

citations
Cited by 19 publications
(9 citation statements)
references
References 19 publications
0
9
0
Order By: Relevance
“…LTL of finite traces (LTL f ) (De Giacomo and Vardi, 2013) and co-safe LTL (scLTL) (Kupferman and Vardi, 2001) are an efficient fragment of LTL designed to analyze and verify finite properties. Since robotic tasks usually have a defined ending criterion, LTL f and scLTL are well suited as a specification language in task planning (Wells et al, 2020;He et al, 2019He et al, , 2018He et al, , 2015Vasilopoulos et al, 2021;Lacerda et al, 2014;Schillinger et al, 2018). All classical LTL definitions or fragments thereof rely on discrete time and Boolean predicates, but some define quantitative predicates (Li et al, 2017) or robustness metrics (Vasile et al, 2017;Tumova et al, 2013).…”
Section: Temporal Logics In Roboticsmentioning
confidence: 99%
“…LTL of finite traces (LTL f ) (De Giacomo and Vardi, 2013) and co-safe LTL (scLTL) (Kupferman and Vardi, 2001) are an efficient fragment of LTL designed to analyze and verify finite properties. Since robotic tasks usually have a defined ending criterion, LTL f and scLTL are well suited as a specification language in task planning (Wells et al, 2020;He et al, 2019He et al, , 2018He et al, , 2015Vasilopoulos et al, 2021;Lacerda et al, 2014;Schillinger et al, 2018). All classical LTL definitions or fragments thereof rely on discrete time and Boolean predicates, but some define quantitative predicates (Li et al, 2017) or robustness metrics (Vasile et al, 2017;Tumova et al, 2013).…”
Section: Temporal Logics In Roboticsmentioning
confidence: 99%
“…Synthesis: Work in synthesis for robotics from temporal logic specifications (Kress-Gazit et al 2018) allows us to specify a reactive high-level task for a robot and produce either a strategy guaranteed to succeed, or a proof that the task cannot be accomplished (e.g. (Lahijanian et al 2012;He et al 2018;Wongpiromsarn et al 2010;DeCastro and Kress-Gazit 2016;Kress-Gazit et al 2009;He et al 2019)).…”
Section: Related Workmentioning
confidence: 99%
“…We further envision that our tools can be used for applications beyond ADAS/AV. For example, in robot manipulation problems where mission requirements are already described in temporal logic (e.g., see [31] and [32]).…”
Section: Introductionmentioning
confidence: 99%