ACQUIRING METHOD OF SHORTEST PATH OF EMERGENCY EVACUATION SYSTEM

摘要

A method for producing the shortest safe path between two nodes in a home network system is provided to produce the shortest escape path efficiently by applying the concept of a node weight to an existing Dijkstra algorithm and easily modifying the whole network structure. A server expresses a home network system as nodes and edges(S21). Then the server appoints an NW(Node Weight) and an EW(Edge Weight) respectively to each node and edge(S22). If an emergency is detected from the information collected through sensor nodes(S23), the server updates the node weight of a specific node, where the emergency has been generated, to infinity(S24). Then the server applies a Dijkstra algorithm and produces the shortest path to an exit from the present location of a user(S25).