Not applicable.
It is often desirable to set a gas pressure in a working chamber precisely to a given value. For example, an instrument to measure the amount of absorption and adsorption of gas by a solid sample typically sends a known amount of gas into a reaction chamber. Such a measurement is used to determine the thermodynamic properties of such reactions or surface characteristics, such as the effective surface area. For precise measurement, it is desirable that the amount of gas is well controlled. For a limited pressure range, this can be made using a flow control valve. However, it is difficult to use a flow control valve for a wide pressure range because do so requires changing the flow conductance for a wide range. Such a valve is difficult to design, manufacture, or maintain. It is also very expensive and often impractical. It would therefore be advantageous to develop a system and method of accurately setting gas pressure in a working chamber that is relatively inexpensive and consistent across a wide range of pressures.
The present invention comprises a grouping of valves and chambers that can be controlled to precisely set a pressure in one of the chambers for a range of desired ending pressures. A method of setting the pressure relies on a series of steps, wherein one or more valves is opened and then closed during each step. When a valve is opened, the pressure is equalized between adjoining chambers separated by the opened valve. A controller determines the sequence and iterations of valve manipulations to reach the desired pressure.
Embodiments of the present invention will now be described, by way of example only, with reference to the accompanying drawings for the purpose of illustrating the embodiments, and not for purposes of limiting the invention, wherein:
A pressure control system comprises multiple chambers with a known volume separated by on-off valves. For example, for a system shown in
Instead of attempting to control the pressure over a wide pressure range, the pressure in the sample chamber (S) 102 may be controlled precisely over a wide range of pressures by employing a grouping of valves 104 and chambers according to one embodiment of the present invention. In the preferred embodiment, one or more adjustment chambers 105 (C1 and C2), or additional control chambers, are connected to connecting, or control, chamber (C) 103 as shown schematically in
The controller 106, which is a computer with a processor in the preferred embodiment, controls these valves 104 to vary the pressures in chambers R, C, C1 and C2 to achieve a precise target pressure in sample chamber (S) 102. The controller 106 determines the exact sequence of valve controls by analyzing a plurality of alternatives and choosing the sequence that results in the closest desired pressure. The manner in which the sequence is optimized is more fully described in following sections. Actual pressure measurements within each of the chambers R, S, C, C1, and C2 can optionally be acquired via pressure transducers housed within the chambers. Dashed lines in
Computer-Controlled Valve Manipulation to Reach the Desired Pressure
A computer-controlled system typically runs a procedure as shown in
In another embodiment of the present invention, actual pressure measurements are not required for chambers R, S, C, C1, or C2 since the initial pressure state of each chamber is known. For instance, if in the initial state, the pressure (pR) of the reservoir chamber 101 is known to be 80 atm and other chambers are evacuated to 0 atm, the following sequence of eight steps of valve manipulation will achieve pS (and pC) to be close to Pt (=1 atm). The physical operation of the sequence is accomplished at step 606. The sequence, with reference to the system shown in
Open (and close) V0: pR and pC become 66.67 atm.
Open (and close) V3: pC and pC2 become 0.398 atm.
Open (and close) V1: pC and pS become 0.066 atm.
Open (and close) V0: pR and pC become 55.567 atm.
Open (and close) V2: pC and pC1 become 3.145 atm.
Open (and close) V0: pR and pC become 46.83 atm.
Open (and close) V2: pC and pC1 become 5.618 atm.
Open (and close) V1: pC and pS become 0.992 atm.
The following table illustrates the pressure change in each chamber for the above valve manipulation sequence:
Search for the Best Sequence Among the Possible Permutations
A large number of permutations exist even for a limited number of valve manipulation steps. The following three permutations are possible for two step manipulation: (1) V0, V1; (2) V2, V1; and (3) V3, V1. The case where it ends with V1 is considered because the purpose of these manipulations is to set the sample chamber pressure (pS) that is changed when V1 opens. Also, permutations that manipulate the same valve consecutively are excluded because that does not change the pressure. The permutations increase quickly when the number of steps increase. For a three-step manipulation, the permutations are 9 and for four steps, they are 27. For an n-step manipulation of 4-single valves, the number of permutation is 3n-1. A different pressure will result at the sample chamber 102 for each of these permutations; although, depending on the initial pressures, some of the permutations may give an identical result. It may be expected that some of the permutation may result in the desired pressure in the sample chamber 102. The resultant pressure for each valve manipulation (open and then close) can be calculated as follows based on a weighted average. When a valve that connects two chambers with a volume of V1 and V2 that holds a gas of pressure p1 and p2, respectively, the resultant pressure will be given by
p=(p1V1+p2V2)/(V1+V2)
This equation is exact for an ideal gas and is a good approximation for real gases.
The controller 106, or computer with a processor in the preferred embodiment, is then employed to calculate the resultant pressure for each step as illustrated above. In order to arrive at the above sequence as best, the computer calculates the final sample pressure for all 3280 possible sequences for maximum eight-step operation of the 4-valve system of
Improving the Best Sequence Search—Longer Sequence
The possibilities for the final pressure are wider when the valve operation sequence is longer. For manipulations that involve four valves the number of possible sequences is 1093 for seven-step operation and increases to 3280 for eight-step and to 9841 for nine-step operation.
The nine-step valve manipulation covers a wide range of pressure as low as 0.004 atm to as high as 27.9 atm. However, there are several notable gaps indicating that a certain pressure cannot be realized. These gaps can be narrowed by increasing the sequence longer. However, when increasing the sequence the necessary search space increases rapidly.
Improving the Best Sequence Search—Branching
Instead of increasing the amount of steps, it is more effective to run a second nine-step sequence search beginning from one of the end result (2.864 atm) of the first nine-step sequence.
Application Example of Permutative Pressure Control
By combing the sequence search and branching method, one can precisely set pressure in the sample chamber (S) 102 in
The following table shows the actual performance of the system of
The following table shows test results with a system of four-valve, five-chamber configuration. The reservoir was either filled to a fixed pressure (32 atm) or pumped out as necessary.
Generalized Valve Manipulation Sequence
The search algorithm of the present invention can be generalized to include simultaneous opening of two or more valves 104. When four valves are to be manipulated, there are 24−1 ways to open the valve(s). In general, in manipulating m valves, there are k=2m−1 ways to open them. In searching for the best sequence, one can look for the permutations of k ways to control the valve. One may include all k ways for the search or any subset of these ways. The calculation for the resultant pressure for each valve(s) opening step may be generalized as
Here, the summation is over all the chambers of volume Vi and pressure pi that are connected to control chamber (C) 103 with a volume of V0 and pressure of p0 via connecting valve i. For the given pattern of opening, fi is set to 1 if valve i is open and zero if valve i is closed. The number of permutations for k ways of operation for n steps will be given by ((k−1)n−1)/(k−2).
Inclusion of simultaneous valve manipulation is effective in reaching the desired pressure quickly. As shown in
Generalized Best Sequence Search
The flow chart illustrated in
Chambers 1 . . . m are connected to Chamber 0 via Valves 0 . . . m−1.
Volume: V[i], i=0 . . . m
Pressure: p[i], i=0 . . . m
Valve Status: f[i], i=0 . . . m−1. 1(on) or 0(off)
After proper initialization of the relevant parameters at step 701, an array of valid sequences is generated for the selected ways of valve manipulation at step 702. A “way” is the valve opening pattern as defined by valve status. For example:
Way 0: f[0]=1, f[1]=0, f[2]=0, f[3]=0
Way 1: f[0]=0, f[1]=1, f[2]=0, f[3]=0
Up to 2m-1−1 ways may be defined for m−1 valve system. Not all the ways need to be used to get a good result.
By way of further example, one may choose the following seven ways for valve manipulation: way 0: open V1, way 1: open V0, way 2: open V2, way 3: open V3, way 4: open V0 and V1, way 5: open V0 and V2, way 6: open V0 and V3. Any permutation of these 7 ways may be conveniently expressed by a single integer number using a base-7 representation. A sequence of way 1, way 3, way 5, way 0, for example, may be expressed by 05317. The decimal equivalent of this number is 267. The program creates an array of consecutive integers up to a certain maximum but excludes the ones that include repeats of the same ways. From the valid sequence array, 053317 will be excluded, for example, because repeating way 3 (open V3) does not give a new state. However, 035317 will be valid.
A valid sequence array is an array of sequences for the selected ways of valve manipulation. This is generated first up to the specified number of steps for all the possible permutations but excluding consecutive selection of the same way, which is meaningless. The number of valid sequences for k-way, n-step valve manipulation is ((k−1)n−1)/(k−2).
The program will then take one number in the array at step 703, extracts the way for valve manipulation from that number at step 705 and calculates the resultant pressure step-by-step (steps 706 and 707) using the weighted average formula. After completion of the calculation, it compares the final sample pressure with the target pressure. It saves the sequence if it is the best one at that point but discards it otherwise. It then repeats the process at step 708. In order to speed up the search process, an early exit test (step 709) may be included so that it ends the search early if a given tolerance is satisfied without processing all the given permutations. This not only saves in calculation time, but also could reduce actual processing time by conducting the search from a smaller number that corresponds to a shorter sequence of valve manipulation.
At step 705, the sequence is defined as an encoded integer number that, when decoded, indicates an ordered series of ways for valve manipulation. For k-way valve manipulation, the sequence is encoded as a base-k integer. For example:
4-way valve manipulation encoding
Sequence: Way 0, Way 1, Way 3, Way 0
Encoded integer: 03104 (decimal equivalent=52)
In this example, Way 0 should be reserved for the pattern for the final step.
To calculate the pressure in a chamber, the pressure of the chambers connected with opened valves will be calculated by the following equation:
For a fully automated system, a supervisory module may be employed to monitor the initial state and perform filling and emptying of the chambers as necessary. Such a module may also select the length of the valve manipulation steps and the method of manipulation. For example, it may be all single valve manipulation or it might be a combination of single valve manipulation and simultaneous manipulation of multiple valves. It may also evaluate the result of the actual valve manipulation and instruct to repeat the process if the result is not satisfactory.
In order to perform the control described above, it is not imperative that the pressure at each chamber is actually known. In the example of
A. only Sample Chamber S;
B. only Reservoir R;
C. only Sample Chamber S and Reservoir R;
D. only Control Chamber C;
E. only Sample Chamber S and Control Chamber C;
F. only Reservoir R and Control Chamber C;
G. only Sample Chamber S, Reservoir R, and Control Chamber C;
H. only Sample Chamber S and one or more adjustment chambers;
I. only Reservoir R and one or more adjustment chambers;
J. only Sample Chamber S, Reservoir R, and one or more adjustment chambers;
K. only Control Chamber C and one or more adjustment chambers;
L. only Sample Chamber S, Control Chamber C, and one or more adjustment chambers;
M. only Reservoir R, Control Chamber C, and one or more adjustment chambers;
N. Sample Chamber S, Reservoir R, and Control Chamber C and one or more adjustment chambers (but not all adjustment chambers);
O. Sample Chamber S, Reservoir R, and Control Chamber C and all adjustment chambers; and
P. none (no pressure measurements of chambers required).
The volumes of the vessels shown in
The above method can also be applied to manipulating (1) precise volumes of gases in an industrial process such as manipulation and storage of natural gas, (2) precise volumes of gases such as mixing gaseous chemicals in a petro-chemical and/or pharmaceutical and drug industries and (3) precise volume controls for mixing different paints and resins. The present invention is not to be limited to gas. It is suitable for any fluid environment including liquid and gas-liquid phase states.
While the disclosure has been described in detail and with reference to specific embodiments thereof, it will be apparent to one skilled in the art that various changes and modifications can be made therein without departing from the spirit and scope of the embodiments presented. Thus, it is intended that the present disclosure cover the modifications and variations of this disclosure provided they come within the scope of the appended claims and their equivalents.
This application claims the benefit under 35 U.S.C. §119 of U.S. Provisional Application Ser. No. 61/971,696, filed on Mar. 28, 2014, which is incorporated by reference herein in its entirety.
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/US15/23121 | 3/27/2015 | WO | 00 |
Number | Date | Country | |
---|---|---|---|
61971696 | Mar 2014 | US |