Browse wiki

From MurrayWiki
Jump to: navigation, search
Online Horizon Selection in Receding Horizon Temporal Logic Planning
Abstract Temporal logics have proven effective for
Temporal logics have proven effective for correct-by-construction synthesis of controllers for a wide range of applications. Receding horizon frameworks mitigate the computational intractability of reactive synthesis for temporal logic, but have thus far been limited by pursuing a single sequence of short horizon problems to the current goal. We propose a receding horizon algorithm for reactive synthesis that automatically determines a path to the currently pursued goal at runtime, in response to a nondeterministic environment. This is achieved by allowing each short horizon to have multiple local goals, and determining which local goal to pursue based on the current global goal, currently perceived environment and a pre-computed invariant dependent on each global goal. We demonstrate the utility of this additional flexibility in grant-response tasks, using a search-and-rescue example. Moreover, we show that these goal-dependent invariants mitigate the conservativeness of the receding horizon approach.
tiveness of the receding horizon approach.  +
Authors Vasumathi Raman, Mattias Fält, Tichakorn Wongpiromsarn, Richard M. Murray  +
Funding The TerraSwarm Research Center +
ID 2014j  +
Source Submitted, 2015 International Conference on Hybrid Systems: Computation and Control (HSCC)  +
Tag rfwm15-hscc  +
Title Online Horizon Selection in Receding Horizon Temporal Logic Planning +
Type Conference Paper  +
Categories Papers
Modification date
This property is a special property in this wiki.
15 May 2016 06:14:40  +
URL
This property is a special property in this wiki.
http://www.cds.caltech.edu/~murray/preprints/rfwm15-hscc_s.pdf  +
hide properties that link here 
Online Horizon Selection in Receding Horizon Temporal Logic Planning + Title
 

 

Enter the name of the page to start browsing from.