Emergency response planning

information system

Victor RomanovIlya Moskovoy

Margarita Onokhova

Oil production growth (million tons)

0

200

400

600

323.3348.1

379.7421.4

459.0 470.0 480.6 491.4 488.6 494.3 505.2 511.4 518.0

0

10

20

30

40

50

60

9.3 8.9

14.7 15.6

30.2

42.246.9

37.2

47.3

40.7

46.149.9

47.3

Oil production revenue in the budget of Russian Federation

Flaws of fuel and energy sector:

High degree of wear of fixed assets (in the oil industry, almost 60% in the refining industry - 80%)

Sometimes organizations have not enough forces and means for liquidation of possible accidents associated with oil spillsEach year, repaired and replaced by no more than 2% of the pipelines, and they are on Statistics are the most vulnerable in terms of spills.

The number of pipeline raptures

The number of pipeline ruгptures

Every year in Russia into the environment poured several million tons of oil

minor local

importance• no more

than 100 tons of oil spilled and does fall outside the oil station

major local

importance • from 100 to

500 tons of oil spilled and does not fall outside the perimeter of the municipal entity

• the oil spill which involves up to 100 tons of oil and falls outside the borders of the oil station

territorial importanc

e • from 500 to

1000 tons of oil spilled and does not fall outside the perimeter of the territory

• the oil spills involving up to 100 tons of oil, which affect a body of water or seacoasts

regional importanc

e • involves from

1000 to 5000 tons of oil

• a spill of from 500 to 1000 tons of oil, which falls outside the perimeter of the constituent territory of the federation

• Oil spills of up to 100 tons of oil that may affect the water bodies and pollute the territory or the seacoasts

federal importanc

e • more than

5000 tons of oil

• more than 100 tons of oil, which may get into the inland waters or the seacoasts

Classification of oil spills

Events on localization and liquidation of oil spills are completed after the following steps:

Stop the discharge of oil and

petroleum products

Collect the spilled oil and petroleum products to the

highest attainable standard of due

specification used special techniques

Hosting of the oil and oil products

collected for subsequent

disposal, excluding secondary pollution production facilities

and the environment

Integrated solutions on automation of gas transporters and gas producers of JSC

‘Gazprom’

Structure of the integrated managing system

Informational system «OKO»

Automatic managing systems of JSC ‘Surguneftegaz’

Automatic managing systems of JSC ‘Surguneftegaz’

Corporate network of JSZ ‘Surgutneftegaz’

Russian systems of monitoring oil and gas pipeline ruptures and registration of oil spills:

• Parameter system «LeakSPY» (JSX «Energoavtomatica»)

• «Appius LD» (engineering company «Kombit»)

• «Infra acoustic system of the pipeline monitoring» (LLC «TORI»)

Main task in the elimination of unexpected situation in the oil transportation system is adequate planning to ensure the creation of a sequence of actions (plan) and their support staff and resources

Development of such an information system should be based on a theory that includes the

following concepts:

the actor

or agent

system status

situations actions

IS

The planning system is based on the following assumptions

1. System is static - no exogenous events that can change the state of the system.2. System is fully observable – i.e. the results of the states observation coincide with the states themselves.3. System is determined in the sense that by the results of the action are uniquely defined and unique in advance.4. System is finite - with a finite set of states and actions. 5. System is static - behavior of the system determined by the rules of transition states and external events have no effect on its behavior. 6. Solution to the problem of planning is a finite linearly ordered sequence of actions. 7. Actions have no duration in the state space 8. System does not allow for changes in the composition and transition from state to state in the planning process.

F-propositions set

Code ContentValue in the

initial state so

Value in the goal state sg

f1 The pipeline is in the working state 0 1

f2 Oil through pipeline enters to customer 0 1

f4

Operations Control Center received the message about the destruction of the pipeline due to explosion at the point with coordinates x1,y1

1 0

f16 Repair crew is situated at the place permanent stationing 1 1

f17Repair crew is situated at the destruction place of the pipeline

due to explosion at the point with coordinates x1,y10 1

f18The pipeline section is in the warehouse at the point with

coordinates x2,y21 0

f19The pipeline section is at the destruction place of the pipeline

due to explosion at the point with coordinates x1,y10 1

f28The pipeline plug at the destruction place of the pipeline due

to explosion at the point with coordinates x1,y1 is closed 0 0

f29The pipeline plug at the destruction place of the pipeline due

to explosion at the point with coordinates x1,y1 is opened 1 1

F-propositions setCode Content

Value in the initial state so

Value in the goal state sg

f30 The destruction of pipeline eliminated 0 1f32 Replacing the damaged section of the pipeline performed 0 1

