The field of invention pertains to guided aerial vehicles and more specifically to automatic parafoil turn calculation method and apparatus.
a shows a parafoil 101. A parafoil is a wing shaped parachute capable of steerable, controlled descent. Essentially, the parachute aspect of the parafoil causes the parafoil to exhibit a gradual descent, while, the wing aspect of the parafoil permits the parafoil to have a guided flight path. The flight path of a parafoil can be controlled by tugging/releasing lines coupled to the left and right trailing edges of the parafoil. Specifically, as observed in
Parafoils have been used for guided drops as a consequence of the ability to control their flight path. In order to successfully land a parafoil at or near some target, however, an individual or person is needed to control the trailing edge lines 102, 103 so as to guide the parafoil with the requisite accuracy. Said another way, the intelligence and sensory abilities of the human brain are needed to manipulate the trailing edge lines 102, 103 of the parafoil in view of the location of the target, the height of the parafoil, the forward and transverse speeds of the parafoil, the roll, yaw and pitch of the parafoil and the presence of winds.
Various applications can be envisioned, however, for automatically guided parafoil drops. For instance, consider a situation where a team of catastrophe surveyors/workers/soldiers are in a remote area and in need of certain supplies. Having the ability to simply attach the needed supplies to the parafoil with some computerized intelligence to control the parafoil's trailing edge lines so as to automatically guide the parafoil and its payload in the vicinity of the surveyors/worker/soldiers would obviate the need for keeping skilled parachutists at the ready in case such a need for supplies arises. Moreover, even if skilled parachutists are available and at the ready, a parachutist would be delivered along with the payload. Without the same skills as the surveyors/workers/soldiers, the parachutist is apt to become a burden for the surveyors/workers/soldiers after the payload has been successfully delivered.
A better understanding of the present invention can be obtained from the following detailed description in conjunction with the following drawings, in which:
a,b,c depict a parafoil;
a,9b,9c pertain to an embodiment of a methodology executed by a trajectory planning unit during a turn phase;
a and 13b pertain to an attempt to land a parafoil on a moving target;
a and 14b pertain to a trajectory planning unit that utilizes the model of a vehicle;
The motors 307, in an embodiment, include a set of actuators 314a,b for the left and right trailing edge lines 302, 303. A third actuator 315 is used to release a canopy of the payload assembly after it is dropped from an aircraft so that the parafoil can deploy. The embodiment of
As observed, the control unit 306 represents a computer system having a processing core 318 (e.g., microprocessor) and with the sensors 306, motors 307 and wireless communication circuitry 316 acting as some form of the computing system's I/O. As shown, the sensors 306, motors 307 and wireless communication circuitry 316 have their own dedicated interfaces (e.g., busses) to the processing core 318 but conceivably communications between the processing core 318 and the different units 306, 307, 316 may be shared over a same interface in various combinations. The processing core 318 is coupled to a volatile memory 319 (e.g., DRAM or SRAM) and flash memory 321. The software executed by the processing core 318 is stored in flash memory 321 and loaded into volatile memory 319 when the control unit is first powered on (in an embodiment, well before the unit is dropped from an airplane). Thereafter the processing core 318 executes the software from volatile memory 319.
When there is no difference between the desired and actual location of the parafoil, the parafoil is “on track” and therefore no error signal exists. In this case, the parafoil's trailing edge lines do not need to be adjusted. By contrast, when a difference exists between the desired and actual location/orientation of the parafoil, the difference unit 402 produces a substantive error signal 403 that the path following unit 404 reproduces into one or more control signals 405 that are presented to either or both of the motors 407 to adjust the trailing edge lines in a manner that brings the parafoil closer to the desired location/orientation. In various embodiments the trajectory planning unit 401, difference unit 402 and path following unit 404 are implemented with software program code that is executed by the parafoil's processing core. Other implementations may impose various functions performed by these units in hardware either entirely or partially.
In an embodiment a model predictive control (MPC) approach is utilized based on a Single-Input Single Output (SISO) discrete system of the form:
s
k+1
=As
k
+Bu
k Eqn. 1a
p
k
=Cs
k Eqn. 1b
where: 1) k is the present state of the parafoil and payload assembly (hereinafter, “parafoil”); 2) k+1 is the next state of the parafoil; 3) A, B and C are matrices that describe the parafoil dynamics; 4) sk is a vector that describes the present state of the parafoil mechanical system in terms of its roll, change in roll with respect to time, yaw and change in yaw with respect to time; 5) uk describes the control signals being applied to the parafoil's motors in the present state; and, 6) yk is the parafoil's trajectory in the present state (that is, the path along which the parafoil is currently headed).
As provided in Appendix A of the instant application, the above system can be solved for uk as a function of the parafoil's currently desired trajectory wk. Thus, for a present parafoil state k, appropriate control uk to be applied to the parafoil's trailing line motors can be determined to keep the parafoil's path along its desired path wk.
Generally, the ability to calculate proper control signals for a desired trajectory is well known in the art. That is, given a desired flight path and an actual deviation from the desired flight path, it is well known (or can be readily determined) how to adjust a parafoil's trailing edge lines to bring the parafoil closer to the flight path. What has heretofore not been known is a generic algorithm or set of algorithms, executable by the parafoil as it is descending, for determining the parafoil's desired flight path to a specific target area where the algorithm takes into account various factors such as the precise location of the target relative to the parafoil when the parafoil is dropped, the altitude at which the parafoil is dropped and the applicable winds. In this respect, the ensuing discussion will focus primarily on algorithms executed by the trajectory planning unit 401.
As described in more detail further below, various embodiments exist as to the manner in which the algorithms executed by the trajectory planning unit account for the presence of winds. According to one perspective, the parafoil is purposely landed into the wind (for the sake of a “soft” landing). As a consequence, the strategy of the parafoil's flight plan is based on establishing a reference inertial trajectory with the major axis being aligned with the direction of prevailing/anticipated/known ground winds. The aloft winds component in this direction dictates the flight plan's logistics, while the crosswind component (measured or unmeasured) is considered as a disturbance. According to one embodiment, the prevailing wind component, estimated at current altitude is assumed to have constant magnitude through the entirety of the parafoil's descent. According to another embodiment the wind is assumed to linearly weaken in terms of magnitude over the course of the parafoil's descent. According to a third embodiment, the wind is assumed to weaken logarithmically over the course of the parafoil's descent. For simplicity, the first embodiment (in which the wind is assumed to have constant magnitude over the course of the parafoil's descent) will be described to provide an overall view of the flight path determination strategy. Subsequently, modifications will be introduced to this basic approach to account for more sophisticated wind modeling.
As observed in
The set of inputs received by the trajectory planning unit 401 also include a dynamic component in the form of a feedback path 411 that exists from the sensors 406 to the trajectory planning unit 401. In an embodiment, the sensor information that is fed back to the trajectory planning unit 401 at least includes the x, y, z spatial position of the parafoil and its horizontal pointing direction or “yaw” (ψ) (although not all of these parameters are necessarily used at all times during all flight path phases). Here, the flight path determined by the trajectory planning unit 401 need not be static. That is, once a first flight path is determined, the trajectory planning unit 401 is free to change or adjust the flight path as circumstances warrant.
Referring to
At this point, the flight path control system of
A rationale for this approach is that when heading into the wind, the responsiveness of the parafoil to control input on its trailing edge lines is enhanced (as compared when the parafoil is heading with the wind) and it provides for a slower landing of the parafoil on the ground so as to protect the payload from the shock of landing. After exiting the initial loitering phase 503_1b, the parafoil sails with the wind along the downwind leg 503_2 to a point “D_switch” 506 along the x axis, at which point, the parafoil enters the turn phase 503_3 to turn the parafoil onto its final approach path 503_4.
Upon entering the loitering phase 503_1, the trajectory planning unit maps out a helical descent pattern 504. In an embodiment the helical descent pattern 504 is defined by points A, B, C and D in x,y space in the proximity of the location where the parafoil is dropped. Each time the parafoil reaches a point sufficiently proximate to one of points A, B, C and D in xy space, the parafoil turns to effect the helical descent. In a further embodiment, points ABCD define a rectangle or square in xy space where two of the rectangle's/square's sides are arranged to be parallel with the wind direction 520. In various embodiments. The wind direction 520 is entered into the flight control system either before the payload assembly is dropped from the airborne vehicle, or, communicated to the flight control system (e.g., via the control unit's wireless network interface(s)) during its free fall or early loitering state). Points A, B, C, D may also be similarly entered into the flight control system (based on anticipated parafoil dynamics and/or tactical conditions).
During the helical descent 504 the parafoil accomplishes a number of tasks including: 1) gaining an initial understanding of the parafoil's positioning relative to the target; 2) estimating its currect (weight-specific) performance of the payload system, specifically its forward speed Vh; 3) measuring the wind at its altitude; and, 4) calculating the altitude A_switch 503_1b at which the loitering phase 503_1 ends and the downwind leg phase 503_2 begins.
As the parafoil descends in the ABCD helical pattern the control unit measures the parafoil's ground speed 603 and, based on these ground speed measurements, estimates the parafoil's air or forward speed (Vh) 604 and the magnitude of the wind (W) at its present altitude 605. The descent rate (Vv) is also calculated 606. As observed in
With the direction of the ground wind (desired landing direction) 520 being known, the trajectory planning unit is able to establish: 1) the direction of the final approach 503_4; 2) the direction of the downwind leg 503_2 and turn 503_3; and, 3) the orientation of the “legs” of the loitering phase's ABCD helical descent. As such, when the loitering phase 503_1 first begins, the trajectory planning unit 401 defines the ABCD helical pattern with straight “out” and “back” legs 701, 702 that run parallel to the direction 720 of the wind.
During its descent in the loitering phase, the parafoil will run through one or more straight “out” and “back” legs 701, 702 of the helical descent. During the run of the parafoil along one of these legs, over time, the trajectory planning unit presents values that correspond to x, y positions along the leg so the parafoil follows the planned leg path. When the parafoil reaches the end of a leg, the trajectory planning unit presents an output that corresponds to a turn so the parafoil can begin to approach its next leg in the pattern. During each pass through a downwind or upwind leg 701, 702, the trajectory planning unit measures its ground speed 603 in the direction of the leg.
Here, the ground speed of the parafoil in the downwind legs 702 should be faster than the ground speed of the parafoil along the upwind legs 701.
The parafoil's air speed (Vh) and the magnitude of the wind (W) can be determined from the opposing measured ground speeds. Specifically,
(W+Vh)=V1=ground speed measured in the downwind (+x) direction Eqn. 2a
(Vh−W)=V2=ground speed measured in the upwind (−x) direction Eqn. 2b
such that
V
h=(V1+V2)/2 Eqn. 3
W=V1/2−V2/2 Eqn. 4.
Multiple wind measurements can be taken through multiple loops of the helical descent (e.g., and averaging them) or only a single wind measurement can be taken through a single loop. Similarly, the crosswind component of the current winds can be estimated while the parafoil travels along two other legs (leg CD and led AB in
Referring back to
With the estimate provided by Eqn. 3, the time Tturn expected to be spent in the turn phase 503_3 can be estimated 601 as
T
turn
=πR/V
h Eqn. 5
where R is an estimated radius of the turn which, in an embodiment, is a parameter that is entered by a user into the control unit. In another embodiment, the control unit sets an initial value of R=ΔY/2 where ΔY is the lateral distance along the y axis 511 between the target and the approximate position of the parafoil while loitering. Here, Eqn. 5 essentially corresponds to the time spent in a 180 degree turn with radius R and air speed Vh with a constant turn rate.
With numerical values being assigned to each of Tturn, Vh, Vv and Tapp, the parafoil can determine 602 the altitude A_switch at which it exits the loitering phase 503_1 and enters the downwind phase 503_2 as:
where, in Eqn. 6, L is the distance separating the parafoil and the target along the x axis. Said another way, L is the x axis intercept of the parafoil'current position. As drawn in
In an embodiment, once the trajectory planning unit recognizes that the parafoil has descended to an altitude of z=A_switch, the trajectory planning unit switches phases from the loitering phase 503_1 to the downwind leg phase 503_2. In so doing, the trajectory planning unit changes the desired path of the parafoil from the helical ABCD descent with a line that runs along the x axis positioned at the y axis location of +2R (notably, in situations where the parafoil is to make a right turn in the turn phase 503_3 rather than a left turn, the line is positioned at the y axis location of −2R). As such, while in the downwind leg phase 503_2, the parafoil simply tracks to the correct y axis location and then, keeping the y axis location fixed as best as practicable, follows the +x axis while descending.
During its descent along the x axis (during the downwind leg phase 503_2), the trajectory planning unit continually updates the current winds calculates the position D_switch at which the parafoil should exit the downwind phase 503_2 and enter the turn phase 503_3. Here, D_switch is the distance along the x axis between the parafoil and the target at which the parafoil should begin the turn phase. D_switch can be expressed as
Notably, the above expression for D_switch is a function of: 1) z, the parafoil's “current” altitude; and 2) x, the parafoil's “current” position along the x axis.
Recalling the above definitions of D_switch and L, note that the parafoil should begin the turn phase when, substitution of the x and z parameters describing its current position into Eqn. 7 yields D_switch=L=parafoil's current x axis position. As such, as observed in
W=V−V
h Eqn. 8
When the latest calculated value for D_switch is recognized as being sufficiently the same as its present distance (L) along the x axis from the target, the trajectory planning unit exits the downwind leg phase 503_2 and enters the turn phase 503_3. Notably, the calculated value of D_switch can be negative indicating that the parafoil is to begin its turn before reaching the target's x axis location on the downwind leg. Appendix B also provides a derivation of Eqn. 7.
As discussed above, the decisions made by the trajectory planning unit are based on various measurements (such as forward speed Vh and wind magnitude W) and assumptions (such as a small magnitude for the crosswind component of the wind). Ideally there is no error in such measurements/assumptions, and, when the parafoil reaches the D_switch position and begins its turning phase, not only is the parafoil precisely where the trajectory planning algorithm “hoped” it would be, but also, the winds do not drastically change thereafter. Realistically, however, either or both of these conditions may not materialize. That is, for instance, when the trajectory planning unit decides to enter the turning phase, the parafoil may be “somewhere” in the xy plane other than its targeted location for the specific turn radius R and turn rate over time Tturn that the parafoil's trajectory was planned around. Moreover, the winds are constantly changing, which cannot possibly be accounted for during the turn itself. Finally, sudden updrafts and downdrafts may change the descent rate (relative to the ground) and therefore ruin a major estimate of how long the system has to stay in the air.
a shows an example of the former problem (entering turn phase in other than ideal x,y position). Here, representative actual paths 901-905 of the parafoil in the xy plane are different than the ideal planned path 900. These deviations from the ideal path 900 can result in unwanted error between the target location 910 and the corresponding actual landings 911-915.
c shows an improved approach in which the trajectory planning unit calculates an optimum turn based on its current position 950 in the turn relative to the exit point 951 of the turn phase. Here, a two point boundary-value problem is solved by minimizing the “cost” of an arc 952 that spans from the parafoil's current x, y, ψ position 950 (where ψ is the parafoil's yaw angle=the angle at which the parafoil is headed or pointing along the x,y plane) to the x, y, ψ position 951 where the final approach is supposed to start. The “cost” of an arc is determined by N points 953 spaced along the arc in a certain manner and: i) determining the time spent by the parafoil traveling between the points, summing these times to represent the total time spent traversing the arc, and, taking a difference between this total time and Tturn; and, ii) determining the yaw rate (angular change of the pointing of the parafoil in the xy plane) beyond a maximum desired yaw rate from each point needed to steer the parafoil to its next point.
Here, i) above penalizes deviation of the parafoil's total turn time from Tturn; and, ii) above penalizes an excessive yaw rate (“sharp turn”) needed to accomplish the turn. By formulating the cost as an optimization problem to minimize the cost, the respective positions for a set of N points along an arc between the parafoil's current position and the point where the final approach is to begin will be determined that correspond to an arc whose travel time is closest to Tturn and that does not exhibit excessive yaw rate.
As such, as observed in
Notably, the trajectory planning unit is free to repeatedly calculate a new trajectory (and therefore a new set of N points) throughout the turn phase. For example, as observed in
While optimizing the final turn trajectory, the parafoil's current x, y, ψ position 950 can be determined from the control unit's sensors (e.g., GPS or INS). The (x, y, ψ) position 951 at which the parafoil is to exit the turn phase and enter final approach is defined as:
FA=((Vh−W)Tapp,0,−π) Eqn. 9
The final turn maneuver is a pertinent part of the guidance algorithm. The parafoil may exit loitering earlier and it can be corrected by delaying the start of the final turn. However, once the final turn maneuver has started, varying the turn rate is the only way to make final corrections to intersect the top of the final approach slope. Varying the turn rate causes the parafoil to do either a steep or shallow turn, but precisely at the top of the final approach, i.e. at the point defined by Eqn. 9 in exactly Tturn after entering the turn. Only at this final phase can three-dimensional wind disturbances be accounted for by constant reoptimization of the maneuver, i.e. by adjusting Tturn and producing a new yaw rate profile.
Mathematically, the optimization problem can be expressed as
where: 1) Δtj is the time spent by the parafoil traveling from the jth point to the jth+1 point among the arc's N points; 2) kψ is a scaling factor; 3) ψj is the change in yaw rate at a jth point among the arc's N points; and, 4) ψmax is a desired maximum change in yaw rate. The analytical representation of a trajectory itself is given by
τfPη′(
τf2Pη″(
where
Upon the parafoil deciding that it has reached the end of the turn phase (e.g., by recognizing Tturn has lapsed since the beginning of the turn phase), the trajectory planning unit produces an output that causes the parafoil to head in the −x direction and maintain that direction until the parafoil lands.
The above discussion assumed computation of Dswitch (Eqn. 7), and the final approach point (Eqn. 9) based on a constant wind in the x-direction for the entirety of the parafoil's descent. The basic optimization algorithm presented in Appendix C was also based on this assumption, specifically, in one of two kinematic equations describing the horizontal position of the parafoil
dx/dt=V
h cos(ψt)+W Eqn. 12
A more general optimization algorithm presented in Appendix D, however, removes these assumptions and deals with an arbitrary wind profile based on wind models discussed immediately below.
Three possible improvements resulting in better assumptions about the wind's behavior from the current altitude all the way down to the ground can be made. A first improvement is based on the assumption that we have multiple parafoils deployed one after another to the same area. Then, a wind profile can be measured by the first system and transmitted to all following systems. A second improvement can be made if we have a ground station that constantly measures ground winds (in the x-direction) and transmits them to all descending parafoils (or a single parafoil) using an RF link or wireless network as described in Section 5. In this case rather than assuming a constant wind, we can model the wind as varying linearly with altitude as shown in
In the case of the first improvement a three-dimensional altitude-dependent wind profile can be available
W(h)={Wx(h),Wy(h),Wz(h)) Eqn. 13
Here h is the altitude above the ground while Wx, Wy and Wz are the x-, y- and z-components of the wind. Depending on how this profile was measured it may lack some of the components, i.e. Wz component. Generally speaking, to compute Dswitch, final approach point and final turn rate profile only x component is needed. Therefore, the only change in Eqns. 7 and 8 will be to substitute the constant wind W with the x-component of so-called ballistic wind WB, which basically represents the average of winds from a specific altitude all way down to the ground, as explained in Appendix E.
the case of the second (linear) wind model improvement 1101, upon exiting the loitering phase the wind profile below the current altitude will be estimated as
W(h)=W0+(mw)h Eqn. 14
where W0 is the ground wind as measured at/near the ground (h=0) in the vicinity of the target and mw is the rate at which the wind magnitude varies with altitude. In an embodiment, as observed in
In the case of the third (logarithmic) wind model improvement 1102, starting from the downwind leg the wind is modeled as
W(h)=(mw)ln(h/h0), when h≧h0 (W(h)=0, when 0<h<h0) Eqn. 15
Here, mw is a coefficient that is defined by the onboard control unit based on the current wind measurements taken at several consequent altitudes using standard regression analysis. Parameter h0, a small number below 1 meter, is called the “aerodynamic roughness length” and defines the type of terrain around the landing zone and is set before flight. This model needs no prior knowledge of the ground winds. The value of mw is constantly updated during the downwind leg to come up with more accurate estimates of Dswitch and the final approach point. Again, the ballistic wind value WB (Appendix E) is used in lieu of W in Eqns. 8 and 9. Other than these modifications, the flight path of the parafoil may be controlled as described in Section 2.0. Derivations of the coefficient mw in Eqn. 15 along with analytical dependences for Eqn. 8 (which may be used even without computing the ballistic wind) is provided in Appendix F.
The discussions above have been directed to an environment where the target is assumed to be a fixed location on the ground. Other applications are envisioned where it may be desirable to land the parafoil on a moving target such as a ship at sea.
This value can be expressed as xτ−Vτ((A_switch)NV) where Vτ is the velocity of the target and A_switch)NV is the amount of time expended from the moment the loitering phase is ended to the moment the parafoil lands. Another way to define the target is simply from its earlier definition L as the distance from the parafoil to the target along the x axis. Equating the two expressions, which essentially states that the upon the parafoil exiting the loitering phase the parafoil must move a net distance L along the x axis to land on a moving target that will be at position xτ−Vτ((A_switch)/VV) from its location xτ when the loitering phase was exited yields:
The above Eqn for L can be substituted into Eqn. 6 above and solved for A_switch as
which expresses the altitude that the parafoil can exit its loitering phase at its location along the x axis within the loitering phase. With the new value of A_switch, the operation of the parafoil may be controlled as described above in Section 2.0. Introduction of improved wind models such as those discussed above with respect to Section 3.0 will yield further changes to the A_switch calculation.
Another enhancement that may be necessary to accurately land a parafoil on a moving target is the specific location of the landing area on the target itself. For example, referring to
A possible benefit of the guidance algorithm described in Section 2.0 is that it establishes the reference trajectory in the inertial reference frame. In the case of the moving target (ship, submarine, etc.) this trajectory is tied to the moving target. Therefore, while planning the trajectory it is possible to construct the trajectory so that the parafoil avoids, e.g., a superstructure on the ship's deck. No other known guidance algorithm has this feature.
In an embodiment, as shown in
In the case of
The guidance algorithm features the optimized final turn which allows adjusting the actual landing time. In this case the heave motion of the ship can also be taken into account. This motion can be estimated by the parafoil's control unit based on the altitude above the sea data at the intended touchdown point. Such data can be uplinked to the parafoil using the ground weather station or a GPS unit using network connectivity as described in Section 5.
Recall from the discussion of
According to one embodiment, a command to be given to the airborne parafoil 1501 is verbally spoken, for instance, by an individual on the ground in the vicinity of the parafoil's target 1506 into a handheld and/or portable device 1507 such as a cell phone or smartphone. The verbal command may be any of (but not necessarily limited to) a command to change the target and/or a command to update the ground wind information (e.g., a command to enter a ground wind profile, a command to enter a change in ground wind magnitude and/or ground wind direction, or, a command to change the target to a new location). The verbal command is communicated via a network connection 1508 between the device 1507 and the voice recognition server 1504.
The voice recognition server 1504 (e.g., by way of voice recognition software and/or hardware) processes the verbal command and converts the verbal command information into a digital format that is understandable to a computing system. For example if the verbal command was to update the ground wind speed and/or direction, the voice recognition server might create an XML based message or other body of information 1508 in some kind of syntax that is understandable to a computing system. The information 1508 is then sent by way of a network connection 1509 from the voice recognition server 1504 to the situational awareness server 1505. The situational awareness server 1505 then translates the digitally formatted command 1508 into a packet 1510 that is sent 1550 to the airborne parafoil 1501 over the local carrier's wireless network 1502.
In an alternate embodiment, rather than a verbal command being spoken into the device 1507, the command is instead entered by way of a keyboard or other user interface of the portable device 1507 and sent 1511 by way of a packet to the situational awareness server 1505 or the parafoil directly 1512. In the former case 1511 where the packet is sent to the situation awareness server first, the situational server sends a packet 1510 having the entered command to the airborne parafoil. In an embodiment, the portable device 1507 may be specialized equipment. For example, the portable device 1507 may be a portable weather station or wind measurement equipment (such as the kind made by Kestrel, Inc. of Sylvan Lake, Mich.) having its own wireless network interface (and/or integrated cell phone and/or smartphone circuitry). In this case, with the same portable device 1507, wind information can be measured, packetized and sent 1511 to either the situational awareness server 1505 (for subsequent delivery to the airborne parafoil 1501) or to the airborne parfoil directly 1512.
In even further alternate embodiments, a verbal or entered command is made from a command center or other computing system 1551 that is remote from the parafoil's drop zone. For instance, a command 1514 to change the parafoil's target may be made, while the parafoil is in flight, from a computing system 1515 that is coupled to the WAN 1503 many miles away from the parafoil's drop zone. The WAN may be commercial, proprietary, public or some combination thereof and may even have global reach capability. The command may be sent to the parafoil directly 1514, or, to a situational awareness server beforehand.
The parafoil may further be configured to transmit into the wireless network 1502 any/all of its measurement information, such as the wind's magnitude at higher altitudes, its ground speed measurements and/or its positional measurements for analysis and/or observation at some endpoint. For instance, according to one embodiment, a plurality of parafoil's are dropped simultaneously over a common area, and, as the parafoils descend (e.g., in a loitering phase), they transmit their locations (and/or ABCD loitering parameters) to a remote command center 1515 that tracks all of the parafoils in flight in real time. An individual or application software then decides, while the parafoils are descending, what their respective targets are. Respective packets are then sent to each of the airborne parafoils informing them of their specific target.
In another application of a parafoil's ability to transmit measured information into a wireless network, according to one approach a first parafoil is dropped prior to one or more subsequent parafoils. The purpose of the first parafoil is to make wind measurements during its descent and send the measurement results (and/or a wind profile) “up” to the second set of one or more subsequently dropped parafoils. Here, the parafoil can transmit the wind information in the form of one or more packets into the local carrier's network 1502 which redirects (or multicasts or broadcasts) the packet(s) back to each subsequent parafoil. Alternatively, a private wireless link or network can be established between the descending parafoils and the wind information transmitted up to them through the proprietary wireless link.
To further that point although much of the previous examples discussed the transmission of wireless information to/from an airborne parafoil through a local carrier's wireless network, the same core schemes may be implemented with a proprietary wireless network or link. For example, the portable device 1507 in the vicinity of the target may transmit ground wind information up to a descending parafoil through a proprietary wireless link that is established between the device 1507 and the descending parafoil. Likewise, any packets that are sent to an airborne parafoil may traverse only a proprietary network without any public traffic (up to an including the wireless network) or some combination of proprietary and public traffic networks may be utilized.
For any of the embodiments discussed above, note that a parafoil may wirelessly transmit its location, altitude and/or high altitude wind information into the network and ultimately to a computing system which executes the trajectory planning unit algorithms (e.g., with other accumulated information such as ground winds, velocity of moving target, etc.). The computing system then sends an updated trajectory plan through the network and wirelessly to the descending parafoil which implements the newly received trajectory plan.
Apart from wireless network interface circuitry, each of the parafoils 1601 further includes wireless network routing and/or switching software/hardware to route packets. As such, an airborne wireless network is created with each of the parafoils acting as a node of the network. A packet sent from the access point 1603 to the remote location 1605 is relayed by way of nodal hops from parafoil to parafoil until it reaches the remote location 1605. Likewise, a packet sent from the remote location 1605 is relayed by way of nodal hops from parafoil to parafoil in the reverse direction until it reaches the access point 1603. The parafoils 1601 may include nearest neighbor or other awareness technology that permit them to periodically update configure (e.g., by way of periodic updates) their routing tables mid flight (e.g., forming a so-called mesh network), or, the nodal configuration and routing tables may be predetermined ahead of time. The drop pattern and/or guidance systems may be used to orient each of the parafoils in its proper nodal position.
Whether the individuals at the remote location 1605 are aware of the establishment of the temporary network in their direction may depend on the circumstances. For instance, if a verbal communication needs to take place between individuals at some command center 1607 coupled to the established network 1604 and the individuals at the remote location 1605, the parafoils 1601 may be equipped with transmission circuitry that transmits a signal to equipment held by the personnel at the remote location 1605 that triggers some kind of alarm that an imminent verbal communication is being arranged. By contrast, if only an electronic message is to be delivered to the remote personnel, such as an email, no alarm need be triggered ahead of time.
The above discussion spoke of the network established by the parafoils as being temporary in the sense that the network is torn down or otherwise made unworkable prior to or approximately at the time of the landing of the parafoils. A temporary network is useful where, for instance, the safety or security of the remote team 1605 is comprised by the presence of the network. For example, continued transmissions by the parafoil/nodes might lead to the unwanted discovery of the network and the remote individuals. Other circumstances may arise where a permanent network is desired. In this case, the parafoil/nodes can continue to operate to implement a wireless network long after the parafoils have landed.
Lastly, that
The one or more processing cores 1701 execute instructions in order to perform whatever software routines the computing system implements. The instructions frequently involve some sort of operation performed upon data. Both data and instructions are stored in system memory 1703 and cache 1704. Cache 1704 is typically designed to have shorter latency times than system memory 1703. For example, cache 1704 might be integrated onto the same silicon chip(s) as the processor(s) and/or constructed with faster SRAM cells whilst system memory 1703 might be constructed with slower DRAM cells. By tending to store more frequently used instructions and data in the cache 1704 as opposed to the system memory 1703, the overall performance efficiency of the computing system improves.
System memory 1703 is deliberately made available to other components within the computing system. For example, the data received from various interfaces to the computing system (e.g., keyboard and mouse, printer port, LAN port, modem port, etc.) or retrieved from an internal storage element of the computing system (e.g., hard disk drive) are often temporarily queued into system memory 1703 prior to their being operated upon by the one or more processor(s) 1701 in the implementation of a software program. Similarly, data that a software program determines should be sent from the computing system to an outside entity through one of the computing system interfaces, or stored into an internal storage element, is often temporarily queued in system memory 1703 prior to its being transmitted or stored.
The ICH 1705 is responsible for ensuring that such data is properly passed between the system memory 1703 and its appropriate corresponding computing system interface (and internal storage device if the computing system is so designed). The MCH 1702 is responsible for managing the various contending requests for system memory 1703 access amongst the processor(s) 1701, interfaces and internal storage elements that may proximately arise in time with respect to one another.
One or more I/O devices 1708 are also implemented in a typical computing system. I/O devices generally are responsible for transferring data to and/or from the computing system (e.g., a networking adapter); or, for large scale non-volatile storage within the computing system (e.g., hard disk drive or semiconductor non volatile storage device that is the main store for the system's program code when the system is powered off). ICH 1705 has bi-directional point-to-point links between itself and the observed I/O devices 1708.
Processes taught by the discussion above may be performed with program code such as machine-executable instructions that cause a machine that executes these instructions to perform certain functions. In this context, a “machine” may be a machine that converts intermediate form (or “abstract”) instructions into processor specific instructions (e.g., an abstract execution environment such as a “virtual machine” (e.g., a Java Virtual Machine), an interpreter, a Common Language Runtime, a high-level language virtual machine, etc.)), and/or, electronic circuitry disposed on a semiconductor chip (e.g., “logic circuitry” implemented with transistors) designed to execute instructions such as a general-purpose processor and/or a special-purpose processor. Processes taught by the discussion above may also be performed by (in the alternative to a machine or in combination with a machine) electronic circuitry designed to perform the processes (or a portion thereof) without the execution of program code.
It is believed that processes taught by the discussion above may also be described in source level program code in various object-orientated or non-object-orientated computer programming languages (e.g., Java, C#, VB, Python, C, C++, J#, APL, Cobol, Fortran, Pascal, Peri, etc.) supported by various software development frameworks (e.g., Microsoft Corporation's .NET, Mono, Java, Oracle Corporation's Fusion, etc.). The source level program code may be converted into an intermediate form of program code (such as Java byte code, Microsoft Intermediate Language, etc.) that is understandable to an abstract execution environment (e.g., a Java Virtual Machine, a Common Language Runtime, a high-level language virtual machine, an interpreter, etc.) or may be compiled directly into object code.
According to various approaches the abstract execution environment may convert the intermediate form program code into processor specific code by, 1) compiling the intermediate form program code (e.g., at run-time (e.g., a JIT compiler)), 2) interpreting the intermediate form program code, or 3) a combination of compiling the intermediate form program code at run-time and interpreting the intermediate form program code. Abstract execution environments may run on various operating systems (such as UNIX, LINUX, Microsoft operating systems including the Windows family, Apple Computers operating systems including MacOS X, Sun/Solaris, OS/2, Novell, etc.).\
An article of manufacture may be used to store program code. An article of manufacture that stores program code may be embodied as, but is not limited to, one or more memories (e.g., one or more flash memories, random access memories (static, dynamic or other)), optical disks, CD-ROMs, DVD ROMs, EPROMs, EEPROMs, magnetic or optical cards or other type of machine-readable media suitable for storing electronic instructions. Program code may also be downloaded from a remote computer (e.g., a server) to a requesting computer (e.g., a client) by way of data signals embodied in a propagation medium (e.g., via a communication link (e.g., a network connection)).
In the foregoing specification, the invention has been described with reference to specific exemplary embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
Consider a simple Single-Input Single-Output (SISO) discrete system described in state space form as:
x
k+1
=Ax
k
+Bu
k
y
k
=Cx
k (1)
(Hereinafter bold font for lower-case symbols denotes vectors and bold font for upper-case symbols denotes matrices). Assume that the system matrices A, B, and C are known and that xk is the state vector, uk is the control input, and yk is the output at time k. The model described above can be used to estimate the future state of the system. Assuming a desired trajectory wk is known an estimated error signal êk=wk−{circumflex over (k)}k is computed over a finite set of future time instants called the prediction horizon, Hp (hereinafter the symbol “A” is used to represent an estimated quantity). In model predictive control, the control computation problem is cast as a finite time discrete optimal control problem. To compute the control input at a given time instant, a quadratic cost function is minimized through the selection of the control history over the control horizon. The cost function can be written as:
J=(W−Ŷ)TQ(W−Ŷ)+UTRU, (2)
where
W=[w
k+1
,w
k+2
, . . . ,w
k+H
]T, (3)
Ŷ=K
CA
x
k
+K
CAB
U, (4)
U=[u
k
,u
k+1
, . . . ,u
k+H
−1]T, (2)
and both R and Q are symmetric positive semi-definite matrices of size Hp×Hp. Equation 1 is used to express the predicted output vector Ŷ in terms of the system matrices
The first term in Eq. (2) penalizes tracking error, while the second term penalizes control action. Equations (2), (6), and (7) can be combined resulting in the cost function
J=(W−KCAxk−KCABU)TQ(W−KCAxk−KCABU)+UTRU (8)
that is now expressed in terms of the system state xk, desired trajectory W, control vector U and system matrices A, B, C, Q, and R.
The control U, which minimizes Eq. (8), can be found analytically as
U=K(W−KCAxk), (9)
where
K=(KCABTQKCAB+R)−1KCABTQ. (10)
Equation 10 contains the optimal control inputs over the entire control horizon, however at time k only the first element uk is needed. The first element uk can be extracted from Eq. (9) by defining K1 as the first row of K. The optimal control over the next time sample becomes
u
k
=K
1(W−KCAxk), (11)
where calculation of the first element of the optimal control sequence requires the desired trajectory W over the prediction horizon and the current state xk.
The full combined flexible system of the parafoil canopy and the payload can be represented as a 9 or 8 degree-of-freedom (DoF) model depending on the specific harness connecting these two pieces together. Alternatively it can also be modeled as a solid structure requiring only six-DoF, which include three inertial position components of the system mass center as well as the three Euler orientation angles of the parafoil-payload system. This section first introduces a six-DoF model of a generic parafoil system that will be used for simulation and GNC algorithm development, and then addresses a simplified model used to compute the MPC gains appearing in Eq. (11).
Orientation of the body frame {B} is obtained by a sequence of three body-fixed rotations. Starting from the inertial frame {I}, the system is successively rotated through Euler yaw ω, pitch θ, and roll φ. The resulting transformation from the inertial to body frame is
where the common shorthand notation for trigonometric functions is employed, so that for any angle α sin(α)≡sα and cos(α)≡cα. Translation kinematics of the system become
where x, y, and z are the inertial positions and u, v, and w are body frame velocities.
Defining the angular velocity of the parafoil payload system as:
ωB/I=piB+qjB+rkB (14)
results in the following rotational kinematics equations:
Forces and moments acting on the parafoil and payload have contributions from: weight, aerodynamic loads, and apparent mass of the canopy. Weight contribution of the system is expressed in the body frame,
with m being the system mass and g the acceleration from gravity. Aerodynamic forces and moments have contributions from both the canopy and payload. Both canopy and payload contributions are combined into a single aerodynamic model using standard aerodynamic derivatives. The aerodynamic force is modeled as:
where; α and β are the angle of attack and sideslip of the body frame, Va is the true airspeed, sp is the parafoil canopy area, and TAB is the transformation from the aerodynamic to body frame by the angle of attack α. Similarly, the aerodynamic moment is written as:
where, b and
where the second term represents the vector cross product using the skew-symmetric matrix sωB, constructed as follows:
(here ξx, ξy and ξz are the components of vector ξ expressed in a coordinate frame {A}).
Similarly, the angular velocity expressed in the canopy frame {P} becomes
Forces and moments from apparent mass and inertia are then found by relating the fluid's kinetic energy to resultant forces and moments. Apparent mass and inertia contributions expressed in the body frame can be written as:
Apparent mass and inertia values A, B, C, P, Q, and R appearing in Eq. (24) can be calculated for known simple shapes or can be approximated as discussed in Lissaman, P., and Brown, G., “Apparent Mass Effects on Parafoil Dynamics,” AIAA Paper 93-1236, May 1993.
Dynamic equations are formed by summing forces and moments about the system mass center, both in the body reference frame, and equating to the time derivative of linear and angular momentum. Final dynamic equations of motion are expressed compactly in matrix form below, where for the quantities in Eq. (24) the common convention is used for tensors of second rank such that is Iξ′=TBPTIξTBP.
The last three phases introduced in Appendix A (Phases 4-6) are the most critical stages of parafoil guidance. The system must be dropped up wind of the target to ensure it can be reached, however, it is desired to impact the target traveling into the wind to reduce ground speed. In addition it is beneficial to arrive near the target with excess altitude in order to make final guidance decisions. Finally, there is a very strict time limitation. The ADS can be slightly late or earlier departing/arriving to all other phases, but this last Phase 6 ends sharply at landing. All this means that special precautions have to be made in building a control algorithm for the terminal phase.
First, assume that there is no cross wind component, i.e. that the ground winds uploaded to the system before deployment have not changed. An ideal terminal guidance trajectory can be defined as outlined in
The terminal guidance problem can be summarized as follows. For a parafoil in the presence of wind W, at altitude z, and a distance L from the target, find the distance Dswitch to the final turn initiation point (TIP), required to travel past the target for an ideal impact at t2 (of course, Dswitch is a function of the desired Tappdes.)
In general, the dynamic model of a parafoil is complex and nonlinear, so that the problem can only be solved numerically. However, in what follows we will make some assumptions, allowing an analytical solution to be used as a reference trajectory in the control algorithm. These assumptions are: a) the turn rate is slow, so that the roll and sideslip angles can be ignored, and b) the descent rate Vv* and air speed Vh* are viewed as nearly constant (defined by the canopy, lines, etc. and treated as the known values). In this case it immediately follows that
The problem reduces to handling a simple kinematic model represented by three components of the ground velocity as:
Now, the reference turn function ψ(t) can be chosen as any function that satisfies the boundary conditions ψ(t0)=0 and ψ(t1)=−π (for the left pattern as shown on
Hence, the most straightforward algorithm to control the descending system at the terminal phase is to control its turn rate for example as follows:
(the plus-minus signs correspond to the left and right turn, respectively). After the final turn the system travels directly to the desired target. Assuming that the wind W is constant all way down and a constant turn rate (3), integration of inertial velocities along axes x and y from tstart to t2 (Phases 4-6) yields two simple equalities:
Resolving them with respect to Dswitch and a Tapp results in
From Eqs. (7) and (8) it can be seen that the higher the altitude z, the larger Dswitch and Tapp become. As the parafoil loiters upwind of the target, zstart the altitude at which to turn towards the target can be found by using a desired final approach time apps Tappdes. The switching altitude to achieve app Tappdes is then given by solving Eq. (8) for z leading to the following expression:
Once the system is traveling towards the target the goal is to bring the system from its initial state at the top of the downwind led to the point defined by xT=Dswitch and yT=∓2R (for the left and right turn, respectively). The distance {circumflex over (D)}switch is estimated during the downwind leg constantly using the analogue of Eq. (7):
where {circumflex over (V)}h*, {circumflex over (V)}v* and Ŵ are the estimates of the corresponding parameters at current position ({circumflex over (x)}, {circumflex over (z)}). Note, Eq. (10) produces the value of {circumflex over (D)}switch in the assumption that Vh*, Vv* and W remain constant from the current altitude all way down.
To overcome the difficulties of fighting unaccounted winds the following two-point boundary-value problem (TPBVP) was formulated. Staring at some initial point at t=0 with the state vector defined as x0=[x0, y0, ψ0]T we need to bring our ADS influenced by the last known constant wind w=[W,0,0]T to another point, xf=[*Vh*+W)Tappdes, 0, −π]T (for consistency with Appendix B we will consider a left pattern turn) at t=tf. Hence, we need to find the trajectory that satisfies these boundary conditions along with a constraint imposed on control (yaw rate), |{dot over (ψ)}|≦{dot over (ψ)}m, while finishing the maneuver in exactly Tturn seconds (if needed, the performance index may also include additional terms related to the compactness of the maneuver and/or control expenditure). The found optimal control {dot over (ψ)}opt(t) is then tracked by the ADS GNC unit using the MPC algorithm in Appendix A. Unaccounted winds wdist=[wx, wy, 0]T (the vertical component will be accounted for indirectly via estimating the current {circumflex over (V)}v) will not allow exact tracking of the calculated optimal trajectory. Computation of the optimal trajectory will be updated during the final turn, each time starting from the current (off the original trajectory) initial conditions, requiring the ADS to be at xf=[(Vh*+W)Tappdes, 0, −π]T in Tturn seconds from the beginning of the turn. The remaining time until arrival at the final approach is computed as
where Tappfinal is the final calculated approach time from Eq. (8) before entering the final turn.
Development of the optimal trajectory algorithm begins by recalling from Eq. (2) the horizontal trajectory knimematics:
Recognizing that if the final turn horizontal trajectory is given by Eq. (2) the yaw angle along this trajectory is related to the change of inertial coordinates as follows:
Differentiating (3) provides the yaw rate control required to follow the reference final turn trajectory in presence of constant wind W:
The inertial (ground) speed along the trajectory will also depend on the current yaw angle:
|VG|=√{square root over ({dot over (x)}2+{dot over (y)}2)}=√{square root over (Vh*2+W2−2Vh*W cos ψ)}. (5)
Now, following the general idea of direct methods of calculus of variations (e.g., see Yakimenko, O., “Direct Method for Rapid Prototyping of Near-Optimal Aircraft Trajectories,” AIAA Journal of Guidance, Control, and Dynamics, vol. 23, no. 5, 2000, pp. 865-875.) we will assume the solution of the TPBVP to be represented analytically as functions of some scaled abstract argument
x(
y(
The coefficients aiη and biη (η=1, 2) in these formulas are defined by the boundary conditions up to the second-order derivative at τ=0 and τ=τf (
While the final conditions (8) will be constant (the second derivatives are zeroed for a smooth arrival), the initial conditions will reflect the current state of the system at each cycle of optimization. Let us now differentiate Eqs. (6) two times with respect to τ to get:
τfPη′(
τf2Pη″(
Equating these derivatives at the terminal points to the known boundary conditions (7)-(8) yields a system of linear algebraic equations to solve for coefficients aiη and biη (η=1, 2). For instance, for the x-coordinate we'll get
Being resolved this system yields
The only problem is that the derivatives in Eqs. (11) are taken in the virtual domain, while the actual boundary conditions are given in the physical domain. Mapping between the virtual domain [0;τf] and physical domain [0;τf] is addressed by introducing a speed factor λ:
Using this speed factor we may now compute corresponding derivatives in the virtual domain using the obvious differentiation rules valid for any time-variant parameter ξ:
{dot over (ξ)}=λξ′, {umlaut over (ξ)}=λ(λ′ξ′+λξ″). (13)
Inverting Eqs. (13) yield:
ξ′=λ−1{dot over (ξ)}, ξ″=λ−2{umlaut over (ξ)}−λ′λ−1{dot over (ξ)}. (14)
Note that we only need to use Eqs. (14) once to transfer the boundary conditions. Since the speed factor λ simply scales the entire problem—the higher speed factor λ is, the larger τf it results in (see explanation in Lukacs, J., and Yakimenko, O., “Trajectory-Shaping Guidance for Interception of Ballistic Missiles during the Boost Phase,” AIAA Journal of Guidance, Control, and Dynamics, vol. 31, no. 5, 2008, pp. 1524-1531.)—we may let
λ0;f=1 and λ0;f′=0, (15)
which means we can safely assume
ξ′={dot over (ξ)}, ξ″={umlaut over (ξ)}. (16)
Now let us describe the numerical procedure for finding the optimal solution among all candidate trajectories described by Eqs. (6). First, we guess the value of the only varied parameter τf and compute the coefficients of the candidate trajectory using Eqs. (11) with the boundary conditions (7) and (8) converted to the virtual domain via Eqs. (14) (accounting for Eqs. (15)). For the initial value of τf we can take the length of the circumference connecting terminal points:
Having an analytical representation of the candidate trajectory, Eqs. (6) and (9), define the values of xj, yj, x′j, and y′j, j=1, . . . , N over a fixed set of N points spaced evenly along the virtual arc [0;τf] with the interval
Δτ=τf(N−1)−1, (18)
so that
τj=τj−1+Δτ, j=2, . . . ,N, (τ1=0). (19)
Then, for each node j=2, . . . , N we compute
(ψ1≡ψ0), and
λj=ΔτΔTj−1−1. (21)
The yaw angle ψ can now be computed using the virtual domain version of Eq. (3):
Finally, the yaw rate {dot over (ψ)} is evaluated using Eq. (4) (with time derivatives evaluated using Eq. (23)) or simply as
{dot over (ψ)}j=(ψj−ψj−1)Δtj−1−1. (23)
When all parameters (states and controls) are computed in each of the N points, we can compute the performance index
with k{dot over (ψ)} being a scaling (weighting) coefficient. Now the problem can be solved say in the Mathworks' development environment with as simple built-in optimization function as fminbnd. It should be noted that the numerical algorithm based on the direct method introduced in this Appendix with the non-gradient optimization routine fminbnd based on the straight forward golden section search and parabolic interpolation algorithm allows computing the optimal turn trajectory very fast. To be more specific a 16 bit 80 MHz processor, allowed computation of the 17.5 second turn maneuver with N=20 in 10 iterations, which took only 0.07 s all together. With the controls update rate of 0.25 s that means that the trajectory can be updated as often as every control cycle.
The optimal turn computation presented in Appendix C for the simple case of a constant speed profile can be generalized even further if there is more information about the winds known a priori. For example, assume that instead of a constant x-component of the prevailing wind versus altitude h we have a linear profile
W(h)=WG+kh (1)
where WG is a known ground wind and coefficient
is defined by the ground wind WG and wind W0 measured at altitude h0=−z0 (corresponding to the point where the final turn begins).
Then, the two-point boundary-value problem will be formulated for a slightly different system of kinematic equations
and different boundary conditions. To be more specific, staring from some different initial point, defined by a different expression for a Dswitch, we will need to bring a parafoil to the point
To compute the offset in Eq. (8) we used the fact that the final approach starts at the altitude Vv*Tappdes, so that using the obvious relation
we may write
In this case, inverting equations (7) yields
and its differentiation should account for Eq. (6), so that
The only modifications the numerical algorithm will require is that it will involve the new boundary conditions
computation of an altitude
h
j
=h
j−1
−V
v
*Δt
j−1
, j=2, . . . ,N, (h1=−z0). (15)
and the corresponding wind magnitude
W
j
=W
G
+kh
j (16)
The latter two values will be used in
In the case of a logarithmic wind profile
W(h)=+β+α ln(h) (19)
some of the above equations will be replaced with the new ones
The remaining ones will be the same.
Similarly, the optimization routine can accommodate crosswinds is they are known in one form or another. This may happen when the horizontal winds profile versus altitude is available. Consider
W
x(h)=fx(h), Wy(h)=fy(h) (24)
to be x- and y-components of a horizontal wind profile approximated with some analytical dependence (e.g. of the form of Eq. (6) or (16) or cubic spline). Then, we can write
The final point will then be defined as
x
f
=[x
f
,y
f,−π]T (26)
where offsets in x- and y-directions will be computed as
The heading angle equation will look as
while its derivative will be presented by
The total speed will be expressed as
The numerical procedure will proceed with the boundary conditions
and will involve computing wind components at each step
W
xj
=f
x(hj) and Wyj=fy(hj) (33)
to be used in the numerical equations similar to those above.
For operational use the vertical winds profile can be reduced to the so-called ballistic winds. In other words, if at some altitude H we have a ballistic wind of magnitude WB and direction ψW, then the effect of variable winds w(h) for some system with the descent rate Vv on its way from altitude H down to the surface is reduced to simple formulas:
or in other words
Substituting integrals with the finite sum of trapezoids based on the discrete values of hk, wk, and ψwk, k=1, . . . , M, we get
The index starts from 2 because by definition the winds measurements at the lowest altitude can be considered ballistic winds at this altitude.
From Eqs. (3) it further follows that
For the specific case when hk−hk−1=Δh=const, k=2, . . . , M, Eqs. (42) can be further reduced to
In the following derivation, the assumption of a constant or piecewise constant wind profile will be discarded and replaced by the assumption that wind speed W varies logarithmically with altitude z as:
W(h)=(mW)ln(h/h0), (W(h)=0, for h≦h0) (1)
where α and β are constants. Note that, since altitude z is represented as a negative number according to the sign convention in use, an additional factor of −1 is included in the argument of the logarithm. The derivation uses this assumption for the wind profile, along with the assumptions that the steady-state, no-wind values of the ADS horizontal and vertical velocities are known and labeled Vh* and Vv*. Furthermore, it is assumed that the wind vector lies only in the horizontal plane, and is parallel with the x axis of the coordinate system depicted in
z
start
+V
v
*T
downwind
+V
v
*T
turn
+V
v
*T
app=0 (2)
where Tdownwind represents the time duration required to travel the sum of distances L and Dswitch. Again, recall that under the sign convention being used here, zstart is a negative number and that Vv* and all time durations are positive. Assuming that the Snowflake's turn rate is constant, and that the turn will encompass 180° of a circle of known radius R, the time duration for the turn Tturn is a known constant in terms of R and Vh* (see Appendix B, Eq. 33). Therefore, this equation has only two unknowns: Tdownwind and Tapp.
Under the assumption of a constant wind profile, a simple expression for Tdownwind could be written in terms of unknown value Dswitch. Also using the constant wind profile assumption, the x-budget equation in Appendix B can be simplified into an equation containing two unknowns: Dswitch and Tapp; therefore the two linear equations in two unknowns could easily be solved. Under the assumption of a logarithmic wind profile as in Eq. (1) on the current page, Tdownwind cannot be replaced by a simple expression containing Dswitch. Instead, in order to compute Tdownwind assuming that the wind profile is logarithmic, a value of Dswitch must be assumed, and then the time t0 can be computed. Time t0 is computed using the assumption of constant vertical velocity from the following simple relation:
where altitude z0 had been calculated using the Lambert W function as follows:
where a, b, and c are constants that can be expressed in terms of known quantities Vh*, Vv*, a, b, L, zstart, and assumed quantity Dswitch.
The iteration procedure to calculate Dswitch is as follows:
1. Select an initial guess value for Dswitch
2. Using the initial guess value for Dswitch, calculate z0 using Eq. (4) on this page, and Tdownwind from:
3. Using Tdownwind, calculate Tapp using Eq. (2) on the previous page
4. Compute z1 using the assumption of constant vertical velocity
z
1
=z
0
+V
v
*T
turn (7)
5. Compute {tilde over ( )}D from known quantities:
6. Compute Lapp using Tapp using:
7. Compute Dswitch from:
D
switch
={tilde over (D)}+L
app (10)
8. Use value of Dswitch computed in step 7 as the next iteration estimate of Dswitch in step 1. Repeat iterations until differences between subsequent values of Dswitch are below a threshold value.
The application claims the benefit of U.S. Provisional Application No. 61/324,222 entitled, “Method and System For Optimized Terminal Guidance Of Autonomous Aerial Delivery Systems”, filed on Apr. 14, 2010 and U.S. Provisional Application No. 61/324,551 entitled, “Method and System for Improving Touchdown Accuracy Of Aerial Payload Delivery Using Ground Weather Station Uplink”, filed on Apr. 15, 2010, and U.S. Provisional Application No. 61/323,792 entitled, “Method and System For Control Of Autonomous Aerial System via GSM Cellular Network”, filed on Apr. 13, 2010 and U.S. Provisional Application No. 61/323,750 entitled, “Method and System For Establishing A Short-term Network Mesh Using Miniature Autonomously Guided Parafoils”, filed on Apr. 13, 2010 and U.S. Provisional Application No. 61/323,675 entitled, “Method and System For Vertical Replenishment Of Naval Vessels Via Precision Guided Airdrop”, filed on Apr. 13, 2010 all of which are also hereby incorporated by reference.
Number | Date | Country | |
---|---|---|---|
61324222 | Apr 2010 | US | |
61324551 | Apr 2010 | US | |
61323792 | Apr 2010 | US | |
61323750 | Apr 2010 | US | |
61323675 | Apr 2010 | US |