Edit Paper: Decomposing GR(1) Games with Singleton Liveness Guarantees for Efficient Synthesis

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

Enter the information required for the paper. Required information is marked with a *.

Title*:	Decomposing GR(1) Games with Singleton Liveness Guarantees for Efficient Synthesis
Authors*:	Sumanth Dathathri and Richard M. Murray
Source*:	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.
URL:
Type:
ID:
Tag:
Funding:
DOI:
Flags:

Summary:

This is a minor edit

Watch this page

Navigation menu