• 제목/요약/키워드: Optimal Planning

검색결과 1,274건 처리시간 0.027초

이동로봇을 위한 실시간 하이브리드 경로계획 알고리즘 (Real-time Hybrid Path Planning Algorithm for Mobile Robot)

  • 이동훈;김동식;이종호;김동원
    • 전기학회논문지
    • /
    • 제63권1호
    • /
    • pp.115-122
    • /
    • 2014
  • Mobile robot has been studied for long time due to its simple structure and easy modeling. Regarding path planning of the mobile robot, we suggest real-time hybrid path planning algorithm which is the combination of optimal path planning and real-time path planning in this paper. Real-time hybrid path planning algorithm modifies, finds best route, and saves calculating time. It firstly plan the route with real-time path planning then robot starts to move according to the planned route. While robot is moving, update the route as the best outcome which found by optimal path planning algorithm. Verifying the performance of the proposed method through the comparing real-time hybrid path planning with optimal path planning will be done.

A Study on Optimal Reliability Criterion Determination for Transmission System Expansion Planning

  • Tran Trungtinh;Choi Jae-Seok;Jeon Dong-Hoon;Chu Jin-Boo;Thomas Robert;Billinton Roy
    • KIEE International Transactions on Power Engineering
    • /
    • 제5A권1호
    • /
    • pp.62-69
    • /
    • 2005
  • The optimal design of transmission system expansion planning is an important part of the overall planning task of electric power system under competitive electricity market environments. One of main keys of the successful grid expansion planning comes from optimal reliability level/criteria decision, which should be given for constraint in the optimal expansion problem. However, it's very difficult to decide logically the optimal reliability criteria of a transmission system as well as generation system expansion planning in a society. This paper approaches a methodology for deciding the optimal reliability criteria for an optimal transmission system expansion planning. A deterministic reliability criteria, BRR (Bus Reserve Rate) is used in this study. The optimal reliability criteria, BRR/sup */, is decided at minimum cost point of total cost curve which is the sum of the utility cost associated with construction cost and the customer outage cost associated with supply interruptions for load considering bus reserve rate at load buses in long term forecasting. The characteristics and effectiveness of this methodology are illustrated by the case study using IEEE-RTS.

OPF를 이용한 중장기 전력계통 조상설비 계획수립 (Long-term Shunt VAr Planning using Optimal Power Flour)

  • 유헌수;배주천
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 제36회 하계학술대회 논문집 A
    • /
    • pp.301-303
    • /
    • 2005
  • This paper presents long-term shunt capacitor planning using optimal power flow. OPF allows the planning engineer to find feasible solution with minimal amount of engineering time. We used OPF for Shunt capacitor planning to get an optimal solution. The result of OPF is compared to the analysis by the conventional loadflow method and it is proved that OPF gives more cheaper and better planning solution. With the result, we analyzed the operational perspective for the reactive power supply and demand.

  • PDF

A Study on Optimal Planning Strategy Based on Customer Outage Costs

  • Kim, Bal-Ho H.
    • Journal of Electrical Engineering and Technology
    • /
    • 제5권1호
    • /
    • pp.21-27
    • /
    • 2010
  • This paper examines the long-run social welfare maximization problems facing public utilities, which includes consideration of the cost of capital or other fixed costs of production, from which it derives optimal investment decisions in a reliability differentiated pricing based market. Reliability differentiated pricing policies lead to straightforward mathematical results on optimal investment decisions in generation and transmission expansion planning. This paper presents the mathematical conditions for optimal investment decisions.

최적 계획생성을 위한 동작비용 기반의 휴리스틱 (Action Costs-based Heuristics for Optimal Planning)

  • 김완태;김현식
    • 디지털산업정보학회논문지
    • /
    • 제13권2호
    • /
    • pp.27-34
    • /
    • 2017
  • Highly informative admissible heuristics can help to conduct more efficient search for optimal solutions. However, in general, more informative ones of heuristics from planning problems requires lots of computational effort. To address this problem, we propose an Delete Relaxation based Action Costs-based Planning Graph(ACPG) and Action Costs-based Heuristics for solving optimal planning problems more efficiently. The ACPG is an extended one to be applied to can find action costs between subgoal & goal conditions from the Relaxed Planning Graph(RPG) which is a common means to get heuristics for solving the planning problems, Action Costs-based Heuristics utilizing ACPG can find action costs difference between subgoal & goal conditions in an effective way, and then consider them to estimate the goal distance. In this paper, we present the heuristics algorithm to compute Action Costs-based Heuristics, and then explain experimental analysis to investigate the efficiency and the accuracy of the Action Costs-based Heuristics.

