• 제목/요약/키워드: Joint algorithm

검색결과 896건 처리시간 0.034초

Global Minimum-Jerk Trajectory Planning of Space Manipulator

  • Huang Panfeng;Xu Yangsheng;Liang Bin
    • International Journal of Control, Automation, and Systems
    • /
    • 제4권4호
    • /
    • pp.405-413
    • /
    • 2006
  • A novel approach based on genetic algorithms (GA) is developed to find a global minimum-jerk trajectory of a space robotic manipulator in joint space. The jerk, the third derivative of position of desired joint trajectory, adversely affects the efficiency of the control algorithms and stabilization of whole space robot system and therefore should be minimized. On the other hand, the importance of minimizing the jerk is to reduce the vibrations of manipulator. In this formulation, a global genetic-approach determines the trajectory by minimizing the maximum jerk in joint space. The planning procedure is performed with respect to all constraints, such as joint angle constraints, joint velocity constraints, joint angular acceleration and torque constraints, and so on. We use an genetic algorithm to search the optimal joint inter-knot parameters in order to realize the minimum jerk. These joint inter-knot parameters mainly include joint angle and joint angular velocities. The simulation result shows that GA-based minimum-jerk trajectory planning method has satisfactory performance and real significance in engineering.

Fairness-insured Aggressive Sub-channel Allocation and Efficient Power Allocation Algorithms to Optimize the Capacity of an IEEE 802.16e OFDMA/TDD Cellular System

  • Ko, Sang-Jun;Chang, Kyung-Hi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제3권4호
    • /
    • pp.385-398
    • /
    • 2009
  • This paper aims to find a suitable solution to joint allocation of sub-channel and transmit power for multiple users in an IEEE 802.16e OFDMA/TDD cellular system. We propose the FASA (Fairness insured Aggressive Sub-channel Allocation) algorithm, which is a dynamic channel allocation algorithm that considers all of the users' channel state information conditionally in order to maximize throughput while taking into account fairness. A dynamic power allocation algorithm, i.e., an improved CHC algorithm, is also proposed in combination with the FASA algorithm. It collects the extra downlink transmit power and re-allocates it to other potential users. Simulation results show that the joint allocation scheme with the improved CHC power allocation algorithm provides an additional increase of sector throughput while simultaneously enhancing fairness. Four frames of time delay for CQI feedback and scheduling are considered. Furthermore, by addressing the difference between uplink and downlink scheduling in an IEEE 802.16e OFDMA TDD system, we can employ the uplink channel information directly via channel sounding, resulting in more accurate uplink dynamic resource allocation.

Majorization-Minimization-Based Sparse Signal Recovery Method Using Prior Support and Amplitude Information for the Estimation of Time-varying Sparse Channels

  • Wang, Chen;Fang, Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권10호
    • /
    • pp.4835-4855
    • /
    • 2018
  • In this paper, we study the sparse signal recovery that uses information of both support and amplitude of the sparse signal. A convergent iterative algorithm for sparse signal recovery is developed using Majorization-Minimization-based Non-convex Optimization (MM-NcO). Furthermore, it is shown that, typically, the sparse signals that are recovered using the proposed iterative algorithm are not globally optimal and the performance of the iterative algorithm depends on the initial point. Therefore, a modified MM-NcO-based iterative algorithm is developed that uses prior information of both support and amplitude of the sparse signal to enhance recovery performance. Finally, the modified MM-NcO-based iterative algorithm is used to estimate the time-varying sparse wireless channels with temporal correlation. The numerical results show that the new algorithm performs better than related algorithms.

일반화 격자구조의 적응 Joint-Process IIR 필터의 구현 (Implementation of Adaptive Joint-process IIR Filter with Generalized Lattice Structure)

  • 오현철;김윤상;김재일;심재선;안두수
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 하계학술대회 논문집 B
    • /
    • pp.629-631
    • /
    • 1998
  • An adaptive joint-process IIR filter with generalized lattice structure is implemented by modifying the conventional lattice filter and making an adaptive algorithm in a system identification problem.

  • PDF

근골격계 부하 평가를 위한 2차원 자세 측정 시스템 개발 (Development of a 2D Posture Measurement System to Evaluate Musculoskeletal Workload)

  • 박성준;박재규;최재호
    • 대한인간공학회지
    • /
    • 제24권3호
    • /
    • pp.43-52
    • /
    • 2005
  • A two-dimensional posture measurement system was developed to evaluate the risks of work-related musculoskeletal disorders(MSDs) easily on various conditions of work. The posture measurement system is an essential tool to analyze the workload for preventing work-related musculoskeletal disorders. Although several posture measurement systems have been developed for workload assessment, some restrictions in industry still exist because of its difficulty on measuring work postures. In this study, an image recognition algorithm was developed based on a neural network method to measure work posture. Each joint angle of human body was automatically measured from the recognized images through the algorithm, and the measurement system makes it possible to evaluate the risks of work-related musculoskeletal disorders easily on various working conditions. The validation test on upper body postures was carried out to examine the accuracy of the measured joint angle data from the system, and the results showed good measuring performance for each joint angle. The differences between the joint angles measured directly and the angles measured by posture measurement software were not statistically significant. It is expected that the result help to properly estimate physical workload and can be used as a postural analysis system to evaluate the risk of work-related musculoskeletal disorders in industry.

