About: Minimum-violation LTL Planning with Conflicting Specifications     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • We consider the problem of automatic generation of control strategies for robotic vehicles given a set of high-level mission specifications, such as %22Vehicle x must eventually visit a target region and then return to a base,%22 %22Regions A and B must be periodically surveyed,%22 or %22 None of the vehicles can enter an unsafe region.%22 We focus on instances when all of the given specifications cannot be reached simultaneously due to their incompatibility and/or environmental constraints. We aim to find the least-violating control strategy while considering different priorities of satisfying different parts of the mission. Formally, we consider the missions given in the form of linear temporal logic formulas, each of which is assigned a reward that is earned when the formula is satisfied. Leveraging ideas from the automata-based model checking, we propose an algorithm for finding an optimal control strategy that maximizes the sum of rewards earned if this control strategy is applied.
  • We consider the problem of automatic generation of control strategies for robotic vehicles given a set of high-level mission specifications, such as %22Vehicle x must eventually visit a target region and then return to a base,%22 %22Regions A and B must be periodically surveyed,%22 or %22 None of the vehicles can enter an unsafe region.%22 We focus on instances when all of the given specifications cannot be reached simultaneously due to their incompatibility and/or environmental constraints. We aim to find the least-violating control strategy while considering different priorities of satisfying different parts of the mission. Formally, we consider the missions given in the form of linear temporal logic formulas, each of which is assigned a reward that is earned when the formula is satisfied. Leveraging ideas from the automata-based model checking, we propose an algorithm for finding an optimal control strategy that maximizes the sum of rewards earned if this control strategy is applied. (en)
Title
  • Minimum-violation LTL Planning with Conflicting Specifications
  • Minimum-violation LTL Planning with Conflicting Specifications (en)
skos:prefLabel
  • Minimum-violation LTL Planning with Conflicting Specifications
  • Minimum-violation LTL Planning with Conflicting Specifications (en)
skos:notation
  • RIV/00216224:14330/13:00066721!RIV14-MSM-14330___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GAP202/11/0312), P(LH11065)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 88482
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/13:00066721
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • formal methods; robotics; linear temporal logic; control strategy synthesis (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [CC8653041703]
http://linked.open...v/mistoKonaniAkce
  • Washington, DC
http://linked.open...i/riv/mistoVydani
  • New York, (NY, USA)
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the American Control Conference
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Rus, Daniela
  • Tůmová, Jana
  • Frazzoli, Emilio
  • Karaman, Sertac
  • Reyes Castro, Luis
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000327210200034
http://linked.open.../riv/zahajeniAkce
issn
  • 0743-1619
number of pages
http://purl.org/ne...btex#hasPublisher
  • IEEE
https://schema.org/isbn
  • 9781479901777
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software