<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>restricted on Specification Patterns for Robotic Missions</title>
    <link>https://roboticpatterns.com/tags/restricted/</link>
    <description>Recent content in restricted on Specification Patterns for Robotic Missions</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <copyright>Claudio Menghi, Christos Tsigkanos, Thorsten Berger, Patrizio Pelliccione, Carlo Ghezzi</copyright>
    <lastBuildDate>Thu, 08 Feb 2018 17:51:49 +0100</lastBuildDate>
    
	<atom:link href="https://roboticpatterns.com/tags/restricted/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>Lower Restricted Avoidance</title>
      <link>https://roboticpatterns.com/pattern/lowerrestrictedavoidance/</link>
      <pubDate>Thu, 08 Feb 2018 17:51:49 +0100</pubDate>
      
      <guid>https://roboticpatterns.com/pattern/lowerrestrictedavoidance/</guid>
      <description>Intent  Applies when a restriction on the minimum number of occurrences is desired.
 LTL Template $\mathcal{F} (\underbrace{l_1 \wedge \mathcal{X} (\mathcal{F}(l_1 \wedge \ldots \mathcal{X} (\mathcal{F}(l_1)}_\text{n})))) $, where $l_1 \in L$  Examples and Known Uses A robot to enter location $l_1$ at least $3$ times. The trace $l_4 \rightarrow l_3 \rightarrow l_2 \rightarrow l_2\rightarrow l_4 \rightarrow ( l_3)^\omega$ violates the mission requirement since location $1$ is never entered. The trace $l_1 \rightarrow l_4 \rightarrow l_3 \rightarrow l_1 \rightarrow l_4 \rightarrow l_1 \rightarrow ( l_3)^\omega$ satisfies the mission requirement.</description>
    </item>
    
    <item>
      <title>Upper Restricted Avoidance</title>
      <link>https://roboticpatterns.com/pattern/upperrestrictedavoidance/</link>
      <pubDate>Thu, 08 Feb 2018 17:51:49 +0100</pubDate>
      
      <guid>https://roboticpatterns.com/pattern/upperrestrictedavoidance/</guid>
      <description>Intent  Applied when a restriction on the maximum number of occurrences is desired.
 LTL Template $\neg \mathcal{F} (\underbrace{l_1 \wedge \mathcal{X} (\mathcal{F}(l_1 \wedge \ldots \mathcal{X} (\mathcal{F}(l_1)}_\text{n})))) $, where $l_1 \in L$  Note that the pattern is general and consider the case in which a robot can be in two locations at the same time. For example, a robot can be in an area of a building indicated as l1 (e.</description>
    </item>
    
  </channel>
</rss>