CHOSUN

net-VE에서 EKF-DR 경로예측을 이용한 동적데이터 공유 메카니즘 구현

Metadata Downloads
Author(s)
송선희
Issued Date
2006
Abstract
net-VE(Network Virtual Environment) is a system that links the distributed network to the virtual reality technology and offers 3 dimensional world to help distributed multi users mutually interact through real time networking. In the net-VE system, distributed network technology, such as network broadband, fairness, distributed mutual interaction, synchronization, resource management and expansion, and other different technologies become organic within a single system. Additionally, synchronization resulting from time delay requires technologies regarding collision check at a natural reality, accord and resolution.
Consistency at a distributed virtual environment of the client-server structure is maintained by endless exchange of static information among distributed clients. The regular transfer of static information brings traffic overhead of network. The precise way for network users to know the others’ static is to transfer the packet by hand shaking for each frame, which takes a big burden of the synchronization and reduces the velocity. As the current static transferring value, , does not arrive at the time, , without packet delay time, a reconciliation between the scope setting permitting errors and broadband for updates is needed during a cycle interval of the synchronization.
There are two approaches solving the bandwidth problem within the net-VE system where you can lessen the occurrence of dynamic data or minimize the received messages and decrease the bandwidth of the overall virtual world. The main technique that minimizes the received traffic of dynamic data and lessens the overall bandwidth is the Dead-reckoning algorithm. This is first of all a method that transfers current coordinates and speeds constantly and synchronizes them, then estimates the location during the synchronization for each client. From the recipient, they can take this value and apply Dead-reckoning and estimate the observation location till the next synchronization. While the movement becomes unnatural when the synchronization time becomes long. As the movement locus becomes an aggregation of straight lines, the merit is that the error does not accumulate as it lessens the errors whenever the synchronization occurs. Secondly, as the Dead-reckoning of DIS(Distributed Interactive Simulation) calculates the location of its own object, it transfers and performs synchronization when the error becomes bigger than the limit value, so that while there is less delay when the dynamic data does not change directions aggressively, efficiency is significantly decreased.
As mentioned above, although the Dead-reckoning method is the most used and efficient method, it is difficult to perform estimations for single-shot and unpredictable events. So, when a new participant is linked to the 3D scene of the network’s virtual world, and as the frequent broadcast that maintains consistency and has mutual reactions with other participants and sharing initiates jerks that are caused by network delay, and collision and late information transfer, it is important to reflect the shared event among multi users through location reinforcement by prompt path estimation. A Kalman filter measures the status by repeating the estimation and filtering every level; as this filter uses the most recent estimated status information, it can calculate the best estimation possible for future statuses.
This study will design a path estimation model that uses EKF-DR(Extended Kalman Filter) which measures the status by repeating the estimation and filtering for each level and will estimate the path of the dynamic data at the client cache. Also, it will decrease the estimation error and increase the path estimation efficiency by using the actual measured value of the movement locus and the measured error value information. It will finally simulate the path estimation that uses the Dead-reckoning algorithm of the DIS and EKF-DR and compare the results.
When a new client is linked to a 3D scene of the network virtual world, it interpolates the previous location with the Dead-reckoning path prediction algorithm of DIS to maintain consistency and shows the natural dynamic data sharing scene of the 3D virtual world. The shared dynamic data of the 3D virtual environment is implementation using the DIS/X3D/Java EAI.
Alternative Title
Implementation of Dynamic Data Sharing Mechanism using EKF-DR Path Prediction in Network Virtual Environment
Alternative Author(s)
Song, Sun-Hee
Affiliation
조선대학교 대학원
Department
일반대학원 컴퓨터공학과
Advisor
羅相同
Awarded Date
2007-02
Table Of Contents
ABSTRACT
제 1 장 서론 = 1
제 2 장 네트워크 가상환경 = 4
제 1 절 네트워크 가상환경 시스템 = 7
제 2 절 분산 가상환경 = 11
2.1 DIS 기반 가상공간 구축 = 12
2.2 네트워크 대역폭 = 20
제 3 장 네트워크 가상환경의 동적데이터 = 26
제 1 절 동적데이터 시스템 = 26
제 2 절 동적데이터 동작 프로토콜 = 34
2.1 동적데이터 동작 = 38
2.2 동적데이터 통신 = 42
제 4 장 DIS에서의 경로예측 알고리즘 = 46
제 1 절 데드레커닝 = 46
제 2 절 확장 칼만필터 = 50
제 5 장 제안된 동적데이터 경로예측 = 57
제 1 절 EKF-DR 경로예측 알고리즘 = 57
제 2 절 EKF-DR에 의한 예측위치 보간 = 66
2.1 Last ESPDU 업데이트 = 70
제 3 절 DR 수렴 알고리즘 = 73
제 4 절 동적데이터 필터링 = 76
제 6 장 성능평가 및 구현 = 79
제 1 절 시뮬레이션에 의한 성능평가 = 79
1.1 EKF-DR 예측 업데이트 수 측정 = 83
1.2 DR 예측위치 수렴 측정 = 85
제 2 절 다중참여 3차원 동적데이터 공유 구현 = 90
제 7 장 결론 = 106
[참고문헌] = 108
[부록 1] = 112
[부록 2] = 125
Degree
Doctor
Publisher
조선대학교 대학원
Citation
송선희. (2006). net-VE에서 EKF-DR 경로예측을 이용한 동적데이터 공유 메카니즘 구현.
Type
Dissertation
URI
https://oak.chosun.ac.kr/handle/2020.oak/6493
http://chosun.dcollection.net/common/orgView/200000233864
Appears in Collections:
General Graduate School > 4. Theses(Ph.D)
Authorize & License
  • AuthorizeOpen
  • Embargo2008-09-10
Files in This Item:

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.