Next Article in Journal
Selecting the Low-Carbon Tourism Destination: Based on Pythagorean Fuzzy Taxonomy Method
Previous Article in Journal
Market Volatility of the Three Most Powerful Military Countries during Their Intervention in the Syrian War
Previous Article in Special Issue
Derived Hyperstructures from Hyperconics
Open AccessArticle

# n-Ary Cartesian Composition of Multiautomata with Internal Link for Autonomous Control of Lane Shifting

CDV—Transport Research Centre, Líšeňská 33a, 636 00 Brno, Czech Republic
Mathematics 2020, 8(5), 835; https://doi.org/10.3390/math8050835
Received: 27 April 2020 / Revised: 12 May 2020 / Accepted: 19 May 2020 / Published: 21 May 2020

## Abstract

In this paper, which is based on a real-life motivation, we present an algebraic theory of automata and multi-automata. We combine these (multi-)automata using the products introduced by W. Dörfler, where we work with the cartesian composition and we define the internal links among multiautomata by means of the internal links’ matrix. We used the obtained product of n-ary multi-automata as a system that models and controls certain traffic situations (lane shifting) for autonomous vehicles.

## 1. Introduction

#### 1.1. Motivation

Every physical object in real time and space is defined by its specific properties such as its position in spacetime, temperature, shape, or dimension. This set of properties may be regarded as a state in which the physical object evinces. While focusing on transport infrastructure, there are a lot of elements of characteristic properties. These characteristics are considered as states of elements in the transport infrastructure, for example, a state of traffic lights, a state of velocity, a state of mileage, or a state of traffic density. A clear description of such states is not the only requirement. The possibility of a state change is an equally important requirement. In this respect, the algebraic theory of automata suggests a specific tool (automata or multi-automata) that enables to change a state using the transition function and input words. In other words, the input symbol (or input word) is applied to a state by a transition function, and consequently, a new state is obtained. In the past, these structures were considered as systems that transmitted a specific type of information. Nowadays, this concept cannot sufficiently describe or even control real-life applications as these are too complex. In such complex and difficult systems, a change of a state causes a change of another state, for example, a train that passes a railroad crossing stops vehicles on a road. In current traffic, a driver of a vehicle usually responds to the change in the state of the surrounding elements in transport—generally, this is what we consider a human factor. Traffic situations will get more complicated when autonomous vehicles or even whole autonomous systems that control the traffic are included. In the case of autonomous systems, we suggest that every vehicle communicates with other vehicles or the infrastructure, and as a result, it influences the next state of a system. The fact that autonomous vehicles can communicate and send information about their state or information about a planned change of their state is considered as an advantage that makes the traffic infrastructure more effective. In this paper, we construct a cartesian composition of multi-automata, i.e., we combine some multi-automata (or automata) and we add internal links between their particular states. This new approach to a system of multi-automata with an internal link ($S MA i l$) is defined by matrices and enables to describe and control the above-mentioned problems.

#### 1.2. Basic Terminology of the Hyperstructure Theory

Before we introduce a theory of automata, recall some basic notions of the algebraic hyperstructure theory (or theory of algebraic hypercompositional structures). For further reference see, for example, books [1,2]. A hypergroupoid is a pair $( H , ∗ )$, where H is a nonempty set and the mapping $∗ : H × H ⟶ P ∗ ( H )$ is a binary hyperoperation (or hypercomposition) on $H$ (here $P ∗ ( H )$ denotes the system of all nonempty subsets of $H$). If $a ∗ ( b ∗ c ) = ( a ∗ b ) ∗ c$ holds for all $a , b , c ∈ H$, then $( H , ∗ )$ is called a semihypergroup. If moreover the reproduction axiom, i.e., relation $a ∗ H = H = H ∗ a$ for all $a ∈ H$, is satisfied, then the semihypergroup $( H , ∗ )$ is called hypergroup. By extensive hypergroup in the sense of hypercompositional structures we mean a hypergroup that ${ a , b } ⊆ a ∗ b$ for all $a , b ∈ H$, i.e., that the elements are included in its “resalt of hyperoperation”. For the same application on this theory in other science or real-life problems see, for example, [3,4,5,6,7].

#### 1.3. Some Notions of the (Multi-)Automata Theory

