• Title/Summary/Keyword: virtual constraint

Search Result 84, Processing Time 0.023 seconds

Design and Implementation of Virtual Reality Prototype Crane Training System using Unity 3D (Unity 3D를 이용한 가상현실 프로토타입 크레인 훈련 시스템 설계 및 구현)

  • Heo, Seok-Yeol;Kim, Geon-Young;Choi, Jung-Bin;Park, Ji-Woo;Jeon, Min-Ji;Lee, Wan-Jik
    • The Journal of the Convergence on Culture Technology
    • /
    • v.8 no.5
    • /
    • pp.569-575
    • /
    • 2022
  • It is most desirable to build a crane training program in the same evvironment as the actual port, but it has problem such as time constraint and cost. To overcome these limitations, next-generation training programs based on AR/VR are receiving a lot of attention. In this paper, a prototype of a harbor crane training system based on virtual reality was designed and implemented. The system implemented in this paper consists of two elements: an Arduino-based IoT terminal and an HMD equipped with a Unity application program. The IoT terminal consists of 2 controllers, 2 toggle switches, and 8 button switches to process data generated according to the user's operation. The HMD uses Oculus Quest2 and is connected to the IoT terminal through wireless communication to provide user convenience. The training system implemented in this paper is expected to provide trainees with a training environment independent of time and place through virtual reality and to save time and money.

Analysis Method for Multi-Flexible-Body Dynamics Solver in RecurDyn (RecurDyn 솔버에 적용되어 있는 유연 다물체 동역학에 대한 해석기술)

  • Choi, Juhwan;Choi, Jin Hwan
    • Transactions of the KSME C: Technology and Education
    • /
    • v.3 no.2
    • /
    • pp.107-115
    • /
    • 2015
  • The analysis of multi-flexible-body dynamics (MFBD) has been an important issue in the area of the computational dynamics. This technique has been developed and improved in RecurDyn solver. This paper reviews the formulation which is applied in the RecurDyn solver. Basically, in order to solve the multi-flexible-body dynamics problem, an incremental finite element formulation using a corotational procedure is used. In particular, in order to solve the rigid and flexible bodies together, a constraint equation between a rigid body and a flexible body is applied, in which a virtual body and a flexible body joint are introduced.

Thermoelastic effect on inter-laminar embedded delamination characteristics in Spar Wingskin Joints made with laminated FRP composites

  • Mishra, P.K.;Pradhan, A.K.;Pandit, M.K.;Panda, S.K.
    • Steel and Composite Structures
    • /
    • v.35 no.3
    • /
    • pp.439-447
    • /
    • 2020
  • This paper presents two sets of full three-dimensional thermoelastic finite element analyses of superimposed thermo-mechanically loaded Spar Wingskin Joints made with laminated Graphite Fiber Reinforced Plastic composites. The study emphasizes the influence of residual thermal stresses and material anisotropy on the inter-laminar delamination behavior of the joint structure. The delamination has been pre-embedded at the most likely location, i.e., in resin layer between the top and next ply of the fiber reinforced plastic laminated wingskin and near the spar overlap end. Multi-Point Constraint finite elements have been made use of at the vicinity of the delamination fronts. This helps in simulating the growth of the embedded delamination at both ends. The inter-laminar thermoelastic peel and shear stresses responsible for causing delamination damage due to a combined thermal and a static loading have been evaluated. Strain energy release rate components corresponding to the Mode I (opening), Mode II (sliding) and Mode III (tearing) of delamination are determined using the principle of Virtual Crack Closure Technique. These are seen to be different and non-self-similar at the two fronts of the embedded delamination. Residual stresses developed due to the thermoelastic anisotropy of the laminae are found to strongly influence the delamination onset and propagation characteristics, which have been reflected by the asymmetries in the nature of energy release rate plots and their significant variation along the delamination front.

Price-based Resource Allocation for Virtualized Cognitive Radio Networks

  • Li, Qun;Xu, Ding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4748-4765
    • /
    • 2016
  • We consider a virtualized cognitive radio (CR) network, where multiple virtual network operators (VNOs) who own different virtual cognitive base stations (VCBSs) share the same physical CBS (PCBS) which is owned by an infrastructure provider (InP), sharing the spectrum with the primary user (PU). The uplink scenario is considered where the secondary users (SUs) transmit to the VCBSs. The PU is protected by constraining the interference power from the SUs. Such constraint is applied by the InP through pricing the interference. A Stackelberg game is formulated to jointly maximize the revenue of the InP and the individual utilities of the VNOs, and then the Stackelberg equilibrium is investigated. Specifically, the optimal interference price and channel allocation for the VNOs to maximize the revenue of the InP and the optimal power allocation for the SUs to maximize the individual utilities of the VNOs are derived. In addition, a low‐complexity ±‐optimal solution is also proposed for obtaining the interference price and channel allocation for the VNOs. Simulations are provided to verify the proposed strategies. It is shown that the proposed strategies are effective in resource allocation and the ±‐optimal strategy achieves practically the same performance as the optimal strategy can achieve. It is also shown that the InP will not benefit from a large interference power limit, and selecting VNOs with higher unit rate utility gain to share the resources of the InP is beneficial to both the InP and the VNOs.

A Possible Path per Link CBR Algorithm for Interference Avoidance in MPLS Networks

  • Sa-Ngiamsak, Wisitsak;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.772-776
    • /
    • 2004
  • This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

  • PDF

