• 대한기계학회논문집A
• /
• 제21권12호
• /
• pp.2121-2133
• /
• 1997

A finite element code is developed for 3-D self-contact problems, using continuum elements with a SRI(Selective Reduced Integration) scheme to prevent locking phenomenon by the incompressibility of rubber. Contact treatment is carried out in two ways : using the displacement constraints in case of rigid contact ; and imposing the same contact forces on two contact boundaries in case of self-contact. The finite element code developed is applied to the deformation analysis of C.V.joint boots which maintain lubrication conditions and protect the C.V.joint assembly from impact and dust. The boot accompanies large rotation depending on the rotation of the wheel axis and leading to the self-contact phenomena of the boot bellows. Since this contact phenomenon causes wear of the product and has great influence on the endurance life of the product, it is indispensable to carry out stress analysis of the rubber boots. In case of self-contact, various methods for determining contact forces have been suggested with an appropriate contact formulation. Especially, the types of penetration in self-contact are modularized to accelerate conputation with a contact algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권7호
• /
• pp.3134-3155
• /
• 2020

In this paper, we study the joint radio and computational resource allocation in the ultra-dense mobile-edge computing networks. In which, the scenario which including both computation offloading and communication service is discussed. That is, some mobile users ask for computation offloading, while the others ask for communication with the minimum communication rate requirements. We formulate the problem as a joint channel assignment, power control and computational resource allocation to minimize the offloading cost of computing offloading, with the precondition that the transmission rate of communication nodes are satisfied. Since the formulated problem is a mixed-integer nonlinear programming (MINLP), which is NP-hard. By leveraging the particular mathematical structure of the problem, i.e., the computational resource allocation variable is independent with other variables in the objective function and constraints, and then the original problem is decomposed into a computational resource allocation subproblem and a joint channel assignment and power allocation subproblem. Since the former is a convex programming, the KKT (Karush-Kuhn-Tucker) conditions can be used to find the closed optimal solution. For the latter, which is still NP-hard, is further decomposed into two subproblems, i.e., the power allocation and the channel assignment, to optimize alternatively. Finally, two heuristic algorithms are proposed, i.e., the Co-channel Equal Power allocation algorithm (CEP) and the Enhanced CEP (ECEP) algorithm to obtain the suboptimal solutions. Numerical results are presented at last to verify the performance of the proposed algorithms.

• 디지털산업정보학회논문지
• /
• 제18권4호
• /
• pp.97-110
• /
• 2022

The purpose of this study is to analyze the level of public data convergence capabilities of administrative organizations and to explore important variables in data-based organizational capabilities. The theoretical background was summarized on public data and use activation, joint use, convergence, administrative organization, and convergence constraints. These contents were explained Public Data Act, the Electronic Government Act, and the Data-Based Administrative Act. The research model was set as the data-based organizational capabilities effect by a data-based administrative capability, public data operation capabilities, and public data operation constraints. It was also set whether there is a capabilities difference data-based on an organizational operation by the level of data convergence capabilities. This study analysis was conducted with hierarchical cluster analysis and multiple regression analysis. As the research result, First, hierarchical cluster analysis was classified into three groups. It was classified into a group that uses only public data and structured data, a group that uses public data on both structured and unstructured data, and a group that uses both public and private data. Second, the critical variables of data-based organizational operation capabilities were found in the data-based administrative planning and administrative technology, the supervisory organizations and technical systems by public data convergence, and the data sharing and market transaction constraints. Finally, the essential independent variables on data-based organizational competencies differ by group. This study contributed. As a theoretical implication, this research is updated on management information systems by explaining the Public Data Act, the Electronic Government Act, and the Data-Based Administrative Act. As a practical implication, the activity reinforcement of public data should be promoting the establishment of data standardization and search convenience and elimination of the lukewarm attitudes and Selfishness behavior for data sharing.

• ETRI Journal
• /
• 제34권6호
• /
• pp.892-899
• /
• 2012

We analyze a wideband spectrum in a cognitive radio (CR) network by employing the optimal adaptive multiband sensing-time joint detection framework. This framework detects a wideband M-ary quadrature amplitude modulation (M-QAM) primary signal over multiple nonoverlapping narrowband Gaussian channels, using the energy detection technique so as to maximize the throughput in CR networks while limiting interference with the primary network. The signal detection problem is formulated as an optimization problem to maximize the aggregate achievable secondary throughput capacity by jointly optimizing the sensing duration and individual detection thresholds under the overall interference imposed on the primary network. It is shown that the detection problems can be solved as convex optimization problems if certain practical constraints are applied. Simulation results show that the framework under consideration achieves much better performance for M-QAM than for binary phase-shift keying or any real modulation scheme.

• 제어로봇시스템학회논문지
• /
• 제17권7호
• /
• pp.685-696
• /
• 2011

An efficient laparoscope manipulator robot was designed to automatically control the position of laparoscope via a passive joint on end-effector position. The end position of the manipulator is controlled to have corresponding velocity defined in the global coordinate space using laparoscopic visual information. Desired spatial position of laparoscope was derived from detected positions of surgical instrument tips, then the clinical viewing plane was moved by visual servoing task. The laparoscope manipulator is advantageous for automatically maintaining clinically important views in the laparoscopic image without any additional operator. A laparoscope is mounted to a holder which is linked to four degree of freedom manipulator via universal joint-type passive rings connection. No change in the design of laparoscope or manipulator is necessary for its application to surgery assistant robot system. Expanded working space and surgical efficiency were accomplished by implementing slant linking structure between laparoscope and manipulator. To ensure reliable positioning accuracy and controllability, the motion of laparoscope in an abdominal space through trocar was inspected using geometrical analysis. A designed laparoscope manipulating robot system can be easily set up and controlled in an operation room since it has a few subsidiary devices such as a laparoscope light source regulator, a control PC, and a power supply.