In the field of automata theory, several types of automata are considered. In this work, we focus on automata without outputs, i.e., a structure composed from a triad of an input alphabet, a set of states, and a transition function. For completeness, let us note that the automaton is a quintuple consisting of the above-mentioned triad plus an output alphabet, and an output function. For more details, see [8,9,10,11]. For details regarding terminology and some minor deviations from standard usage, see Novák, Křehlík, and Staněk . Further on, we recall the following definition (notice that condition 1 is sometimes omitted if we regard a semigroup instead of a monoid).
Definition 1
(). By a quasi–automaton we mean a structure $A = ( I , S , δ )$ such that $I ≠ ∅$ is a monoid, $S ≠ ∅$ and $δ : I × S → S$ satisfies the following condition:
• There exists an element $e ∈ I$ such that $δ ( e , s ) = s$ for any state $s ∈ S$.
• $δ ( y , δ ( x , s ) ) = δ ( x y , s )$ for any pair $x , y ∈ I$ and any state $s ∈ S .$
The set I is called the input set or input alphabet, the set S is called the state set and the mapping δ is called next-state or transition function. Condition 1 is called the unit condition (UC) while condition 2 is called the Mixed Associativity Condition (MAC).
Next, we are going to work with the idea of a quasi-multiautomaton as a hyperstructure generalization of a quasi-automaton, see [14,15,16,17,18]. When adjusting the conditions imposed on the transition function $δ$, it must be defined cautiously because we get a state on the left-hand side of Definition 1, condition 2, whereas we get a set of states on the right-hand side.
Definition 2
(). A quasi–multiautomaton is a triad $MA = ( I , S , δ )$, where $( I , ∗ )$ is a semihypergroup, S is a non-empty set and $δ : I × S → S$ is a transition function satisfying the condition:
$δ ( b , δ ( a , s ) ) ∈ δ ( a ∗ b , s ) for all a , b ∈ I , s ∈ S .$
The semihypergroup $( I , ∗ )$ is called the input semihypergroup of the quasi–multiautomaton $A$ (I alone is called the input set or input alphabet), the set S is called the state set of the quasi–multiautomaton $A$, and δ is called next-state or transition function. Elements of the set S are called states, elements of the set I are called input symbols or letters. Condition (1) is called Generalized Mixed Associativity Condition (GMAC).
In the theory of automata, ways to combine automata into one structure have been described. We will recall homogeneous, heterogeneous products, and cartesian composition, which was introduced by . These products were constructed and investigated primarily on classical automata without output in . In the following definition, we recall all three types of products/compositions introduced by W. Dörfler
Definition 3
(). Let $A 1 = ( I , S , δ )$, $A 2 = ( I , R , τ )$ and $B = ( J , T , σ )$ be quasi–automata. By the homogeneous product $A 1 × A 2$ we mean the quasi–automaton $( I , S × R , δ × τ )$, where $δ × τ : I × ( S × R ) → S × R$ is a mapping satisfying, for all $s ∈ S , r ∈ R , a ∈ H$, $( δ × τ ) ( a , ( s , r ) ) = ( δ 1 ( a , s ) , τ ( a , r ) )$, while the heterogeneous product $A 1 ⊗ B$ is the quasi-automaton $( I × J , S × T , δ ⊗ σ )$, where $δ ⊗ τ : ( I × J ) × ( S × T ) → S × T$ is a mapping satisfying, for all $a ∈ I , b ∈ J , s ∈ S , t ∈ T$, $δ ⊗ σ ( ( a , b ) , ( s , t ) ) = ( δ ( a , s ) , σ ( b , t ) )$. For $I , J$ disjoint we, by $A · B$, denote the cartesian composition of $A$ and $B$, i.e., the quasi–automaton $( I ∪ J , S × T , δ · σ )$, where $δ · σ : ( I ∪ J ) × ( S × T ) → S × T$ is defined, for all $x ∈ I ∪ J$, $s ∈ S$ and $t ∈ T$, by
$( δ · σ ) x , ( s , t ) = ( δ ( x , s ) , t ) if x ∈ I , ( s , σ ( x , t ) ) if x ∈ J .$
One can see that in the homogeneous product, we have the same input set, which operates on every component of the state set. In the heterogeneous product, the input is a pair of symbols such that each input symbol from the pair is operated on the respective component of the state pair. In the cartesian composition, the input is directed to the corresponding state and operates on one component of the state pair only.
Notice that generalizing the homogeneous or heterogeneous product of automata to the case of quasi-multiautomata is rather straightforward; see Chvalina, Novák, and Křehlík . However, applying the GMAC condition, which distinguishes the transition function of a quasi-multiautomaton from a transition function of a quasi-automaton, on cartesian composition of quasi-multiautomata is not straightforward. In Chvalina, Novák, and Křehlík  two extensions of this condition:
• Extension Generalized Mixed Associativity Condition (E-GMAC),
• Small Extension Generalized Mixed Associativity Condition (SE-GMAC)
and their applications were suggested.
Definition 4
(). Let $A = ( I , S , δ ) , B = ( J , T , σ )$ be e-quasi-multiautomata with input semihypergroups $( I ∘ ) , ( J , ∗ )$ and transition maps $δ : I × S → S , σ : J × T → T$ satisfying conditions
$δ ( y , δ ( x , s ) ) ∈ δ ( x · y , s ) ∪ δ ( I , s ) f o r a l l x , y ∈ I , s ∈ S ,$
$σ ( y , σ ( x , t ) ) ∈ σ ( x · y , t ) ∪ σ ( J , t ) f o r a l l x , y ∈ J , t ∈ T .$
By the cartesian composition of e-quasi-multiautomata $A$ and $B$, denoted as $A · E B$, we mean the e-quasi-multiautomaton $A · E B = ( ( ( I ∪ J ) , ⋄ ) , S × T , δ · σ )$, where $δ · σ$ is for all $x ∈ I ∪ J$, $s ∈ S$ and $t ∈ T$ defined by
$( δ · σ ) ( x , ( s , t ) ) = ( δ ( x , s ) , t ) if x ∈ I , ( s , σ ( x , t ) ) if x ∈ J ,$
and $⋄ : ( I ∪ J ) × ( I ∪ J ) → P ∗ ( I ∪ J )$ is for all $x , y ∈ I ∪ J$ defined by
$x ⋄ y = x ∘ y ⊆ I if x , y ∈ I , x ∗ y ⊆ J if x , y ∈ J , { x , y } if x ∈ I , y ∈ J o r x ∈ J , y ∈ I$
and $δ · σ : ( I ∪ J ) × ( S × T ) → ( S × T )$
When modelling the process of data aggregation from underwater wireless sensor networks, Křehlík and Novák  suggested that using an internal link between respective automata in their cartesian composition describes the real-life context better because the internal link influences not only the given individual automaton but to a certain extent the whole system. In this paper we make use of . Therefore, we include the following definition. For an example explaining the concept (together with calculations) see , Example 1.
Definition 5
(). Let $A = ( I , S , δ A )$ and $B = ( J , T , δ B )$ be two quasi–automata $δ A : I × S → S , δ B : J × T → T$ with disjoint input sets $I , J$. By $A · B$ we denote the automaton $A · B = ( I ∪ J , S × T , δ A · δ B )$, where $δ A · δ B : ( I ∪ J ) × ( S × T ) → S × T$ and $φ : S → J$, $ϱ : T → I$ is defined by
$( δ A · δ B ) x , ( s , t ) = ( δ A ( x , s ) ; δ B ( φ ( δ A ( x , s ) , t ) ) ) if x ∈ I , ( δ A ( ϱ ( δ B ( x , t ) , s ) ) ; δ B ( x , t ) ) if x ∈ J ,$
for all $x ∈ I ∪ J$, $s ∈ S$ and $t ∈ T$. The quasi–automaton $A · B$ is called the cartesian composition of quasi-automata $A$ and $B$ with an internal link. If in Definition 4 we replace Condition (4) with (5), we call the resulting quasi-multiautomaton the cartesian composition of quasi–multiautomata $A$ and $B$ with an internal link.

## 2. New Theoretical Model

