【Applied Algebra】Algebraic control method for AT89C51 microcontroller

【Applied Algebra】Algebraic control method for AT89C51 microcontroller (Talk for WJLeuang)

In this discussion we will introduce an efficient control algorithm for embedded devices based on computational exchange algebra.


problem background

Considering an automatic control system, the microcontroller is a central decision-making module that receives system state feedback and then gives control signals; its architecture can be visualized as follows:

insert image description here

Then the question is, how to make the MCU receive as little feedback as possible - the control sequence pair sample set { u ( t ) , v ( t ) } \{u(t),v(t)\}{ u(t),After v ( t ) } , it can continuously feed backv ( t ) v(t)v ( t ) gives the correct control signalu ( t ) u(t)u(t);


Use F 2 \mathbb{F}_2F2The polynomial ring simulates predicate logic

We use predicate logic to descriptively model the system. For example, predicate logic can be used to fuzzily describe the control rules. The temperature is very high (conveyor) ∧ \land∧Excessive flow (primary circuit pipeline)→ \rightarrow Open (No. 2 check valve), such empirical rules can be established on the basis of accurate data signals, making the system more robust (the membership function is used to model in fuzzy logic control, the degree of nonlinearity is not enough, Now we try to simulate it using a polynomial ring);

Consider such a homomorphic map

ρ : L → F 2 [ x 1 . . . x n ] \rho: \mathcal{L} \rightarrow \mathbb{F}_2[x_1...x_n] r:LF2[x1...xn]

Next we can verify that for ∀ pi , pj ∈ L \forall p_i,p_j \in \mathcal{L}pi,pjL , have

ρ ( pi ⋄ pj ) = ρ ( pi ) ⊘ ρ ( pj ) = fi ⊘ fj \rho(p_i \diamond p_j) = \rho(p_i) \oslash \rho(p_j) = f_i \oslash f_jp ( pipj)=p ( pi)p ( pj)=fifj

where ⋄ \diamond is a logical operation connection symbol,⊘ \oslash is the corresponding operation on the ring;


Solution ideas

Theorem.1 (Ideal Elimination Therom )I atk [ x 1 . . . xn ] k[x_1...x_n]k[x1...xn] ’s elimination idealI l I_lIlThe corresponding Groebner basis can be obtained as follows:

G l = G ∩ k [ x l + 1 . . . x n ] G_l = G \cap k[x_{l+1}...x_n] Gl=Gk[xl+1...xn]

The ideal representation of the predicate logic corresponding to the feedback signal is: I p = < f 1 . . . fm > ⊂ F 2 [ x 1 . . . xn ] I_p = <f_1...f_m> \subset \mathbb{F} _2[x_1...x_n]Ip=<f1...fm>F2[x1...xn] ;
Let the ideal expression of the predicate logic corresponding to the associated information be:I r = < r 1 . . . rd > ⊂ F 2 [ z 1 . . . zh ] I_r = <r_1...r_d> \subset \mathbb{ F}_2[z_1...z_h]Ir=<r1...rd>F2[z1...zh] ;
Let the ideal representation of the predicate logic corresponding to the feedback signal be:I q = < g 1 . . . gk > ⊂ F 2 [ z 1 . . . zh , x 1 . . . xn ] I_q = <g_1... g_k> \subset \mathbb{F}_2[z_1...z_h,x_1...x_n]Iq=<g1...gk>F2[z1...zh,x1...xn];

Then according to the above theorem, the solution process is to find the satisfying G p = G q ∩ F 2 [ x 1 . . . xn ] G_p=G_q\cap \mathbb{F}_2[x_1...x_n]Gp=GqF2[x1...xn] of algebraic varieties;

Summarize

The following evaluations and reflections on the current work:

  • It currently appears to be feasible;
  • How to limit the degree rise problem in the process of polynomial calculation;
  • How symbolic computation can be efficiently implemented in embedded devices to outperform current control schemes;

Guess you like

Origin blog.csdn.net/hanss2/article/details/111830995