Cooperative Contour Control of Two Robots under Speed and Joint Acceleration Constraints

  • Jayawardene, T.S.S.;Nakamura, Masatoshi;Goto, Satoru;Kyura, Nobuhiro
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.1387-1391
    • /
    • 2003
  • The fundamental aim of this paper is to present a solution algorithm to achieve cooperative contour controlling, under joint acceleration constraint with maximum cooperative speed. Usually, the specifications like maximum velocity of cooperative trajectory are determined by the application itself. In resolving the cooperative trajectory into two complementary trajectories, an optimum task resolving strategy is employed so that the task assignment for each robot is fair under the joint acceleration constraint. The proposed algorithm of being an off-line technique, this could be effectively and conveniently extended to the existing servo control systems irrespective of the computational power of the controller implemented. Further, neither a change in hardware setup nor considerable reconfiguration of the existing system is required in adopting this technique. A simulation study has been carried out to verify that the proposed method can be realized in the generation of complementary trajectories so that they could meet the stipulated constraints in simultaneous maneuvering.

  • PDF

기구학적 시스템에 있어서 구동방법에 따른 역동역학 해석 (Inverse Dynamic Analysis for Various Drivings in Kinematic Systems)

  • 이병훈
    • 대한기계학회논문집A
    • /
    • 제41권9호
    • /
    • pp.869-876
    • /
    • 2017
  • 기계시스템을 제어한다든지 그 부재를 설계하기 위하여 그리고 구동기의 용량을 결정하는데 있어서 구동력이나 조인트반력을 해석하는 것이 필요하다. 본 논문은 주어진 시스템의 운동을 구현하는 다양한 형태의 구동조건에 따른 구동력(또는 토크)을 조인트좌표 공간에서 계산하는 알고리즘을 제시한다. 조인트좌표를 기구학적 시스템의 일반좌표로 사용하며 운동방정식과 구속조건의 가속도식은 속도변환법을 이용하여 직교좌표공간으로부터 조인트좌표공간으로 변환한다. 수치예제를 통하여 제시된 알고리즘의 유용성을 확인한다.

작업 전이 알고리즘 기반 로봇 동작 제한 극복 프레임워크 (A Unified Framework for Overcoming Motion Constraints of Robots Using Task Transition Algorithm)

  • 장근우;김상현;박수한;박재흥
    • 로봇학회논문지
    • /
    • 제13권2호
    • /
    • pp.129-141
    • /
    • 2018
  • This paper proposes a unified framework that overcomes four motion constraints including joint limit, kinematic singularity, algorithmic singularity and obstacles. The proposed framework is based on our previous works which can insert or remove tasks continuously using activation parameters and be applied to avoid joint limit and singularity. Additionally, we develop a method for avoiding obstacles and combine it into the framework to consider four motion constraints simultaneously. The performance of the proposed framework was demonstrated by simulation tests with considering four motion constraints. Results of the simulations verified the framework's effectiveness near joint limit, kinematic singularity, algorithmic singularity and obstacles. We also analyzed sensitivity of our algorithm near singularity when using closed loop inverse kinematics depending on magnitude of gain matrix.

A vision-based system for inspection of expansion joints in concrete pavement

  • Jung Hee Lee ;bragimov Eldor ;Heungbae Gil ;Jong-Jae Lee
    • Smart Structures and Systems
    • /
    • 제32권5호
    • /
    • pp.309-318
    • /
    • 2023
  • The appropriate maintenance of highway roads is critical for the safe operation of road networks and conserves maintenance costs. Multiple methods have been developed to investigate the surface of roads for various types of cracks and potholes, among other damage. Like road surface damage, the condition of expansion joints in concrete pavement is important to avoid unexpected hazardous situations. Thus, in this study, a new system is proposed for autonomous expansion joint monitoring using a vision-based system. The system consists of the following three key parts: (1) a camera-mounted vehicle, (2) indication marks on the expansion joints, and (3) a deep learning-based automatic evaluation algorithm. With paired marks indicating the expansion joints in a concrete pavement, they can be automatically detected. An inspection vehicle is equipped with an action camera that acquires images of the expansion joints in the road. You Only Look Once (YOLO) automatically detects the expansion joints with indication marks, which has a performance accuracy of 95%. The width of the detected expansion joint is calculated using an image processing algorithm. Based on the calculated width, the expansion joint is classified into the following two types: normal and dangerous. The obtained results demonstrate that the proposed system is very efficient in terms of speed and accuracy.

Many-objective joint optimization for dependency-aware task offloading and service caching in mobile edge computing

  • Xiangyu Shi;Zhixia Zhang;Zhihua Cui;Xingjuan Cai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제18권5호
    • /
    • pp.1238-1259
    • /
    • 2024
  • Previous studies on joint optimization of computation offloading and service caching policies in Mobile Edge Computing (MEC) have often neglected the impact of dependency-aware subtasks, edge server resource constraints, and multiple users on policy formulation. To remedy this deficiency, this paper proposes a many-objective joint optimization dependency-aware task offloading and service caching model (MaJDTOSC). MaJDTOSC considers the impact of dependencies between subtasks on the joint optimization problem of task offloading and service caching in multi-user, resource-constrained MEC scenarios, and takes the task completion time, energy consumption, subtask hit rate, load variability, and storage resource utilization as optimization objectives. Meanwhile, in order to better solve MaJDTOSC, a many-objective evolutionary algorithm TSMSNSGAIII based on a three-stage mating selection strategy is proposed. Simulation results show that TSMSNSGAIII exhibits an excellent and stable performance in solving MaJDTOSC with different number of users setting and can converge faster. Therefore, it is believed that TSMSNSGAIII can provide appropriate sub-task offloading and service caching strategies in multi-user and resource-constrained MEC scenarios, which can greatly improve the system offloading efficiency and enhance the user experience.