OPTIMAL FORMATION TRAJECTORY-PLANNING USING PARAMETER OPTIMIZATION TECHNIQUE

  • Lim, Hyung-Chul;Bang, Hyo-Choong;Park, Kwan-Dong;Lee, Woo-Kyoung
    • Journal of Astronomy and Space Sciences
    • /
    • 제21권3호
    • /
    • pp.209-220
    • /
    • 2004
  • Some methods have been presented to get optimal formation trajectories in the step of configuration or reconfiguration, which subject to constraints of collision avoidance and final configuration. In this study, a method for optimal formation trajectory-planning is introduced in view of fuel/time minimization using parameter optimization technique which has not been applied to optimal trajectory-planning for satellite formation flying. New constraints of nonlinear equality are derived for final configuration and constraints of nonlinear inequality are used for collision avoidance. The final configuration constraints are that three or more satellites should be placed in an equilateral polygon of the circular horizontal plane orbit. Several examples are given to get optimal trajectories based on the parameter optimization problem which subjects to constraints of collision avoidance and final configuration. They show that the introduced method for trajectory-planning is well suited to trajectory design problems of formation flying missions.

가중치를 갖는 복합 파지 지수를 기반으로 한 물체의 파지 계획 (Optimal Grasp Planning of Object Based on Weighted Composite Grasp Index)

  • 김병호;이병주;오상록;서일홍
    • 제어로봇시스템학회논문지
    • /
    • 제6권11호
    • /
    • pp.1003-1012
    • /
    • 2000
  • When a robot hand grasp an object, the number of ways to grasp it stably are infinite and thus an optimal grasp planning is needed to find the optimal grasp points for satisfying the objective of the given task. In this paper, we first define some grasp indices to evaluate the quality of each feasible grasp and then a weighted composite grasp index by combining all of the grasp indices is also defined. Next, we propose a method to find the optimal grasp points of the given object by comparing the defined weighted composite grasp index for each feasible grasp points. By simulation results, we show the effectiveness of the proposed optimal grasp planning method and also discuss the trend of each grasp index as the grasp polygon.

  • PDF

유전 알고리즘을 이용한 선박의 최적 항로 결정에 관한 연구 (A Study on the Optimal Trajectory Planning for a Ship Using Genetic algorithm)

  • 이병결;김종화;김대영;김태훈
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.255-255
    • /
    • 2000
  • Technical advance of electrical chart and cruising equipment make it possible to sail without a man. It is important to decide the cruising route in view of effectiveness and stability of a ship. So we need to study on the optimal trajectory planning. Genetic algorithm is a strong optimization algorithm with adaptational random search. It is a good choice to apply genetic algorithm to the trajectory planning of a ship. We modify a genetic algorithm to solve this problem. The effectiveness of the revised genetic algorithm is assured through computer simulations.

  • PDF

최적 제어 이론을 사용한 비행 경로 선정 (Determination of flight route using optimal control theory)

  • 김을곤
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
    • /
    • pp.407-411
    • /
    • 1992
  • A method for optimal route planning is presented with the assumption that the overall defended area is known in terms of threat potential function. This approach employes tangent plane to reduce the dimension of the state space for optimal programming problems with a state equality constraint. One-dimensional search algorithm is used to select the optimal route among the extermal fields which are obtained by integrating three differential equations from the initial values. In addition to being useful for the route planning through threat potential area, the trajectory planning will be suitable for general two-dimensional searching problems.

  • PDF

Optimal Route Planning for Maritime Autonomous Surface Ships Using a Nonlinear Model Predictive Control

  • Daejeong Kim;Zhang Ming;Jeongbin Yim
    • 한국항해항만학회지
    • /
    • 제47권2호
    • /
    • pp.66-74
    • /
    • 2023
  • With the increase of interest in developing Maritime Autonomous Surface Ships (MASS), an optimal ship route planning is gradually gaining popularity as one of the important subsystems for autonomy of modern marine vessels. In the present paper, an optimal ship route planning model for MASS is proposed using a nonlinear MPC approach together with a nonlinear MMG model. Results drawn from this study demonstrated that the optimization problem for the ship route was successfully solved with satisfaction of the nonlinear dynamics of the ship and all constraints for the state and manipulated variables using the nonlinear MPC approach. Given that a route generation system capable of accounting for nonlinear dynamics of the ship and equality/inequality constraints is essential for achieving fully autonomous navigation at sea, it is expected that this paper will contribute to the field of autonomous vehicles by demonstrating the performance of the proposed optimal ship route planning model.