• Title/Summary/Keyword: planning method

Search Result 5,227, Processing Time 0.037 seconds

Repetitive Periodic Motion Planning and Directional Drag Optimization of Underwater Articulated Robotic Arms

  • Jun Bong-Huan;Lee Jihong;Lee Pan-Mook
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.1
    • /
    • pp.42-52
    • /
    • 2006
  • In order to utilize hydrodynamic drag force on articulated robots moving in an underwater environment, an optimum motion planning procedure is proposed. The drag force acting on cylindrical underwater arms is modeled and a directional drag measure is defined as a quantitative measure of reaction force in a specific direction in a workspace. A repetitive trajectory planning method is formulated from the general point-to-point trajectory planning method. In order to globally optimize the parameters of repetitive trajectories under inequality constraints, a 2-level optimization scheme is proposed, which adopts the genetic algorithm (GA) as the 1st level optimization and sequential quadratic programming (SQP) as the 2nd level optimization. To verify the validity of the proposed method, optimization examples of periodic motion planning with the simple two-link planner robot are also presented in this paper.

Optimal Collision-Free Path Planning of Redundant Robotic Manipulators (여유 자유도를 갖는 Robot Manipulator 최적 충돌 회피 경로 계획에 관한 연구)

  • 장민근;기창두;기석호
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.11a
    • /
    • pp.743-747
    • /
    • 1996
  • A Potential Field Method is applied to the proposed algorithm for the planning of collision-free paths of redundant manipulators. The planning is carried out on the base of kinematic configuration. To make repulsive potentials, sources are distributed on the boundaries of obstacles. To escape from local minimum of the main potential and to attack other difficulties of the planning, various potentials are defined simultaneously, Inverse Kinematics Problems of the redundant manipulators are solved by unconstrained optimization method. Computer simulation result of the path planning is presented.

  • PDF

Integrated Planning Process Implementation Method Based on the Cost, Schedule, and Technical Performance (비용, 일정 및 기술적 성과를 고려한 통합 계획수립 프로세스 구현 방안)

  • You, Yi-Ju;Park, Young-Won
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.10 no.3
    • /
    • pp.100-108
    • /
    • 2007
  • The purpose of the research is to propose an integrated project planning process and its implementation method. Although there is increasing interest in the application of the Earned Value Management(EVM) method in the project management area, the progress and maturity of the technical performance have not been included in assessing the Earned Value. The main concept of the planning process is to use cost, schedule, as well as the technical performance in the assessment of the Earned Value Management for Military R&D project management practices. The resulting process can enhance the efficiency of the project work by eliminating the currently duplicated activities between traditional project planning process and the newly implemented Earned Value Management process and by shortening the early planning process duration of projects adopting EVM practices.

Integrated Generation and Transmission Expansion Planning Using Generalized Bender’s Decomposition Method

  • Kim, Hyoungtae;Lee, Sungwoo;Kim, Wook
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.6
    • /
    • pp.2228-2239
    • /
    • 2015
  • A novel integrated optimization method based on the Generalized Bender’s Decomposition (GBD) is proposed to combine both generation and transmission expansion problems. Most of existing researches on the integrated expansion planning based on the GBD theory incorporate DC power flow model to guarantee the convergence and improve the computation time. Inherently the GBD algorithm based on DC power flow model cannot consider variables and constraints related bus voltages and reactive power. In this paper, an integrated optimization method using the GBD algorithm based on a linearized AC power flow model is proposed to resolve aforementioned drawback. The proposed method has been successfully applied to Garver’s six-bus system and the IEEE 30-bus system which are frequently used power systems for transmission expansion planning studies.

Development of Potential Function Based Path Planning Algorithm for Mobile Robot

  • Lee, Sang-Il;Kim, Myun-Hee;Oh, Kwang-Seuk;Lee, Sang-Ryong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2325-2330
    • /
    • 2005
  • A potential field method for solving the problem of path planning based on global and local information for a mobile robot moving among a set of stationary obstacles is described. The concept of various method used path planning is used design a planning strategy. A real human living area is constructed by many moving and imminence obstacles. Home service mobile robot must avoid many obstacles instantly. A path that safe and attraction towards the goal is chosen. The potential function depends on distance from the goal and heuristic function relies on surrounding environments. Three additional combined methods are proposed to apply to human living area, calibration robots position by measured surrounding environment and adapted home service robots. In this work, we proposed the application of various path planning theory to real area, human living. First, we consider potential field method. Potential field method is attractive method, but that method has great problem called local minimum. So we proposed intermediate point in real area. Intermediate point was set in doorframe and between walls there is connect other room or other area. Intermediate point is very efficiency in computing path. That point is able to smaller area, area divided by intermediate point line. The important idea is intermediate point is permanent point until destruction house or apartment house. Second step is move robot with sensing on front of mobile robot. With sensing, mobile robot recognize obstacle and judge moving obstacle. If mobile robot is reach the intermediate point, robot sensing the surround of point. Mobile robot has data about intermediate point, so mobile robot is able to calibration robots position and direction. Third, we gave uncertainty to robot and obstacles. Because, mobile robot was motion and sensing ability is not enough to control. Robot and obstacle have uncertainty. So, mobile robot planed safe path planning to collision free. Finally, escape local minimum, that has possibility occur robot do not work. Local minimum problem solved by virtual obstacle method. Next is some supposition in real living area.

  • PDF

