Decomposing GR(1) Games with Singleton Liveness Guarantees for Efficient Synthesis: Difference between revisions
From Murray Wiki
Jump to navigationJump to search
(Created page with "{{Paper |Title=Decomposing GR(1) Games with Singleton Liveness Guarantees for Efficient Synthesis |Authors=Sumanth Dathathri and Richard M. Murray |Source=Submitted, 2017 Conf...") |
No edit summary |
||
| Line 6: | Line 6: | ||
|URL=http://www.cds.caltech.edu/~murray/preprints/dm17-cdc_s.pdf | |URL=http://www.cds.caltech.edu/~murray/preprints/dm17-cdc_s.pdf | ||
|Type=Conference paper | |Type=Conference paper | ||
|ID= | |ID=2017b | ||
|Tag=dm17-cdc | |Tag=dm17-cdc | ||
|Funding=SRC TerraSwarm | |Funding=SRC TerraSwarm | ||
}} | }} | ||
Revision as of 07:35, 22 March 2017
| Title | Decomposing GR(1) Games with Singleton Liveness Guarantees for Efficient Synthesis |
|---|---|
| Authors | Sumanth Dathathri and Richard M. Murray |
| Source | Submitted, 2017 Conference on Decision and Control (CDC) |
| Abstract | Temporal logic based synthesis approaches are often used to find trajectories that are correct-by-construction in systems–eg. synchronization for multi-agent hybrid systems, reactive motion planning for robots. However, the scalability of such approaches is of concern and at times a bottleneck when transitioning from theory to practice. In this paper, we identify a class of problems in the GR(1) fragment of linear-time temporal logic (LTL) where the synthesis problem allows for a decomposition that enables easy parallelization. This decomposition also reduces the alternation depth, resulting in more efficient synthesis. A multi-agent robot gridworld example with coordination tasks is presented to demonstrate the application of the developed ideas and also to perform empirical analysis for benchmarking the decomposition-based synthesis approach. |
| Type | Conference paper |
| URL | http://www.cds.caltech.edu/~murray/preprints/dm17-cdc s.pdf |
| DOI | |
| Tag | dm17-cdc |
| ID | 2017b |
| Funding | SRC TerraSwarm |
| Flags |