f44 Repair crew returned at the place of permanent disposition 0 1

f46 The customer is notified about oil supply suspension 0 1f47 The customer is notified about oil supply resumption 0 1f57 The customer is not notified about oil supply suspension 1 0

f58 The customer is not notified about oil supply resumption 1 0

f59 Quality of work complies with the environmental requirements of the standards

0 1

f50 Oil comes to the customer 0 1f60 The pipeline section does not delivered from warehouse at

the point with coordinates x2,y2 to the destruction place of the pipeline due to explosion at the point with coordinates x1,y1

1 0

f61 Damaged pipeline section did not cut and changed by mean welding on the new one, just delivered

1 0

f63 All works to eliminate emergency completed, pipeline again in working condition 

0 1

Truncated set of propositions F

code s0 sg

f4 1 0f16 1 1f17 0 1f18 1 0f19 0 1f29 1 1f32 0 1f46 0 1f47 0 1f59 0 1f63 0 1

Truncated set of actions

a1 Clouse pipeline plug

a3 Direct repair crew with equipment at emergency point

a12 Notify the customer about oil supply suspension

a13 Notify the customer about oil supply resumption

a14Monitor the quality of work and it correspondence to the ecological standards and

requirements

a15 Open the pipeline plug

a16 Deliver the pipeline section from warehouse to the emergency place

a17Repair crew to cut damaged part of the pipeline and change it by welding to the

new one just delivered from warehouse.

a19 Repair crew return back to the place of permanent disposition

а22 Due to the completion of work to reintroduce pipeline into operation

Table Pre(a)

Condition Action

f4 f29 a1

f4f29 a3

f4f29 f17 a12

f17 f19 f32 a17

f18 a16

f17f19f29 f32 a17

f17f19f29 f32 a17

f29f32f63 а15

f32 a14

f46 -

f47 a22

f59f63 a24

f63 -

Tables Add(a) and Del(a)

Actions Propositionsa1 f29

a3 f17

a12 f46

a13 f47

a14 f59

a15 f63

a16 f19

a17 f32

а22 f29

а24 f47

Actions Propositionsa1 f29

a12 f4

a16 f18

a15 f17

Add(a)

Del(a)

. F- Difference

Description of algorithm1. Define variables - the current plan as a sequence of selected actions to this moment. Set up a variable , that will contain plan formed when the target vertex was reached.2. Variable L is created, which stores the length of the generated plan, and n - count of the number of the acts committed. Counter value at the time of program start = 0. Variable (array) cs is created, which stores the states as they passed by algorithm.

3. Starting from the node s0, scan the list of preconditions. The value of the variable L is high (much greater than all operations can be performed).4. Form a list of active operations, ie actions that may be performed in this step (they satisfy the precondition in the state and set a value of the vector responsible for the passed state n = 0).

5. Save s0 state in the cs variable.

6. Make depth first search, that is apply the fist action from the list of active operations.7. Compute vector D –difference between current and goal states.8. Algorithm refers to F-difference and looks in turn lines vector D, starting from the top, until it finds the first one with value 1. Selects a value in the code column and searches in the table pre (a) in an attempt to find an action that fulfilled the preconditions and that would eliminate the distinction between them.9. The algorithm checks all the conditions on satisfiability in given state, first action for which the precondition is satisfied, places to the list , into variable L places and sums depending on the option, either one (the number of actions in the current plan), or the time or cost of operation).

Description of algorithm10. The algorithm selects the action stored in and accesses the tables add(a) and del(a) corresponding to the selected operator and produces post-condition operations on the current state.

11. The algorithm compares the newly obtained state s1 to the target state sg, by performing a equivalence negation. If the state does not match, repeat the steps above for the state s1 and again founded action put into - current plan. With another founded action algorithm reiterates tables add(a) and del(a) operations.12. Algorithm repeats the same sequence of actions not yet come to a state that does not satisfy any preconditions sn and the corresponding vector F- difference, which did not comply with any of the preconditions, hence none of action can not be performed (dead-end node). Then the algorithm returns to the previous state sn-1 and the previous queue of action .

13. Returning to a previous state, the algorithm selects a new action and repeats all the cycles until it reaches the next dead-end node or target node. As a result, the algorithm retains all the plans ended achievement target node and matching these plans length (or cost / time). Completed blind nodes or nodes, all paths of which were passed are marked as traversed 14. The algorithm works as long as have done them all the vertices, including primary. At the final stage of the algorithm chooses the plan with the smallest length (time/cost).

Flowchart (part 1)

Flowchart (part 2)

Flowchart (part 3)

Flowchart (part 4)

Flowchart (full)

THANK YOU FOR ATTENTION!