• 대한기계학회논문집
• /
• 제19권4호
• /
• pp.1023-1032
• /
• 1995

The multiple cooperating robot system plays an important role in the research of modern manufacturing system as the emphasis of production automation is more on the side of flexibility than before. While the kinematic and dynamic analysis of a single robot is performed as an open-loop chain, the dynamic formulation of robot in a multiple cooperating robot system differs from that of a single robot when the multiple cooperating robots form a closed kinematic chain holding an object simultaneously. The object may be any type from a rigid body to a multi-joint linkage. The mobility of the system depends on the kinematic configuration of the closed kinematic chain formed by robots and object, which also decides the number of independent input parameters. Since the mobility is not the same as the number of robot joints, proper constraint condition is sought. The constraints may be such that : the number of active robot joints is kept the same as mobility, all robot joints are active and have interrelations between each joint forces/torques, two robots have master-slave relation, or so on. The dynamic formulation of system is obtained. The formulation is based on recursive dual-number screw-calculus Newton-Eulerian approach which has been used for single robot analysis. This new scheme is recursive and compact symbolically and may facilitate the consideration of the object in real time.

• 한국정밀공학회지
• /
• 제16권12호
• /
• pp.204-213
• /
• 1999

This paper suggests a numerical method of finding optimal geometric path and minimum-time motion for a manipulator arm. To find the minimum-time motion, the optimal geometric path is searched first, and the minimum-time motion is searched on this optimal path. In the algorithm finding optimal geometric path, the objective function is minimizing the combination of joint velocities, joint-jerks, and actuator forces as well as avoiding several static obstacles, where global search is performed by adjusting the seed points of the obstacle models. In the minimum-time algorithm, the traveling time is expressed by the linear combinations of finite-term quintic B-splines and the coefficients of the splines are obtained by nonlinear programming to minimize the total traveling time subject to the constraints of the velocity-dependent actuator forces. These two search algorithms are basically similar and their convergences are quite stable.

• 대한기계학회논문집A
• /
• 제33권10호
• /
• pp.1014-1022
• /
• 2009

A biped robot in locomotion can be regarded to be kinetically redundant in that the link-chain from its foot on the ground to its swing foot has more degrees of freedom that needed to realize stable bipedal locomotion. This paper proposes a new method to generate a trajectory for bipedal locomotion based on this redundancy, which directly generates a locomotion trajectory at the joint level unlike some other methods such as LIPM (linear inverted-pendulum mode) and GCIPM (gravity-compensated inverted-pendulum mode), each of which generates a trajectory of the center of gravity or the hip link under the assumption of the dominance of the hip-link inertia before generating the trajectory of the whole links at the joint level. For the stability of the trajectory generated in the proposed method, a stability condition based on the ZMP (zero-moment point) is used as a constraint as well as other kinetic constraints for bipedal motions. A 6-DOF biped robot is used to show how a stable locomotion trajectory can be generated in the sagittal plane by the proposed method and to demonstrate the feasibility of the proposed method.

• 한국정밀공학회지
• /
• 제14권7호
• /
• pp.144-153
• /
• 1997

The inverse kinematics problem of a reclaimer which excavates and transports raw materials in a raw yard is investigated. Because of the geometric feature of the equipment in which scooping buckets are attached around the rotating disk, kinematic redundancy occurs in determining joint variable. Link coordinates are introduced following the Denavit-Hartenbery representation. For a given excavation point the forward kinematics yields 3 equations, however the number of involved joint variables in the equations is four. It is shown that the rotating disk at the end of the boom provides an extra passive degree of freedom. Two approaches are investigated in obtaining inverse kinematics solutions. The first method pre-assigns the height of excavation point which can be determined through path planning. A closed form solution is obtained for the first approach. The second method exploits the orthogonality between the normal vector at the excavation point and the z axis of the end-effector coordinate system. The geometry near the reclaiming point has been approximated as a plane, and the plane equation has been obtained by the least square method considering 8 adjacent points near the point. A closed form solution is not found for the second approach, however a linear approximate solution is provided.

• Journal of Communications and Networks
• /
• 제13권4호
• /
• pp.360-366
• /
• 2011

In this paper, we investigate the problem of power allocation in a heterogeneous network that is composed of a pair of cognitive users (CUs) and an infrastructure-based primary network. Since CUs have only limited effective spectrum-sensing ability and primary users (PUs) are not active all the time in all locations and licensed bands, we set up a new multi-area model to characterize the heterogeneous network. A novel combined interference-avoidance policy corresponding to different PU-appearance situations is introduced to protect the primary network from unacceptable disturbance and to increase the spectrum secondary-reuse efficiency. We use dual decomposition to transform the original power allocation problem into a two-layer optimization problem. We propose a low-complexity joint power-optimizing method to maximize the transmission rate between CUs, taking into account both the individual power-transmission constraints and the combined interference power constraint of the PUs. Numerical results show that for various values of the system parameters, the proposed joint optimization method with combined PU protection is significantly better than the opportunistic spectrum access mode and other heuristic approaches.