SVOREŇOVÁ, Mária, Jana TŮMOVÁ, Jiří BARNAT and Ivana ČERNÁ. Attraction-Based Receding Horizon Path Planning with Temporal Logic Constraints. Online. In Proceedings of the 51st IEEE Conference on Decision and Control. Neuveden: Omnipress for the IEEE Control Systems Society, 2012, p. 6749-6754. ISBN 978-1-4673-2066-5. Available from: https://dx.doi.org/10.1109/CDC.2012.6426041.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Attraction-Based Receding Horizon Path Planning with Temporal Logic Constraints
Authors SVOREŇOVÁ, Mária (703 Slovakia, belonging to the institution), Jana TŮMOVÁ (203 Czech Republic, belonging to the institution), Jiří BARNAT (203 Czech Republic, belonging to the institution) and Ivana ČERNÁ (203 Czech Republic, guarantor, belonging to the institution).
Edition Neuveden, Proceedings of the 51st IEEE Conference on Decision and Control, p. 6749-6754, 6 pp. 2012.
Publisher Omnipress for the IEEE Control Systems Society
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Czech Republic
Confidentiality degree is not subject to a state or trade secret
Publication form electronic version available online
WWW URL
RIV identification code RIV/00216224:14330/12:00073386
Organization unit Faculty of Informatics
ISBN 978-1-4673-2066-5
ISSN 0191-2216
Doi http://dx.doi.org/10.1109/CDC.2012.6426041
UT WoS 000327200407002
Keywords in English receding horizon planning; formal methods; control strategy synthesis; linear temporal logic; optimal planning
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 29/4/2015 07:41.
Abstract
Our goal in this paper is to plan the motion of a robot in a partitioned environment with dynamically changing, locally sensed rewards. The robot aims to accomplish a highlevel temporal logic surveillance mission and to locally optimize the collection of the rewards in the visited regions. These two objectives often conflict and only a compromise between them can be reached. We address this issue by taking into consideration a user-defined preference function that captures the trade-off between the importance of collecting high rewards and the importance of making progress towards a surveyed region. Our solution leverages ideas from the automata-based approach to model checking. We demonstrate the utilization of the suggested framework in an illustrative example.
Links
GAP202/11/0312, research and development projectName: Vývoj a verifikace softwarových komponent v zapouzdřených systémech (Acronym: Components in Embedded Systems)
Investor: Czech Science Foundation
GD102/09/H042, research and development projectName: Matematické a inženýrské metody pro vývoj spolehlivých a bezpečných paralelních a distribuovaných počítačových systémů
Investor: Czech Science Foundation
LH11065, research and development projectName: Řízení a ověřování vlastností komplexních hybridních systémů (Acronym: Řízení a ověřování vlastností komplexních hybridní)
Investor: Ministry of Education, Youth and Sports of the CR
MUNI/A/0758/2011, interní kód MUName: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity (Acronym: SKOMU)
Investor: Masaryk University, Category A
MUNI/A/0914/2009, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace (Acronym: SV-FI MAV)
Investor: Masaryk University, Category A
PrintDisplayed: 29/9/2024 20:08