Title :
Graph processing by which to evacuate a mine
Author_Institution :
Dept. of Comput. Sci., Kentucky State Univ., KY, USA
Abstract :
A continuing problem in underground mining is safe and timely evacuation in an emergency. This problem is addressed by showing (a) how underground mines can be represented as graphs which structurally conform to proper ventilation requirements, (b) how these graphs can be processes to detect and locate mine hazards, and (c) how theses graphs can further be processed to determine the safest escape paths away from a hazard, once it is located. The algorithms described will be an essential part of any expert system capable of managing and advising mine ventilation decisions in response to real time events
Keywords :
engineering computing; graph theory; mining; safety; emergency; evacuation; expert system; mine hazards; mine ventilation decisions; real time events; safest escape paths; underground mining; ventilation requirements; Computer science; Disaster management; Expert systems; Hazards; Matrix converters; Personnel; Real time systems; Tail; Testing; Ventilation;
Conference_Titel :
Applied Computing, 1990., Proceedings of the 1990 Symposium on
Conference_Location :
Fayetteville, AR
Print_ISBN :
0-8186-2031-5
DOI :
10.1109/SOAC.1990.82155
