MHB Re-configurable Battery Network Modeling

Ambreen Mustafa
Messages
3
Reaction score
0
I need to model circuit given at (https://drive.google.com/file/d/0B8MN0_dZJLHZRllhV2Y0M0FnaVU/view?usp=sharing) so that we may known output for any state of switches.
Given Information: Vector of State of Switches e.g. [s11 s12 s13 s21 s22 s23 s32]. I need to model a transformation matrix which maps switches states to output voltages.
Can anyone help me with that?
 
Physics news on Phys.org
An interesting problem. I don't have a full solution, but I can poke around at the start of one. First of all, I should say that there are some pretty bizarre switch combinations possible. For example, suppose $S_{32}, S_{22},$ and $S_{21}$ were closed, but all others were open. That would put $V_2$ in parallel with $V_{3}$. You don't normally do that. Whichever battery is at the higher voltage would try to charge the other battery, and because there are no circuit protection devices present, there would be no current-limiting. You can get phenomenally high currents with batteries sometimes. They're "always on". The presence of switches $S_{11}$ and $S_{21}$ is presumably to allow $V_1$ alone to power $V_{\text{out}}$, or $V_2$ to do it alone. But they raise some weird possibilities. So, while there are technically $2^7=128$ possible switch combinations, I propose to analyze the circuit differently: from which batteries you're going to put in series to power the load (which is what I'll call $V_{\text{out}}$). In this case, there are $2^3=8$ possible combinations of batteries in series to power the load. The battery combinations are: none, $V_1, V_1+V_2, V_1+V_3, V_2, V_2+V_3, V_3, V_1+V_2+V_3$. Let $x$ in a switch's configuration mean "don't care". That is, we don't care if that switch is closed or open. Let $1$ mean that a switch is closed, and $0$ mean it is open. So then, if we want no batteries to power the load, we would have
$$
\begin{bmatrix}S_{11}\\S_{12}\\S_{13}\\S_{21}\\S_{22}\\S_{23}\\S_{32}\end{bmatrix}=
\begin{bmatrix}x\\0\\x\\x\\0\\x\\0\end{bmatrix}.$$
But note that we wouldn't want $S_{11}$ and $S_{13}$ both to be closed, because that would short out $V_2$ and cause a current spike that might even melt the wires. By the same token, we wouldn't want both $S_{21}$ and $S_{23}$ closed. These two constraints are going to be true for every configuration. In a real-world circuit, to be safer, you'd probably combine $S_{11}$ and $S_{13}$ into a single-pole, triple-throw switch in order to avoid this possibility. If we want $V_{\text{out}}=V_1$, then the necessary switch combination is
$$
\begin{bmatrix}S_{11}\\S_{12}\\S_{13}\\S_{21}\\S_{22}\\S_{23}\\S_{32}\end{bmatrix}=
\begin{bmatrix}1\\1\\0\\1\\0\\0\\0\end{bmatrix}.$$
If we want $V_{\text{out}}=V_1+V_2$, then the necessary switch combination is
$$
\begin{bmatrix}S_{11}\\S_{12}\\S_{13}\\S_{21}\\S_{22}\\S_{23}\\S_{32}\end{bmatrix}=
\begin{bmatrix}0\\1\\1\\1\\0\\0\\0\end{bmatrix}.$$
Can you see how to get the rest of the options?
 
Thanks a lot for your reply. It was really helpful. Actually i have to deduce a forward equation in which i may insert any combination of switches to get the output voltage. How can this be extended through your equation?
 
Well, I would say that you need to obtain the correct switch settings for the other five battery combinations first. What are those?
 
In this circuit there are many other topologies possible like V1 || V2, (V1+V2) ||V3, V1||V2||V3..should this switching configuration be solved for every topology? This will not give a general solution which may even be used if we add one or two more cells.
 
I can't answer that for you - you have to decide. As I mentioned in Post # 2, I wouldn't connect the batteries in parallel, because one would charge another, and also because they wouldn't load balance.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top