Precomputed Pathfinding for Large and Detailed Worlds on MMO Servers
نویسندگان
چکیده
منابع مشابه
An Evaluation of Checkpoint Recovery for Massively Multiplayer Online Games
Massively multiplayer online games (MMOs) have emerged as an exciting new class of applications for database technology. MMOs simulate long-lived, interactive virtual worlds, which proceed by applying updates in frames or ticks, typically at 30 or 60 Hz. In order to sustain the resulting high update rates of such games, game state is kept entirely in main memory by the game servers. Nevertheles...
متن کاملUsing Multi-level Graphs for Timetable Information in Railway Systems
In many fields of application, shortest path finding problems in very large graphs arise. Scenarios where large numbers of on-line queries for shortest paths have to be processed in real-time appear for example in traffic information systems. In such systems, the techniques considered to speed up the shortest path computation are usually based on precomputed information. One approach proposed o...
متن کاملMulti-core scalable and efficient pathfinding with Parallel Ripple Search
Game developers are often faced with very demanding requirements on huge numbers of agents moving naturally through increasingly large and detailed virtual worlds. With the advent of multi-core architectures, new approaches to accelerate expensive pathfinding operations are worth being investigated. Traditional single-processor pathfinding strategies, such as A and its derivatives, have been lo...
متن کاملParallel Ripple Search - Scalable and Efficient Pathfinding for Multi-core Architectures
Game developers are often faced with very demanding requirements on huge numbers of agents moving naturally through increasingly large and detailed virtual worlds. With the advent of multi-core architectures, new approaches to accelerate expensive pathfinding operations are worth being investigated. Traditional single-processor pathfinding strategies, such as A* and its derivatives, have been l...
متن کاملDistributed Rendering of Virtual Worlds
We present a system for distributed rendering of large and detailed virtual worlds. A cluster of servers create and maintain a hierarchical representation of the world that can be propagated to an unlimited number of clients through a content-distribution network. The preprocessing is easy to parallelize and storage requirements are minimal. Using a small subset of the representation, a client ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015