Probabilistic decompression models have some fundamental differences to deterministic decompression algorithms (e.g. ZH-L16 or VPM-B) that result in quite different looking schedules. Probabilistic schedules will not always produce monotonically increasing stop times and will even skip stops. There are two parts to the explanation of this behavior. First, in typical deterministic decompression algorithms comprised of a collection of compartments with different half-times that represent potential DCS-sites (e.g. ZH-L16 or VPM-B), at any point in time the decompression is determined by one controlling (or leading) compartment, and shallower decompression stops get longer as control is passed to successively slower half-time compartment. This produces useful schedules, but it does not make physiological sense; bubbles can exist (either growing or shrinking depending on prevailing conditions) in any compartment that has been supersaturated, and every such DCS-site contributes to the risk of DCS whenever it contains bubbles. This is formalized in probabilistic models where the probability of DCS is one minus the joint probability of no injury in all compartments. Therefore, all compartments can contribute to the probability of DCS at all times, and consequently all compartments can control stops throughout decompression. Second, there are a variety of ways to implement a probabilistic decompression algorithm, but all of them involve calculating the probability of DCS out to the end of risk accumulation, i.e. through the whole schedule and out to some long time after surfacing. In other words, unlike deterministic algorithms which calculate each stop completely independent of what is going to happen next, a probabilistic algorithm has to take into account what is going to happen next. Therefore a probabilistic algorithm might, for instance, find that extra time at the first stop will allow subsequent stops to be shorter. The easiest example of this is if scheduling decompression that will have gas switches to higher oxygen fraction, the probabilistic algorithm ‘knows’ they are coming and therefore might find the best schedule is to skip the stop before the switch in favor of getting on to the higher oxygen fraction gas.
All this makes people who are only familiar with traditional algorithms and schedules uncomfortable until they try it and find it works.
David Doolette
Thank you David.
I'd like to point out some similarities, with the Probabilistic implementation description above, and existing VPM implementation. The VPM model implementation has some characteristics in common with probabilistic implementations:
VPM has consideration of the whole ascent and surface portion, on every dive. VPM does this through doing several iterations of the whole ascent, and comparing them on the basis of overall critical volume (supersaturation), for the entire dive and surface supersaturation period. It resolves the final ascent based on this collective result. This also gives VPM the broader characteristic of considering what is to come next, as described above for probabilistic models. The example above of higher O2 at the end of a schedule may lead to reduced times in the earlier stops, is also typical of VPM, if seen as beneficial to the whole ascent. However, VPM does fall back to conventional monotonically increasing stop times, as its built to work that way.
Of course VPM is not currently tied to a known risk number as yet, but it seems the underlying model implementation design is sufficiently sophisticated to be able to be expanded for a risk value input.
.