https://murray.cds.caltech.edu/index.php?title=Optimal_Control_of_Non-deterministic_Systems_for_a_Computationally_Efficient_Fragment_of_Temporal_Logic&feed=atom&action=historyOptimal Control of Non-deterministic Systems for a Computationally Efficient Fragment of Temporal Logic - Revision history2022-08-13T21:33:06ZRevision history for this page on the wikiMediaWiki 1.37.2https://murray.cds.caltech.edu/index.php?title=Optimal_Control_of_Non-deterministic_Systems_for_a_Computationally_Efficient_Fragment_of_Temporal_Logic&diff=19712&oldid=prevMurray: htdb2wiki: creating page for 2013b_wtm13-cdc.html2016-05-15T06:15:25Z<p>htdb2wiki: creating page for 2013b_wtm13-cdc.html</p>
<p><b>New page</b></p><div>{{HTDB paper<br />
| authors = Eric M. Wolff, Ufuk Topcu, and Richard M. Murray<br />
| title = Optimal Control of Non-deterministic Systems for a Computationally Efficient Fragment of Temporal Logic<br />
| source = 2013 Conference on Decison and Control (CDC)<br />
| year = 2013<br />
| type = Conference Paper<br />
| funding = Boeing<br />
| url = http://www.cds.caltech.edu/~murray/preprints/wtm13-cdc.pdf<br />
| abstract = <br />
We develop a framework for optimal control policy synthesis for non-deterministic transition systems subject to temporal logic specifications. We use a fragment of temporal logic to specify tasks such as safe navigation, response to the environment, persistence, and surveillance. By restricting specifications to this fragment, we avoid a potentially doubly-exponential automaton construction. We compute feasible con- trol policies for non-deterministic transition systems in time polynomial in the size of the system and specification. We also compute optimal control policies for average, minimax (bottleneck), and average cost-per-task-cycle cost functions. We highlight several interesting cases when these can be computed in time polynomial in the size of the system and specification. Additionally, we make connections between computing optimal control policies for an average cost-per-task-cycle cost function and the generalized traveling salesman problem. We give simulation results for motion planning problems.<br />
| flags = <br />
| tag = wtm13-cdc<br />
| id = 2013b<br />
}}</div>Murray