A Computer-Aided Inspection Planning System for On-Machine Measurement - Part II : Local Inspection Planning -

  • Cho, Myeong-Woo;Lee, Hong-Hee;Yoon, Gil-Sang;Choi, Jin-Hwa
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.8
    • /
    • pp.1358-1367
    • /
    • 2004
  • As a part II of theis research, new local inspection planning strategy is proposed in this paper based on the proposed inspection feature extraction method. In the local inspection planning stage, each feature is decomposed into its constituent geometric elements for more effective inspection planning. The local inspection planning for the decomposed features are performed to determine: (1) the suitable number of measuring points, (2) their locations, and (3) the optimum probing paths to minimize measuring errors and times. The fuzzy set theory, the Hammersley's algorithm and the TSP method are applied for the local inspection planning. Also, a new collision checking algorithm is proposed for the probe and/or probe holder based on the Z-map concept. Finally, the results are simulated and analyzed to verify the effectiveness of the proposed methods.

A method of minimum-time trajectory planning ensuring collision-free motion for two robot arms

  • Lee, Jihong;Bien, Zeungnam
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10b
    • /
    • pp.990-995
    • /
    • 1990
  • A minimum-time trajectory planning for two robot arms with designated paths and coordination is proposed. The problem considered in this paper is a subproblem of hierarchically decomposed trajectory planning approach for multiple robots : i) path planning, ii) coordination planning, iii) velocity planning. In coordination planning stage, coordination space, a specific form of configuration space, is constructed to determine collision region and collision-free region, and a collision-free coordination curve (CFCC) passing collision-free region is selected. In velocity planning stage, normal dynamic equations of the robots, described by joint angles, velocities and accelerations, are converted into simpler forms which are described by traveling distance along collision-free coordination curve. By utilizing maximum allowable torques and joint velocity limits, admissible range of velocity and acceleration along CFCC is derived, and a minimum-time velocity planning is calculated in phase plane. Also the planning algorithm itself is converted to simple numerical iterative calculation form based on the concept of neural optimization network, which gives a feasible approximate solution to this planning problem. To show the usefulness of proposed method, an example of trajectory planning for 2 SCARA type robots in common workspace is illustrated.

  • PDF

Treatment Planning Guideline of EBT Film-based Delivery Quality Assurance Using Statistical Process Control in Helical Tomotherapy (토모테라피에서 통계적공정관리를 이용한 EBT 필름 기반의 선량품질보증의 치료계획 가이드라인)

  • Chang, Kyung Hwan
    • Journal of radiological science and technology
    • /
    • v.45 no.5
    • /
    • pp.439-448
    • /
    • 2022
  • The purpose of this study was to analyze the results from statistical process control (SPC) to recommend upper and lower control limits for planning parameters based on delivery quality assurance (DQA) results and establish our institutional guidelines regarding planning parameters for helical tomotherapy (HT). A total of 53 brain, 41 head and neck (H & N), and 51 pelvis cases who had passing or failing DQA measurements were selected. The absolute point dose difference (DD) and the global gamma passing rate (GPR) for all patients were analyzed. Control charts were used to evaluate upper and lower control limits (UCL and LCL) for all assessed treatment planning parameters. Treatment planning parameters were analyzed to provide its range for DQA pass cases. We confirmed that the probability of DQA failure was higher when the proportion of leaf open time (LOT) below 100 ms was greater than 30%. LOT and gantry period (GP) were significant predictor for DQA failure using the SPC method. We investigated the availability of the SPC statistic method to establish the local planning guideline based on DQA results for HT system. The guideline of each planning parameter in HT may assist in the prediction of DQA failure using the SPC statistic method in the future.

A Study on Transmission System Expansion Planning using Fuzzy Branch and Bound Method

  • Park, Jaeseok;Sungrok Kang;Kim, Hongsik;Seungpil Moon;Lee, Soonyoung;Roy Billinton
    • KIEE International Transactions on Power Engineering
    • /
    • v.2A no.3
    • /
    • pp.121-128
    • /
    • 2002
  • This study proposes a new method for transmission system expansion planning using fuzzy integer programming. It presents stepwise cost characteristics analysis which is a practical condition of an actual system. A branch and bound method which includes the network flow method and the maximum flow - minimum cut set theorem has been used in order to carry out the stepwise cost characteristics analysis. Uncertainties of the permissibility of the construction cost and the lenient reserve rate and load forecasting of expansion planning have been included and also processed using the fuzzy set theory in this study. In order to carry out the latter analysis, the solving procedure is illustrated in detail by the branch and bound method which includes the network flow method and maximum flow-minimum cut set theorem. Finally, case studies on the 21- bus test system show that the algorithm proposed is efficiently applicable to the practical expansion planning of transmission systems in the future.

High-Speed Path Planning of a Mobile Robot Using Gradient Method with Topological Information (위상정보를 갖는 구배법에 기반한 이동로봇의 고속 경로계획)

  • Ham Jong-Gyu;Chung Woo-Jin;Song Jae-Bok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.5
    • /
    • pp.444-449
    • /
    • 2006
  • Path planning is a key element in navigation of a mobile robot. Several algorithms such as a gradient method have been successfully implemented so for. Although the gradient method can provide the global optimal path, it computes the navigation function over the whole environment at all times, which result in high computational cost. This paper proposes a high-speed path planning scheme, called a gradient method with topological information, in which the search space for computation of a navigation function can be remarkably reduced by exploiting the characteristics of the topological information reflecting the topology of the navigation path. The computing time of the gradient method with topological information can therefore be significantly decreased without losing the global optimality. This reduced path update period allows the mobile robot to find a collision-free path even in the dynamic environment.