Published May 2013
| public
Book Section - Chapter
Patching task-level robot controllers based on a local µ-calculus formula
Chicago
Abstract
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.
Additional Information
© Copyright 2013 IEEE. This work is partially supported by the Boeing Corporation, the Caltech Center for the Mathematics of Information (CMI), and a United Technologies Research Center postdoctoral fellowship.Additional details
- Eprint ID
- 47469
- DOI
- 10.1109/ICRA.2013.6631229
- Resolver ID
- CaltechAUTHORS:20140724-131326509
- Boeing Corporation
- Caltech Center for the Mathematics of Information
- United Technologies Research Center
- Created
-
2014-07-24Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field