https://murray.cds.caltech.edu/index.php?title=Patching_task-level_robot_controllers_based_on_a_local_%C3%8E%C2%BC-calculus_formula&feed=atom&action=historyPatching task-level robot controllers based on a local Î¼-calculus formula - Revision history2021-10-25T21:26:14ZRevision history for this page on the wikiMediaWiki 1.35.3https://murray.cds.caltech.edu/index.php?title=Patching_task-level_robot_controllers_based_on_a_local_%C3%8E%C2%BC-calculus_formula&diff=19730&oldid=prevMurray: htdb2wiki: creating page for 2012m_lpjm13-icra.html2016-05-15T06:15:42Z<p>htdb2wiki: creating page for 2012m_lpjm13-icra.html</p>
<p><b>New page</b></p><div>{{HTDB paper<br />
| authors = Scott C. Livingston, Pavithra Prabhakar, Alex B. Jose and Richard M. Murray<br />
| title = Patching task-level robot controllers based on a local Î¼-calculus formula<br />
| source = 2013 International Conference on Robotics and Automation (ICRA)<br />
| year = 2012<br />
| type = Conference Paper<br />
| funding = Boeing<br />
| url = http://www.cds.caltech.edu/~murray/preprints/lpjm13-icra.pdf<br />
| abstract = <br />
We present a method for mending strategies for GR(1) specifications. Given the addition or removal of edges from the game graph describing a problem (essentially transition rules in a GR(1) specification), we apply a Î¼-calculus formula to a neighborhood of states to obtain a âlocal strategyâ that navigates around the invalidated parts of an original synthesized strategy. Our method may thus avoid global resynthesis while recovering correctness with respect to the new specification. We illustrate the results both in simulation and on physical hardware for a planar robot surveillance task.<br />
| flags = <br />
| filetype = PDF<br />
| tag = lpjm13-icra<br />
| id = 2012m<br />
}}</div>Murray