Design and Analysis of Lightweight Trust Mechanism for Accessing Data in MANETs

  • Kumar, Adarsh;Gopal, Krishna;Aggarwal, Alok
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.1119-1143
    • /
    • 2014
  • Lightweight trust mechanism with lightweight cryptographic primitives has emerged as an important mechanism in resource constraint wireless sensor based mobile devices. In this work, outlier detection in lightweight Mobile Ad-hoc NETworks (MANETs) is extended to create the space of reliable trust cycle with anomaly detection mechanism and minimum energy losses [1]. Further, system is tested against outliers through detection ratios and anomaly scores before incorporating virtual programmable nodes to increase the efficiency. Security in proposed system is verified through ProVerif automated toolkit and mathematical analysis shows that it is strong against bad mouthing and on-off attacks. Performance of proposed technique is analyzed over different MANET routing protocols with variations in number of nodes and it is observed that system provide good amount of throughput with maximum of 20% increase in delay on increase of maximum of 100 nodes. System is reflecting good amount of scalability, optimization of resources and security. Lightweight modeling and policy analysis with lightweight cryptographic primitives shows that the intruders can be detection in few milliseconds without any conflicts in access rights.

Combined Static and Dynamic Platform Calibration for an Aerial Multi-Camera System

  • Cui, Hong-Xia;Liu, Jia-Qi;Su, Guo-Zhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.6
    • /
    • pp.2689-2708
    • /
    • 2016
  • Multi-camera systems which integrate two or more low-cost digital cameras are adopted to reach higher ground coverage and improve the base-height ratio in low altitude remote sensing. To guarantee accurate multi-camera integration, the geometric relationship among cameras must be determined through platform calibration techniques. This paper proposed a combined two-step platform calibration method. In the first step, the static platform calibration was conducted based on the stable relative orientation constraint and convergent conditions among cameras in static environments. In the second step, a dynamic platform self-calibration approach was proposed based on not only tie points but also straight lines in order to correct the small change of the relative relationship among cameras during dynamic flight. Experiments based on the proposed two-step platform calibration method were carried out with terrestrial and aerial images from a multi-camera system combined with four consumer-grade digital cameras onboard an unmanned aerial vehicle. The experimental results have shown that the proposed platform calibration approach is able to compensate the varied relative relationship during flight, acquiring the mosaicing accuracy of virtual images smaller than 0.5pixel. The proposed approach can be extended for calibrating other low-cost multi-camera system without rigorously mechanical structure.

Station Collocation of Geostationary Spacecraft Via Direct Control of Relative Position (상대위치 직접 제어를 통한 정지궤도 위성의 Collocation에 관한 연구)

  • Lee, Jae-Gyu;No, Tae-Su
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.34 no.5
    • /
    • pp.56-64
    • /
    • 2006
  • Station collocation of closely placed multiple GEO spacecraft is required to avoid the problem of collision risk, attitude sensor interference and/or occultation. This paper presents the method of obtaining the orbit correction scheme for collocating two GEO spacecraft within a small station-keeping box. The relative motion of each spacecraft with respect to the virtual geostationary satellite is precisely expressed in terms of power and trigonometry functions. This closed-form orbit propagator is used to define the constraint conditions which meet the requirements for the station collocation. Finally, the technique of constrained optimization is used to find the orbit maneuver sequence. Nonlinear simulations are performed and their results are compared with those of the classical method.

Reduction of Simulation Number for Ship Handling Safety Assessment (선박운항 시뮬레이터 실험조건 축소화 연구)

  • Kwon, S.H.;Oh, H.S.
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.35 no.1
    • /
    • pp.101-106
    • /
    • 2012
  • Ship handling simulator is a virtual ship navigating system with three dimensional screen system and simulation programs. FTS simulation can produce theoretically infinite experiment tests without time constraint, but which results in collecting determinstic observations. RTS simulation can collect statistical observations but has disadvantage of spending at least 30 minutes for a single experiment. The previous studies suggested that the number of experiment conditions to be tested could be reduced to obtain random data with RTS simulation by focusing on highly difficult experiment condition for ship handling. It has the limitation of not estimating the distribution of ship handling difficulty for the route. In this paper, similarity and clustering analysis are suggested for reduction methodology of experiment conditions. Similarity of experiment conditions are measured as follows: euclidean distance of ship handling difficulty index and correlation matrix of distance differences from the designed route. Clustering analysis and multi-dimensional scaling are applied to classify experiment conditions with measured similarity into reducing the number of RTS simulation conditions. An empirical result on Dangin harbor is shown and discussed.

Guidance Law for Near Space Interceptor based on Block Backstepping Sliding Mode and Extended State Observer

  • Guo, Chao;Liang, Xiao-Geng
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.15 no.2
    • /
    • pp.163-172
    • /
    • 2014
  • This paper proposes a novel guidance law based on the block backstepping sliding mode control and extended state observer (ESO), which also takes into account the autopilot dynamic characteristics of the near space interceptor (NSI), and the impact angle constraint of attacking the maneuvering target. Based on the backstepping control approach, the target maneuvers and the parameter uncertainties of the autopilot are regarded as disturbances of the outer loop and inner loop, respectively. Then, the ESO is constructed to estimate the target acceleration and the inner loop disturbance, and the block backstepping sliding model guidance law is employed, based on the estimated disturbance value. Furthermore, in order to avoid the "explosion of complexity" problem, first-order low-pass filters are also introduced, to obtain differentiations of the virtual control variables. The stability of the closed-loop guidance system is also proven, based on the Lyapunov theory. Finally, simulation results demonstrate that the proposed guidance law can not only overcome the influence of the autopilot dynamic delay and target maneuvers, but also obtain a small miss distance.