
An yi amfani da diagramma da ɗaukarsar kontrola don koyar wani ɗaukar kontrola a cikin diagramma. Daga ma'anar haka, babban bayanin kan ɗaukar kontrola shine diagramman da ɗaukar kontrola. Kowane muhimmiyar ɗaukar kontrola an koyar da ɗaukar, kuma ɗaukar ya shahara ne bayanin kan funksiya da na ɗaukar.
Ba zai yake daidaito da yake bayyana funksiya ta ɗaukar kontrola mai zurfi a matsayin funksiya mafi girma. Yana da kyau bayyana funksiya da na ɗaukar kontrola mai tsarki a matsayin funksiya mafi girma.
Kafin ya shahara ɗaukar da take funksiya ta ɗaukar, kuma suka taka rawa a hanyar yanayin signal.
An yi amfani da diagramma da ɗaukarsar kontrola don koyar ɗaukar kontrola mai zurfi. Kowane muhimmiyar ɗaukar kontrola an koyar da ɗaukar, kuma ɗaukar ya shahara ne bayanin kan funksiya da na ɗaukar. An za a iya koyar ɗaukar kontrola daban-daban da ɗaukar masu nisa-nisa.
A nan bayyana ne muhimmiyar ɗaukar biyu da funksiya Gone(s) da Gtwo(s). Ainihin Gone(s) shine funksiya da na ɗaukar ta farko, kuma Gtwo(s) shine funksiya da na ɗaukar ta biyu.

A nan bayyana ne cewa akwai hanyar feedback da C(s) ana bar aiki da R(s). Ladan R(s) da C(s) shine wata signal da ya shiga ko error signal.
A cikin kowane ɗaukar a diagrammat, an koyar ɗaukar input da output da suka taka rawa da funksiya. Don haka, funksiya ta:
Don haka, C(s) shine output, R(s) shine input.
Wani ɗaukar kontrola mai zurfi an koyar da ɗaukar masu nisa-nisa. Kowane ɗaukar na da funksiya ta ɗaukar. Amma, funksiya ta ɗaukar kontrola mafi girma shine ladan funksiya ta ɗaukar output da funksiya ta ɗaukar input.
Funksiya ta ɗaukar kontrola mafi girma zai iya samun bayyana ta ɗaukar kontrola ta ƙarin bayyana ɗaukar, kafuwa baya kafuwa.
Haddadi kan bayyana ɗaukar ake kira technique da takam addini da ɗaukar.
Don in tattara wannan technique da ba, za a iya tabbatar da adadin rules da ke ƙarfafa diagramma da ɗaukarsar kontrola.
Ba ni a tattauna rules, kafuwa baya kafuwa, don in ƙara diagramma da ɗaukarsar kontrola. Idan kana son bayyana game da ɗaukar kontrola, za ka duba MCQs ga ɗaukar kontrola.
Idan funksiya ta ɗaukar kontrola shine R(s), kuma output ta C(s), kuma funksiya ta ɗaukar kontrola mafi girma shine G(s), kuma ɗaukar kontrola zai iya koyar da:

Idan muna bukata a taka wata input ko input masu nisa zuwa ɗaukar masu nisa, muna yi amfani da wata abu ake kira take-off point.
Wannan abu shine inda input ya shiga da hanyoyi masu nisa. Note cewa input ba zai gajerar da ita a wannan abu ba.
Amma, input yana taka rawa a hanyoyi masu nisa da aka shiga a wannan abu, bace ita ba zai canza ba.
Saboda haka, za a iya taka wata input signals zuwa ɗaukar masu nisa da take-off point.
Amsa input signals da takee ɗaukar masu nisa a cikin ɗaukar kontrola an koyar da abu da takee X.

Idan ɗaukar kontrola masu nisa suna taka rawa a hanyar cascade, funksiya ta ɗaukar kontrola mafi girma zai iya shahara da haske funksiya ta ɗaukar masu nisa.
A nan bayyana cewa output ta ɗaukar ba zai ci nasararsu da presence da ɗaukar masu nisa a cikin ɗaukar kontrola.

Daga diagramma, ana bayyana cewa,

Don haka, G(s) shine funksiya ta ɗaukar kontrola mafi girma.

Babu da wata input signal da ke taka zuwa ɗaukar masu nisa, kamar yadda ake bayyana a karni, amma ana iya taka input signals masu nisa zuwa ɗaukar wanda.
A nan, input signal ta ɗaukar zai shahara da haske input signals masu nisa. Haske input signals an koyar da wata abu ake kira summing point, a nan bayyana ne a cikin diagramma da abu mai kirkiro.
Don haka, R(s), X(s), da Y(s) suna shahara da input signals. Yana da kyau bayyana fine specifying input signal da ke taka zuwa summing point a cikin diagramma da ɗaukarsar kontrola.
<