Optimal Receding Horizon Control for Finite Deterministic Systems with Temporal Logic Constraints
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00065947" target="_blank" >RIV/00216224:14330/13:00065947 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Optimal Receding Horizon Control for Finite Deterministic Systems with Temporal Logic Constraints
Original language description
In this paper, we develop a provably correct optimal control strategy for a finite deterministic transition system. By assuming that penalties with known probabilities of occurrence and dynamics can be sensed locally at the states of the system, we derive a receding horizon strategy that minimizes the expected average cumulative penalty incurred between two consecutive satisfactions of a desired property. At the same time, we guarantee the satisfaction of correctness specifications expressed as Linear Temporal Logic formulas. We illustrate the approach with a persistent surveillance robotics application.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of The 2013 American Control Conference
ISBN
9781479901777
ISSN
0743-1619
e-ISSN
—
Number of pages
6
Pages from-to
4399-4404
Publisher name
Institute of Electrical and Electronics Engineers ( IEEE )
Place of publication
Neuveden
Event location
Washington, DC
Event date
Jun 17, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—