Path finding and flow control for virtual reality augmented evacuation system for large indoor areas
From Euler's seven-bridge problem to modern robot motion planning techniques, path finding has been a very important part of network analysis in operations research. And finding the shortest path between two nodes in a network is a classical problem in a number of research areas. Although some...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Theses and Dissertations |
| Language: | English |
| Published: |
2010
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/39353 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | From Euler's seven-bridge problem to modern robot motion planning techniques, path finding has been a very important part of network analysis in operations research. And finding the shortest path between two nodes in a network is a classical problem in a number of research areas. Although some general one-source-to-one-target shortest path algorithms have already been developed, such as Dijkstra's shortest path algorithm, in some cases, some alternative algorithms with lower computation complexity may be preferred due to the properties of real tasks. |
|---|