In the classical theory, automata were considered as systems for transfering information of specific types. However, given complicated systems used nowadays, their benefits may not seem sufficient. In [9,13,19,20] we presented some real-life applications. In this section, we introduce an extension of ideas first included in  regarding internal links in the cartesian composition of quasi-multiautomata. We discuss systems in which there is a whole set of internal links. For our theoretical purposes we will organize them in a matrix considered by, for example, Golestan et al. . In Section 3, we show the application of our theoretical results in the context of autonomous cars and their navigation.
Notation 1.
We are going to use the following notation:
$C a r t e s i a n p r o d u c t o f s t a t e s e t s : ⨂ i = 1 n S i = S 1 × S 2 × S 3 × … × S n C a r t e s i a n p r o d u c t o f t r a n s i t o n f u n c t i o n s : ∏ i = 1 n δ i = δ 1 · δ 2 · δ 3 · … δ n$
Definition 6.
Let $MA i = ( I i , S i , δ i )$ be e-quasi-multiautomata with input semihypergroups $( I i , ∗ i )$ and $δ i : I i × S i → S i$ satisfying condition
$δ i ( y , ( δ i ( x , s ) ) ∈ δ i ( y ∗ i x , s ) ∪ δ i ( I i , s ) f o r a l l x , y ∈ I i , s ∈ S i , i ∈ { 1 , 2 … , n } .$
By n-ary cartesian composition of the e-quasi-multiautomata we mean the following system of e-quasi-multiautomata with internal link ($S MA i l$):
$A n c c = ⋃ i = 1 n I i , ⋄ , ⨂ i = 1 n S i , ∏ i = 1 n δ i , M n n ( φ ) ,$
where $∏ i = 1 n δ i : ⋃ i = 1 n I i × ⨂ i = 1 n S i → ⨂ i = 1 n S i$ and matrix $M n n ( φ )$, called matrix of internal links, where $φ i j : S i → I j$ for $i , j ∈ { 1 , 2 … , n }$, i.e.,
$M n n ( φ ) = φ 11 φ 12 … φ 1 n φ 21 φ 22 … φ 2 n ⋮ … ⋱ ⋮ φ n 1 φ n 2 … φ n n$ is defined by
$∏ i = 1 n δ i x , ( s 1 ; s 2 ; … ; s n ) = ( δ 1 · δ 2 · … · δ n ) x , ( s 1 ; s 2 ; … ; s n ) = = ( δ 1 ( φ 11 ( δ 1 ( x , s 1 ) ) , s 1 ) ; δ 2 ( φ 12 ( δ 1 ( x , s 1 ) ) , s 2 ) ; … ; δ n ( φ 1 n ( δ 1 ( x , s 1 ) , s n ) ) if x ∈ I 1 , ( δ 1 ( φ 21 ( δ 2 ( x , s 2 ) ) , s 1 ) ; δ 2 ( φ 22 ( δ 2 ( x , s 2 ) ) , s 2 ) ; … ; δ n ( φ 2 n ( δ 2 ( x , s 2 ) ) , s n ) ) if x ∈ I 2 , ⋮ ⋮ ( δ 1 ( φ n 1 ( δ n ( x , s n ) ) , s 1 ) ; δ 2 ( φ n 2 ( δ n ( x , s n ) ) , s 2 ) ; … ; δ n ( φ n n ( δ n ( x , s n ) ) , s n ) if x ∈ I n ,$
and $⋄ : ⋃ i = 1 n I i × ⋃ i = 1 n I i → P ∗ ⋃ i = 1 n I i$ is for all $x , y ∈ ⋃ i = 1 n I i$ defined by
$x ⋄ y = x ∗ i y ⊆ I i if x , y ∈ I i , { x , y } if x ∈ I i , y ∈ I k w h e r e i ≠ k .$
satisfies the condition:
$∏ i = 1 n δ i y , ∏ i = 1 n δ i x , s 1 ; s 2 ; … ; s n ∈ ∏ i = 1 n δ i x ⋄ y , s 1 ; s 2 ; … ; s n ∪ ⨂ i = 1 n δ i ( I i , s i ) .$
One can easily explain what is meant by Definition 6 using Figure 1. When an arbitrary input $x ∈ ⋃ i = 1 n I i$ is applied, the system, i.e., the cartesian composition, has to find out in which input set x belongs. Therefore, we determine the correct line in Equation (7), which through using we obtain a new state of the system. If, for example, $x ∈ I 1$, the new state $s 1 ′ ∈ S 1$ will be computed. Then, it will be adjusted to $s 1 ′ ′ ∈ S 1$ using $φ 11$, i.e., by the self-mapping internal link. This new state $s 1 ′ ′ ∈ S 1$ will be mapped to remaining input sets $I 2 , I 3 , …$ as defined by the matrix of internal links. In other words, the matrix determines which other states can be influenced by the change of the primary state. We apply inputs on states using respective transition functions. If there is 0 instead of $φ i j$ in the matrix of internal links, then the link between the state set $S i j$ and input set $I j$ does not exist. Notice that in Equation (7) e.g., $δ 1 ( φ n 1 ( δ n ( x , s n ) ) , s 1 ) = δ 1 ( φ n 1 ( s ′ ) , s 1 ) = δ 1 ( i 1 , s 1 ) = s ′ ′$. Since we obviously have to regard directions (see the oriented arrows), the matrix of internal links is not symmetric.
In Section 3 we apply the matrix of internal links in the context of modelling the navigation of autonomous vehicles. In this context, each vehicle obviously adjusts its behaviour based on the behaviour of other vehicles. Also obviously, not all vehicles need to be autonomous, which explains the use of zeros in the matrix (only autonomous vehicles communicate).
The above reasoning can be seen applied in the following example. Notice that we will use it also for the construction of the state set in Theorems 2 and 4 of Section 3.
Example 1.
Consider a section of a road in front of an autonomously controlled intersection in Figure 2. All vehicles are autonomous with compatible self-driving control parameters. Every car is in a certain state s, for example, car $A 3$ is in state $s = 3 ; 45 ; 250 ; 1 ; 0 ; 0$, which means, for example, that car number 3 going at $45 k m / h$ is in the position $250 m$ from the intersection in the 1st lane from the right. The first 0 means no change in speed while the second 0 means that the car is about to turn left.
In our system it is obvious that vehicle $A 3$ does not need to communicate with vehicle $A 4$ because it is not an obstacle in its intended driving operation. Thus, introducing an internal link between $A 3$ and $A 4$ is not necessary. However, vehicles $A 1$ and $A 2$ are problematics for $A 3$ because it intends to turn left. Therefore, $A 1$ should increase its speed while $A 2$ should slow down.
Remark 1.
Notice that some theoretical requests in the above example are not possible or even absurd, i.e., we have to keep in mind their feasibility. We already faced this problem in [12,23], where it was eliminated by using a suitable state set, input set, or operations on them. In this paper, we will choose special input and state sets as well.

## 3. $S MA i l$—Application of the Theoretical Model for Autonomous Cooperation

We are going to construct our system, called $S MA i l$, for the above context of Example 1. Naturally, Example 1 is an example of a possible usage of $S MA i l$ only.
First, we need to define suitable sets $S R M p$ and $I VM p$, where $p ∈ N$ is the index. The elements of the state set are ordered pairs—the first component being an ordered sextuple of numbers while the second component is a matrix. The state set is
$S R M p = [ s ; A ] , | s ∈ R 6 p , A ∈ M m , n ,$
where
$R 6 p = s = ( s 1 , s 2 , … s 6 ) | s 1 = p ; s 2 , s 3 , s 5 ∈ R 0 + ; s 4 , ∈ N ; s 6 ∈ 〈 − π 4 , π 4 〉$
and
$M m , n = a 11 … a 1 n ⋮ ⋱ ⋮ a m 1 … a m n | a i j ∈ { 0 } for i = m + 1 2 , j = n + 1 2 ; { − 1 , 0 , 1 } for o t h e r w i s e$
where $m , n$ are a odd numbers. The state set describes the complete position of every vehicle in all lanes. Notice that this is the same approach as in [24,25]. Now, the elements of $R 6 p$ defined by Equation (10) correspond to states mentioned in Example 1, i.e., $s 1$ stands for the vehicle number, $s 2$ for its speed, $s 3$ for distance from the intersection, $s 4$ for the respective lane (calculated from the right using odd numbers only, even number are reserved for positions between two lanes), $s 5$ stands for changing velocity (i.e., an interval $( 0 , 1 )$ is deceleration, an interval $( 1 , ∞ )$ is acceleration, 1 stands for constant speed), $s 6$ stands for changing direction (i.e., an interval $[ − π 4 , 0 )$ means manoeuvring left, interval $( 0 , π 4 ]$ means manoeuvring right, 0 means straight direction). Of course, more parameters can be used; for an example see . Matrices $A$ used in Equation (9) are taken from the set $M m , n$ defined by Equation (11). Notice that we use these matrices in the form suggested in [25,27,28] where, for the purpose of its control policy, the intersection is divided into a grid of reservation tiles. To be more precise,
$A = − 1 − 1 − 1 − 1 − 1 − 1 1 1 1 1 1 1 − 1 − 1 − 1 1 1 1 1 1 1 − 1 − 1 − 1 − 1 − 1 − 1 1 1 1 − 1 − 1 − 1 − 1 − 1 − 1 − 1 − 1 − 1 0 0 0 − 1 − 1 − 1 − 1 − 1 − 1 0 0 0 1 1 1 − 1 − 1 − 1 0 0 0 1 1 1 − 1 − 1 − 1 − 1 − 1 − 1 1 1 1 − 1 − 1 − 1 − 1 − 1 − 1 1 1 1 − 1 − 1 − 1 − 1 − 1 − 1 1 1 1 − 1 − 1 − 1 − 1 − 1 − 1 − 1 − 1 − 1 ∈ M m , n$
where 0 are parts of the grid (or tiles) occupied by the given vehicle, 1 stands for tiles occupied by some other vehicles and $− 1$ are free tiles. The above matrix $A$ describes the situation depicted in Figure 3 from the point of view of $A 3$.
Next, for construction of the i-th quasi-multiautomaton and consequently $S MA i l$, we will need an input alphabet, i.e., input sets (since we will be working with quasi-multiautomata, these will be algebraic hyperstructures). As mentioned above, we will define $I VM p$, where $p ∈ N$ is the index of the input set.
$I VM p = i → , C m , n = ( i 1 , i 2 , … , i 6 ) , c 11 … c 1 n ⋮ ⋱ ⋮ c m 1 … c m n | i 1 = p , i 2 ∈ R 0 + , i 3 ∈ 〈 0 , 1 〉 , i 4 ∈ N 0 , i 5 ∈ R + , i 5 ∈ − π 4 , π 4 , c 11 … c 1 n ⋮ ⋱ ⋮ c m 1 … c m n c i j ∈ { − 1 , 1 } , i ∈ { 1 , 2 , … , n } , j ∈ { 1 , 2 , … , m }$
It is obvious that input sets $I V , M p$ and $I V , M q$ are disjunct for $p ≠ q$, because the first component of every vector used in $[ v → , A n , m ] ∈ I VM p$ is p while the first component of every vector used in $[ u → , B n , m ] ∈ I VM q$ is q, i.e.,
$I V , M p ∩ I V , M q = ∅ , for every p , q ∈ N , where p ≠ q .$
Since vector components are real (or even natural) numbers, we can suppose that their sets are ordered; we write ≤ for this ordering. For all $p ∈ N$ we define hyperoperation $∗ p : I VM p × I VM p → P ∗ ( I VM p )$ by:
$u → , A m , n ∗ p v → , B m , n = w → , C m , n ∣ min { u i , v i } ≤ w i ≤ max { u i , v i } , for every i ∈ N , C m , n ∈ { A m , n , B m , n } .$
In the following example we show what we mean by the hyperoperation. Notice that the hyperoperation will be later on used to construct a hypergroup in Theorem 1, which will fulfil the assumption regarding input alphabet stated in Definition 2.
Example 2.
Consider two elements $a → , A 2 , 3 , c → , C 2 , 3 ∈ I VM 2$, where $a → , A 2 , 3 = ( 2 ; 6 . 2 ; 0 ; 1 ; 4 ; − π 8 ) , 1 − 1 1 1 − 1 − 1$ and $c → , C 2 , 3 = ( 2 ; 8 . 1 ; 1 ; 2 ; 5 ; π 6 ) , − 1 − 1 − 1 1 − 1 − 1$. Then the hyperoperarion
$a → , A 2 , 3 ∗ p c → , C 2 , 3 = ( 2 ; 6 . 2 ; 0 ; 1 ; 4 ; − π 8 ) , 1 − 1 1 1 − 1 − 1 ∗ p ( 2 ; 8 . 1 ; 1 ; 2 ; 5 ; π 6 ) , − 1 − 1 − 1 1 − 1 − 1 = ( 2 ; r 2 ; r 3 ; r 4 ; r 5 ; r 6 ) , D 2 , 3 ∣ 6 . 2 ≤ r 2 ≤ 8 . 1 ; 0 ≤ r 3 ≤ 1 ; 1 ≤ r 4 ≤ 2 ; 4 ≤ r 5 ≤ 5 ; − π 8 ≤ r 6 ≤ π 6 ,$
where $r → , D 2 , 3$ is defined by Equation (14), i.e., $D 2 , 3 ∈ 1 − 1 1 1 − 1 − 1 , − 1 − 1 − 1 1 − 1 − 1$.
Theorem 1.
For every index $p ∈ N$, the pairs $( I VM p , ∗ p )$ are hypergroups.
Proof.
First, we have to show that the associativity axiom holds, i.e., for all $u → , A m , n ; v → , B m , n ; w → , C m , n ∈ I VM p$ there is $u → , A m , n ∗ p v → , B m , n ∗ p w → , C m , n = u → , A m , n ∗ p v → , B m , n ∗ p w → , C m , n$. Without losing generality, we can show that associativity axiom holds for both matrices and vectors. First, we consider vectors:
$u → ∗ p v → ∗ p w → = u → ∗ p r → , min { v i , w i } ≤ r i ≤ max { v i , w i } = ⋃ s → ∈ r → , min { v i , w i } ≤ r i ≤ max { v i , w i } u → ∗ p s → = ⋃ s → ∈ r → , min { v i , w i } ≤ r i ≤ max { v i , w i } t → , min { u i , s i } ≤ t i ≤ max { u i , s i } = t → , min { u i , min { v i , w i } } ≤ t i ≤ max { u i , max { v i , w i } } = t → , min { u i , v i , w i } ≤ t i ≤ max { u i , v i , w i } } = t → , min { min { u i , v i } , w i } ≤ t i ≤ max { min { u i , v i } , w i } = ⋃ a → ∈ b → , min { u i , v i } ≤ b i ≤ max { u i , v i } c → , min { w i , a i } ≤ c i ≤ max { w i , a i } = ⋃ a → ∈ b → , min { u i , v i } ≤ b i ≤ max { u i , v i } a → ∗ p w → = b → , min { u i , v i } ≤ b i ≤ max { u i , v i } ∗ p w → = u → ∗ p v → ∗ p w → .$
In the case of matrices, the proof is straightforward:
$A ∗ p B ∗ p C = A ∗ p { B , C } = A ∗ p B ∪ A ∗ p C = { A , B } ∪ { A , C } = { A , B , C } = { A , C } ∪ { B , C } = A ∗ p C ∪ B ∗ p C = { A , B } ∗ p C = A ∗ p B ∗ p C .$
The reproductivity axiom holds automatically because the hyperoperation defined above is obviously extensive, i.e., for all $A , B ∈ I VM p$ there is ${ A , B } ⊆ A ∗ p B$. So for arbitrary $v → , B m , n$ we have $v → , B m , n ∗ I VM p = ⋃ u → , C m , n ∈ I VM p v → , B m , n ∗ u → , C m , n = I VM p$. Thus, for all indices $p ∈ N$ the structures $( I VM p , ∗ p )$ are hypergroups. □
At this point, everything is ready for the construction of an e-quasi-multiautomaton with the state set $S R M p$ and input set $I VM p$ for p-th quasi-automaton, where $p ∈ N$.
Remark 2.
We consider ordered pairs of vectors and matrices as elements of the input set and also of the state set. As a result, we will denote elements with index ı for input and with index s for the state, i.e., $a ı → , A m , n ı$ is an input word and $u s , M m , n s$ is a state.
Theorem 2.
For every index $p ∈ N$ the triple $MA p = ( I VM p , S R M p , δ p )$ is an e-quasi-multiautomtaton with input hypergroup $( I VM p , ∗ p )$, where transition function $δ p : I VM p × S R M p → S R M p$ is defined by
$δ p a ı → , C m , n ı , v s , K m , n s =$
$a 1 · v 1 ; a 2 · v 2 + a 2 ; a 3 · v 3 ; a 4 + v 4 ≡ m o d 2 l − 1 ; a 5 · v 5 ; a 6 + 0 · v 6 s , c 11 k 11 ⋯ c 1 n k 1 n ⋯ ⋯ ⋯ c m 1 k m 1 ⋯ c m n k m n s .$
Proof.
This proof is constructed as follows: first we calculate left hand side condition E-GMAC, second we show that left hand side is included in right hand side.
The left hand side:
$δ p a ı → , A m , n ı , δ p b ı → , B m , n ı , u s , U m , n s = δ p a ı → , A m , n ı , b 1 u 1 ; b 2 u 2 + b 2 ; b 3 u 3 ; b 4 + u 4 ≡ m o d 2 l − 1 ; b 5 u 5 ; b 6 + 0 · u 6 s , ( b i j u i j ) s = δ p a ı → , A m , n ı , p 2 ; b 2 u 2 + b 2 ; b 3 u 3 ; b 4 + u 4 ≡ m o d 2 l − 1 ; b 5 u 5 ; b 6 s , ( b i j u i j ) s = a 1 p ; a 2 ( b 2 u 2 + b 2 ) + a 2 ; a 3 b 3 u 3 ; a 4 + b 4 + u 4 ≡ m o d 2 l − 1 ; a 5 b 5 u 5 ; a 6 + ( 0 · b 6 ) s , ( a i j b i j u i j ) s = p 2 ; a 2 ( b 2 u 2 + b 2 ) + a 2 ; a 3 b 3 u 3 ; a 4 + b 4 + u 4 ≡ m o d 2 l − 1 ; a 5 b 5 u 5 ; a 6 s , ( a i j b i j u i j ) s = p ; a 2 ( b 2 u 2 + b 2 ) + a 2 ; a 3 b 3 u 3 ; a 4 + b 4 + u 4 ≡ m o d 2 l − 1 ; a 5 b 5 u 5 ; a 6 s , ( a i j b i j u i j ) s = v s , V m , n s .$
The right hand side:
$δ p a ı → , A m , n ı , ∗ p b ı → , B m , n ı , u s , U m , n s ∪ δ p I VM p , u s , U m , n s .$
From the definition of hyperoproduct $∗ p$ in Equation (14), we simply observe that the left hand side is not included in the right part of the right hand side union. Therefore, we have to proof, that the left hand side belongs to the left part of the right hand side union. Therefore we calculate:
$δ p I VM p , u s , U m , n s = ⋃ p ı → , P m , n ı ∈ I VM p δ p p ı → , P m , n ı , u s , U m , n s$
There exist an input word $c ı → , C m , n ı ∈ I VM p$ such that the vector is $c → = p ; a 2 i 2 s + a 2 i 2 + a s + 1 ; a 3 b 3 ; a 4 + b 4 ; a 5 b 5 ; a 6$ and the matrix is $C = a 11 b 11 ⋯ a 1 n b 1 n ⋯ ⋯ ⋯ a m 1 b m 1 ⋯ a m n b m n i$. Thus,
$v s , V m , n s = δ p c ı → , C m , n ı , u s , U m , n s ∈ ⋃ p ı → , P m , n ı ∈ I VM p δ p p ı → , P m , n ı . u s , U m , n s ,$
As a result, E-GMAC holds and the structure $MA p = ( I VM p , S V , M p , δ p )$ is an e-quasi-multiautomaton. □
Once Theorem 2 is proved we will show a practical application af e-quasi-multiautomata in intelligent transport systems. In the following example, the e-quasi-multiautomaton represents an autonomous vehicle. Its state is described by parameters organized into a sextuple while the matrix is used to detect its environment. This example is also linked to Example 1.
Example 3.
We consider matrix $B$ equivalent to matrix $A$ of Equation (12), which describes the situation in Figure 3. The vehicle $A 3$—in Figure 4 depicted in green (while other, non-autonomous, vehicles are red)—detects its surroundings and saves the data to matrix $B$. This model is suitable for a situation where only one vehicle, such as $A 3$, is autonomous and it is not possible to establish communication with other vehicles (because they are not autonomous). We consider a state $a s , B m , n s ∈ S V , M 3$, where $a → s = ( 3 ; 30 ; 200 ; 2 ; 0 ; 0 )$ and values in matrix $B$ corresponding to values in the first picture of Figure 4. If we apply the input $s ı → , S m , n ı ∈ I VM 3$ by the transition function $δ 3$, where $s ı → = ( 3 ; 1 ; 0 , 99 ; 1 ; 0 ; − π 4 )$ and $S m , n ı = 1 1 1 1 1 1 − 1 1 1 − 1 1 1 − 1 1 1 − 1 1 1 − 1 1 1 − 1 1 1 1 1 1 − 1 1 1 − 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 − 1 1 1 1 1 1 1 1 1 − 1 1 1 1 1 1 1 1 1 − 1 1 1 1 1 1 1 1 1 − 1 1 1 1 1 1 1 1 1 − 1 1 1 1 1 1 1 1 1 − 1 1 1$, then the first component of the input word is used to control the direction, i.e., it changes the state of the sextuple. The second component of the input word changes the matrix that detects the surroundings of a vehicle. This way we obtain a new state $r s , R m , n s$, where $s → i = ( 3 ; 30 ; 198 ; 3 ; 0 ; − π 4 )$ and the entries of the matrix $R m , n s$ are $− 1$ for $a 21 , a 24 , a 31 , a 34 , a 41 , a 44 , a 17 , a 27 , a 67 , a 77 , a 87 , a 97 , a 10 , 7$ and $1$ for other cases.
We know from the new state $r s , R m , n s$ that the vehicle $A 3$ does not change its velocity or its acceleration. We also know that the vehicle $A 3$ is positioned about 2$m$ far from the intersection border and is between lane 2 and 3, and it turns to the left. We can see the position surroundings in Figure 4. Consequently, this is what we use in the next step as input for full inclusion in lane 3.
We will use the e-quasi-multiautomata from Theorem 2 for the construction of a system called $S MA i l$. Necessarily, a change on any component of the state of the system must trigger a change on another component of the state. However, there may be situations where the change of other components are not necessarily required. Therefore, we include the following theorem in which we assert that there are such inputs for which the state of the multiautomata do not change.
Theorem 3.
For every e-quasi-mulltiautomaton $MA p = ( I VM p , S R M p , δ p )$ there is an input $e ı → , E m , n ı$ for which holds
$δ p e ı → , E m , n ı , s s , S m , n s = s s , S m , n s .$
Proof.
Consider an arbitrary state $s s , S m , n s ∈ S R M p$ of the e-quasi-mulltiautomaton $MA p$. For input words $e ı → , E m , n ı = ( e 1 ; e 2 ; e 3 ; e 4 ; e 5 ; e 6 ) , 1 11 ⋯ 1 1 n ⋯ ⋯ ⋯ 1 m 1 ⋯ 1 m n i$, where $e 1 = p ; e 2 = s 2 s 2 + 1 ; e 3 = 1 ; e 4 = 0 ; e 5 = 1 ; e 6 = s 6$, there holds Equation (16). Indeed,
$δ p e ı → , E m , n ı , s s , S m , n s = δ p ( p ; s 2 s 2 + 1 ; 1 ; 0 ; 1 ; s 6 ) i , 1 11 ⋯ 1 1 n ⋯ ⋯ ⋯ 1 m 1 ⋯ 1 m n i , ( s 1 ; s 2 ; s 3 ; s 4 ; s 5 ; s 6 ) s , a 11 ⋯ a 1 n ⋯ ⋯ ⋯ a m 1 ⋯ a m n s = p 2 , s 2 s 2 + 1 s 2 + s 2 s 2 + 1 , 1 · s 3 , 0 + s 4 ≡ m o d k − 1 , 1 · s 5 , s 6 + 0 · s 6 1 11 a 11 ⋯ 1 1 n a 1 n ⋯ ⋯ ⋯ 1 m 1 a m 1 ⋯ 1 m n a m n s = p , s 2 ( s 2 + 1 ) s 2 + 1 s 3 , s 4 , s 5 , s 6 , a 11 ⋯ a 1 n ⋯ ⋯ ⋯ a m 1 ⋯ a m n s = s s , S m , n s$
In Example 4 we consider different e-quasi-multiautomata as parts of a cooperative intelligent transport system. Some e-quasi-multiautomata represent autonomous vehicles while some are non-autonomous vehicles. Obviously, non-autonomous vehicles cannot detect their surroundings. In such cases we will use e-quasi-multiautomata, in which all entries of state matrices are 0. This explains the inclusion of the following lemma.
Lemma 1.
Let $S p ¯ R M = [ s ; A ] | s ∈ R 6 p , a i j = 0 ,$ then a structure $s u b MA p = ( I VM p , S p ¯ R M , δ p )$ is a sub-e-quasi-multiautomaton of e-quai-multiautomaton $MA p = ( I VM p , S R M p , δ p )$.
Proof.
It is obvious that $S p ¯ R M ⊂ S R M p$ and $δ p : I VM p × S p ¯ R M → S p ¯ R M$. Next, we can see that E-GMAC holds because all entries in the state matrix are zero. Thus, the second component of the state can not change for any input. Therefore, the proof for the first component is the same as the proof of the Theorem 2. □
In what follows, we will note that every state $p s s , p S m , n s$ is equal to $p s 1 s , … , p s 6 s , p b i j s ∈ S R M p$ and every input $p a ı → , p A m , n ı$ is equal to $p a 1 ı , … , p a 6 ı , p a i j ı ∈ I VM p$ from e-quasi-multiautomaton $MA p = ( I VM p , S R M p , δ p )$, where $p ∈ N$ is an index. In the other words, such as $p s 1 s$, the upper index s denotes state element, lower index 1 denotes position in the sextuple and the lower index p denotes the $p − t h$ e-quasi-multiautomaton. The indices in matrices have the same meaning. As far as input words are regarded, we use upper index ı; other indices have the same meaning.
Now we need to define the matrix of internal links. First, we define $φ p p : S R M p → I VM p$ for all $p ∈ { 1 , 2 , … , n }$ by
$φ p p ( p s 1 s , p s 2 s , p s 3 s , p s 4 s , p s 5 s , p s 6 s ) , p A m , n s = ( p v 1 ı , p v 2 ı , p v 3 ı , p v 4 ı , p v 5 ı , p v 6 ı ) , p B m , n ı .$
where $p v 1 ı = p s 1 s = p ; p v 2 ı = p s 2 s p s 2 s + 1 p s 5 s ; p v 3 ı = 0 , 95 ; p v 4 ı = p s 4 s + l + sgn s 6 s ; p v 5 ı = 1 p s 5 s ; p v 6 ı = 0$ and entries of the input matrix are dependent on the occupancy of the tiles.
Corollary 1.
For mapping $φ p p$ added to every e-quasi-multiautomaton $MA p = ( I VM p , S R M p , δ p )$ from Theorem 2 there holds the condition E-GMAC.
Proof.
The proof is obvious. On the left hand side we have up to four changes of the original state in the E-GMAC condition (two inputs and two applications of the internal link). However, we have a suitable input for the right hand side, similar to the proof of Theorem 2. □
Now we will define a mapping for two different e-quasi-multiautomata, i.e., from the state set of the pth e-quasi-multiautomaton to the input set of the qth e-quasi-multiautomaton. We define mapping $φ p q : S R M p → I VM q$ for all $p , q ∈ { 1 , 2 , … , n }$, where $p ≠ q$ between two e-quai-multiautomata $MA p = ( ( I VM p , S R M p , δ p ) )$ and $MA q = ( ( I VM q , S R M q , δ q ) )$ by
$φ p q ( p s 1 s , p s 2 s , p s 3 s , p s 4 s , p s 5 s , p s 6 s ) , p A n , m s = ( q v 1 ı , q v 2 ı , q v 3 ı , q v 4 ı , q v 5 ı , q v 6 ı ) , q B n , m ı ,$
where
$q v 1 ı = q ≠ p s 1 s ; q v 2 ı = p s 2 s p s 2 s + 1 + α p s 5 s + λ · | p s 6 s | 10 ; q v 3 ı = 0 , 99 ; q v 4 ı = 0 ; q v 5 ı = 1 ; q v 6 ı = 0 .$
Next we add a meaning of the parameters $λ$ and $α$
$λ = 1 if p s 4 s > q s 4 s and p s 6 s > 0 1 if p s 4 s < q s 4 s and p s 6 s < 0 0 o t h e r e w i s e and α = 1 if p s 4 s = q s 4 s and q s 3 s < p s 4 s and p s 5 s > 1 0 o t h e r e w i s e$
At this point we can give the main theorem of this section in which we are going to use all results obtained above, i.e., e-quasi-multiautomata, hypergroups, and internal links. By Definition 6 we obtain the n-ary cartesian composition of e-quasi-multiautomata with internal links.
Theorem 4.
Let $MA 1 = ( I VM 1 , S R M 1 , δ 1 ) , MA 2 = ( ( I VM 2 , S R M 2 , δ 2 ) ) , … ; MA p = ( ( I VM p , S R M p , δ p ) )$ be an e-quasi-multiautomata with disjoint input-sets $I VM p$, and $p ≥ 2$. Then a quadruple
$S MA i l = ⋃ i = 1 p I VM i , ⋄ , ⨂ i = 1 p S R M i , ∏ i = 1 p δ i , M n n ( φ )$
is a system of the cartesian composition of e-quasi-multiautomata with internal links.
Proof.
We have to demonstrate that the condition E-GMAC holds, i.e., that there is
$∏ i = 1 p δ i a ı → , A m , n ı , ∏ i = 1 p δ i b ı → , B m , n ı , ⨂ i = 1 p i s s , i S m , n s ∈ ∏ i = 1 p δ i a ı → , A m , n ı ∗ p b ı → , B m , n ı , ⨂ i = 1 p i s s , i S m , n s ∪ ⨂ i = 1 p δ i I VM i , i s s , i S m , n s .$
We prove, while maintaining generality, that
$∏ i = 1 t δ i a ı → , A m , n ı , ∏ i = 1 t δ i b ı → , B m , n ı , ⨂ i = 1 t i s s , i S m , n s ∈ ⨂ i = 1 t δ i I VM i , i s s , i S m , n s ,$
i.e., Formula (18) without the left part of the right hand side of E-GMAC. There are two cases. The first, both input words are in the same input set, and the second, input words are from different input sets.
(a)
For the first case, we consider $p a ı → , p A m , n ı , p b ı → , p B m , n ı ∈ I VM p$. On the left hand of Equation (19), we know that the input $p b ı → , p B m , n ı$ works upon one component from $1 s s , 1 S m , n s , 2 s s , 2 S m , n s , … , t s s , t S m , n s$ and the state can alter by the internal link $φ p p$. This is performed again for input $p a ı → , p A m , n ı$, then we have an input $p c ı → , p C m , n ı ∈ I VM p$ for which holds following (considering the proof of Theorem 2):
$δ p ( p a ı → , p A m , n ı , δ p ( p b ı → , p B m , n ı , p s s , p S m , n s ) ) = δ p ( p c ı → , p C m , n ı , p s s , p S m , n s ) .$
When the inputs $p a ı → , p A m , n ı$ or $p b ı → , p B m , n ı$ are applied on the state $t s s , t S m , n s$ other states react to this change by mapping $φ p q$. It is obvious that mapping $φ p r$ influences other states by the input from the respective input set. Then for every component of the state on the right side there exists an element from the corresponding input set, that state on the left hand side is included on the right hand side.
(b)
For the second case, we consider different inputs $p a ı → , p A m , n ı ∈ I VM p , q b ı → , q B m , n ı ∈ I VM q$ now. On the left-hand side, we have an influence on two different components in the tuple $1 s s , 1 S m , n s , 2 s s , 2 S m , n s , … , t s s , t S m , n s$ it is evident that the same inputs are the same on the right-hand side if internal links $φ p p$, $φ q q$ do not change. At the moment, $φ p p$, $φ p p$ influence corresponding components of the state, we have suitable inputs on the right-hand side, as in proof of Theorem 2. For mapping the influence of $φ p r$ and $φ q s$ on other components, we have the same situation as case a). Thus, it is obvious that $S MA i l$ holds condition E-GMAC.
In the conclusion of this section, we will demonstrate the theory explained by using the example of $S MA i l$ to describe and model a situation with several autonomous vehicles in traffic lanes each intending to perform some action.
Example 4.
We will consider five e-quasi-multiautomata $MA 1 = ( I VM 1 , S R M 1 , δ 1 ) , MA 2 = ( I VM 2 , S R M 2 , δ 2 ) , MA 3 = ( I VM 3 , S R M 3 , δ 3 ) , MA 4 = ( I VM 4 , S R M 4 , δ 4 ) , MA 5 = ( I VM 5 , S R M 5 , δ 5 )$, where every e-quasi-multiautomaton represents a vehicle. The e-quasi-multiautomata $MA 2 , MA 3 , MA 4$ are autonomous vehicles and $MA 1 , MA 5$ are ordinary vehicles. Figure 5 depicts the state of every vehicle, where the vehicles $MA 1 , MA 5$ are denoted in red colour in the same as verge of the road and other colour are used for autonomous vehicles. The complete situation with detection field of each vehicle is presented in Figure 6. In fact, Figure 5 is state of $S MA i l$, i.e.,
$1 r s , 1 R m , n s , 2 s s , 2 S m , n s , 3 t s , 3 T m , n s , 4 u s , 4 U m , n s , 5 v s , 5 V m , n s .$
Next, we need a matrix of the internal link
$0 0 0 0 0 0 φ φ φ 0 0 φ φ φ 0 0 φ φ φ 0 0 0 0 0 0 ,$
where 0 means no internal link and φ mean internal link between vehicles given by the respective indices. We are going to describe how to proceed, i.e., what input symbols to use, if the grey car, represented by e-quasi-multiautomaton $MA 3$, wants to change lane and turn left to lane 5.
We have two approaches to start changing the lane: we can correct of the state of the vehicle directly by the component on the 2nd, 3rd and 4th position in the input word, or to use the internal link and 6th component of the input. We will use an input $( 3 3 ı , 3 1 ı , 3 0.98 ı , 3 0 ı , 3 1 ı , 3 π 5 ı ) , 3 b i , j ı = 1 ∈ I VM 3$, which will operate on the 6th component. Then, the resulting state—full correction—will be made by the internal link. The calculation will be done according to Equations (7) and (15), i.e.,
$δ 3 ( 3 3 ı , 3 1 ı , 3 0.99 ı , 3 0 ı , 3 1 ı , 3 π 5 ı ) , 3 b i , j ı = 1 , 3 t s , 3 T m , n s = 3 3 , 3 30 , 3 192 . 06 , 3 3 , 3 1 , 3 π 5 , 3 T n , m s$
We obtain a state with new elements on the $5 t h , 6$th positions where these components have an effect on other components by means of the internal link $φ 33$ between the state and input of the e-quasi-multiautomaton $MA 3$. With this internal link, we obtain a new input:
$φ 33 3 3 s , 3 30 s , 3 192.06 s , 3 3 s , 3 1 s , 3 π 5 s , 3 T n , m s = 3 3 ı , 3 1 ı , 3 1 ı , 3 1 ı , 3 1 ı , 3 0 s , 3 C n , m ı ,$
where $3 C n , m ı = 1 1 1 1 1 1 1 1 1 1 − 1 − 1 1 1 − 1 1 1 1 1 1 1 − 1 − 1 1 1 − 1 1 1 1 1 1 1 − 1 − 1 1 1 − 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 − 1 1 1 − 1 1 1 − 1 1 1 1 1 − 1 1 1 − 1 1 1 − 1 1 1 1 1 − 1 1 1 − 1 1 1 − 1$, i.e., matrix to correct the state matrix detecting other vehicles or obstacles near vehicle $A 3$.
When we apply a new input on the state $3 3 , 3 30 , 3 192.06 , 3 3 , 3 1 , 3 π 5 , 3 T n , m s$, we obtain
$δ 3 ( 3 3 ı , 3 1 ı , 3 1 ı , 3 1 ı , 3 1 ı , 3 0 ı ) , 3 C n , m s , 3 t s , 3 T m , n s = 3 3 s , 3 30 s , 3 192.06 s , 3 4 s , 3 1 s , 3 0 s , 3 D n , m s ,$
where matrix $D$ has the same size and entries as depicted for $MA 3$ in Figure 7.
Now consider internal link $φ 32$, i.e., state of the e-quasi-multiautomaton $MA 2$ will be changed by the state
$3 3 s , 3 30 s , 3 192.06 s , 3 3 s , 3 1 s , 3 π 5 s , 3 T n , m s$ of the e-quasi-multiautomaton $MA 3$, which we obtained in Equation (20).
We will proceed using the definition of the link between two different e-quasi-multiautomata given as Equation (17).
$φ 32 3 3 s , 3 30 s , 3 192.06 s , 3 3 s , 3 1 s , 3 π 5 s , 3 T n , m s = 2 2 ı , 2 30 31 + 0.0628 ı , 2 0.99 ı , 2 0 ı , 2 1 ı , 2 0 ı , 2 M n , m ı ,$
where $2 M n , m ı$ is a suitable matrix which enables us to obtain a state matrix with entries given in Figure 7 for the state of $MA 2$. After we apply the input obtained by the internal link $φ 32$ in Equation (21) with the help of transition function $δ 2$, we get a new state depicted in Figure 7 for e-quasi-multiautomaton $MA 2$.
Next state of the (vehicle) $MA 4$ will not affect velocity by internal link $φ 24$, because the input obtained by $φ 24$ from state $3 3 s , 3 30 s , 3 192.06 s , 3 3 s , 3 1 s , 3 π 5 s , 3 T n , m s$ has parameters $λ = 0$ and $α = 0$.
Thus, the input $4 4 ı , 3 30 30 + 1 ı , 3 0.99 ı , 3 0 ı , 3 1 ı , 3 0 s , 3 N m , n ı$ operates as neutral input on states of $MA 4$ except for the distance given by $4 s 3 s$. Thus, we will present a new situation on the lanes, i.e., a new state after the application of one input. See Figure 7.

## 4. Conclusions

In this paper, we presented the concept of cartesian compositions, which was first introduced by W. Dörfler. In the past, cartesian compositions were generalized in the sense of hyperstructure theory (using complete hypergroups). Now we considered the internal link between the cartesian product of state sets. We described these internal links by matrices and decision functions. These functions determine which state will influence other components. Our modified concept of the cartesian composition is suitable to describe and control systems used for real-life applications, as was shown in examples throughout the paper. While constructing our system called $S MA i l$, we assumed that it was made up of e-quasi-multiautomata of a similar nature. This fact affected the proof of the E-GMAC condition (see Theorem 4), which was a substantial simplification of the procedure discussed in . In our future research, we shall concentrate on answering the question of whether the internal link may not remove the necessity to use the extensions of GMAC, i.e., whether the pure GMAC could be used instead of E-GMAC.

## Funding

This article was produced with the financial support of the Ministry of Education, Youth and Sports within the National Sustainability Programme I, project of Transport R&D Centre (LO1610), on the research infrastructure acquired from the Operation Programme Research and Development for Innovations (CZ.1.05/2.1.00/03.0064).

## Conflicts of Interest

The author declares no conflict of interest.

## References

1. Corsini, P.; Leoreanu, V. Applications of Hyperstructure Theory; Kluwer Academic Publishers: Dodrecht, The Netherlands; Boston, MA, USA; London, UK, 2003. [Google Scholar]
2. Davvaz, B.; Leoreanu–Fotea, V. Applications of Hyperring Theory; International Academic Press: Palm Harbor, FL, USA, 2007. [Google Scholar]
3. Chvalina, J.; Smetana, B. Series of Semihypergroups of Time-Varying Artificial Neurons and Related Hyperstructures. Symmetry 2019, 11, 927. [Google Scholar] [CrossRef]
4. Cristea, I.; Kocijan, J.; Novák, M. Introduction to Dependence Relations and Their Links to Algebraic Hyperstructures. Mathematics 2019, 7, 885. [Google Scholar] [CrossRef]
5. Křehlík, Š.; Vyroubalová, J. The Symmetry of Lower and Upper Approximations, Determined by a Cyclic Hypergroup, Applicable in Control Theory. Symmetry 2020, 12, 54. [Google Scholar] [CrossRef]
6. Novák, M.; Křehlík, Š. EL–hyperstructures revisited. Soft. Comput. 2018, 22, 7269–7280. [Google Scholar] [CrossRef]
7. Al Tahan, M.; Hoskova-Mayerova, Š.; Davvaz, B. Some Results on (Generalized) Fuzzy Multi-Hv-Ideals of Hv-Rings. Symmetry 2019, 11, 1376. [Google Scholar] [CrossRef]
8. Chvalina, J. Functional Graphs, Quasi-Ordered Sets and Commutative Hypergroups; Masaryk University: Brno, Czech Republic, 1995. (In Czech) [Google Scholar]
9. Dörfler, W. The cartesian composition of automata. Math. Syst. Theory 1978, 11, 239–257. [Google Scholar] [CrossRef]
11. Ginzburg, A. Algebraic Theory of Automata; Academic Press: New York, NY, USA, 1968. [Google Scholar]
12. Novák, M.; Křehlík, Š.; Staněk, D. n-ary Cartesian composition of automata. Soft. Comput. 2019, 24, 1837–1849. [Google Scholar] [CrossRef]
13. Chvalina, J.; Křehlík, Š.; Novák, M. Cartesian composition and the problem of generalising the MAC condition to quasi-multiautomata. An. Univ. Ovidius Constanta-Ser. Mat. 2016, 24, 79–100. [Google Scholar]
14. Ashrafi, A.R.; Madanshekaf, A. Generalized action of a hypergroup on a set. Ital. J. Pure Appl. Math. 1998, 15, 127–135. [Google Scholar]
15. Chvalina, J. Infinite multiautomata with phase hypergroups of various operators. In Proceedings of the 10th International Congress on Algebraic Hyperstructures and Applications, Brno, Czech Republic, 3 September 2008; Hošková, Š., Ed.; University of Defense: Washington, DC, USA; pp. 57–69.
16. Chvalina, J.; Chvalinová, L. State hypergroups of automata. Acta Math. Inform. Univ. Ostrav. 1996, 4, 105–120. [Google Scholar]
17. Chvalina, J.; Hošková-Mayerová, Š.; Dehghan Nezhad, A. General actions of hyperstructures and some applications. An. Univ. Ovidius Constanta-Ser. Mat. 2013, 21, 59–82. [Google Scholar] [CrossRef]
18. Massouros, G.G. Hypercompositional structures in the theory of languages and automata. An. Şt. Univ. A.I. Çuza Iaşi, Sect. Inform. 1994, 3, 65–73. [Google Scholar]
19. Dörfler, W. The direct product of automata and quasi-automata. In Mathematical Foundations of Computer Science: 5th Symposium; Mazurkiewicz, A., Ed.; Springer: Gdansk, Poland, 1976; pp. 6–10. [Google Scholar]
20. Chvalina, J.; Novák, M.; Křehlík, Š. Hyperstructure generalizations of quasi-automata induced by modelling functions and signal processing. In Proceedings of the 16th International Conference of Numerical Analysis and Applied Mathematics, Rhodes, Greece, 13–18 September 2018. [Google Scholar]
21. Křehlík, Š.; Novák, M. Modifed Product of Automata as a Better Tool for Description of Real-Life Systems. In Proceedings of the 17th International Conference of Numerical Analysis and Applied Mathematics, Rhodes, Greece, 23–29 September 2019. [Google Scholar]
22. Golestan, K.; Seifzadeh, S.; Kamel, M.; Karray, F.; Sattar, F. Vehicle Localization in VANETs Using Data Fusion and V2V Communication. In Proceedings of the Second ACM International Symposium on Designand Analysis of Intelligent Vehicular Networks and Applications, Paphos, Cyprus, 21 October 2012; pp. 123–130. [Google Scholar]
23. Novák, N.; Křehlík, Š.; Ovaliadis, K. Elements of hyperstructure theory in UWSN design and data aggregation. Symmetry 2019, 11, 734. [Google Scholar] [CrossRef]
24. Dresner, K.; Stone, P. A multiagent approach to autonomous intersection management. J. Artif. Intell. Res. 2008, 31, 591–656. [Google Scholar] [CrossRef]
25. Fajardo, D.; Au, T.-C.; Waller, S.T.; Stone, P.; Yang, D. Automated Intersection Control: Performance of Future Innovation Versus Current Traffic Signal Control. Transp. Res. Rec. 2011, 2259, 223–232. [Google Scholar] [CrossRef]
26. Huifu, J.; Jia, H.; Shi, A.; Meng, W.; Byungkyu, B.P. Eco approaching at an isolated signalized intersection under partially connected and automated vehicles environment. Transp. Res. Part C Emerg. Technol. 2017, 79, 290–307. [Google Scholar]
27. Latombe, J. Robot Motion Planning; Kluwer Academic Publishers: Boston, MA, USA, 1991. [Google Scholar]
28. Liu, F.; Naraynan, A.; Bai, Q. Effective methods for generating collision free paths for multiple robots based on collision type (demonstration). In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, Valencia, Spain, 4–8 June 2012; Volume 3, pp. 1459–1460. [Google Scholar]
Figure 1. $S MA i l$—A system of multiautomata with internal links.
Figure 1. $S MA i l$—A system of multiautomata with internal links. Figure 2. Lane shifting.
Figure 2. Lane shifting. Figure 3. Lane shifting; grid view of vehicle $A 3$.
Figure 3. Lane shifting; grid view of vehicle $A 3$. Figure 4. Lane change.
Figure 4. Lane change. Figure 5. $S MA i l$ for lane change.
Figure 5. $S MA i l$ for lane change. Figure 6. Complete situation in lanes with detection field of each vehicle.
Figure 6. Complete situation in lanes with detection field of each vehicle. Figure 7. A new state of $S MA i l$ with the release position.
Figure 7. A new state of $S MA i l$ with the release position. 