• 제목/요약/키워드: Path optimization

검색결과 639건 처리시간 0.039초

Path Planning Algorithm Using the Particle Swarm Optimization and the Improved Dijkstra Algorithm

  • Kang, Hwan-Il;Lee, Byung-Hee;Jang, Woo-Seok
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국지능시스템학회 2007년도 추계학술대회 학술발표 논문집
    • /
    • pp.176-179
    • /
    • 2007
  • In this paper, we develop the path planning algorithm using the improved Dijkstra algorithm and the particle swarm optimization. To get the optimal path, at first we construct the MAKLINK on the world environment and then make a graph associated with the MAKLINK. From the graph, we obtain the Dijkstra path between the starting point and the destination point. From the optimal path, we search the improved Dijkstra path using the graph. Finally, applying the particle swarm optimization to the improved Dijkstra path, we obtain the optimal path for the mobile robot. It turns out that the proposed method has better performance than the result in [1].

  • PDF

ACO와 PSO 기법을 이용한 이동로봇 최적화 경로 생성 알고리즘 개발 (DEVELOPMENT OF A NEW PATH PLANNING ALGORITHM FOR MOBILE ROBOTS USING THE ANT COLONY OPTIMIZATION AND PARTICLE SWARM OPTIMIZATION METHOD)

  • 이준오;고종훈;김대원
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2008년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.77-78
    • /
    • 2008
  • This paper proposes a new algorithm for path planning and obstacles avoidance using the ant colony optimization algorithm and the particle swarm optimization. The proposed algorithm is a new hybrid algorithm that composes of the ant colony algorithm method and the particle swarm optimization method. At first, we produce paths of a mobile robot in the static environment. And then, we find midpoints of each path using the Maklink graph. Finally, the hybrid algorithm is adopted to get a shortest path. We prove the performance of the proposed algorithm is better than that of the path planning algorithm using the ant colony optimization only through simulation.

  • PDF

조합논리회로를 위한 새로운 Path-Based 타이밍 최적화 알고리듬 (Path-based new Timing Optimization Algorithm for Combinational Networks)

  • 양세양;홍봉희
    • 전자공학회논문지A
    • /
    • 제29A권9호
    • /
    • pp.85-93
    • /
    • 1992
  • In this paper, the new timing optimization algorithm for combinational networks is proposed. First, we introduce the concept of P-path redundancy which is the extension of redundancy concept used in the testing of combinational networks. In this approach, the critical delay is minimized by removing the P-path redundant side inputs of the critical path, and more accurate timing optimization is possible by systematically considering the statically unsensitizable paths as well as the statically sensitizable paths. It's possible with all previous longest path based approaches that the critical delay of resulting network after timing optimization may be even increased. However, the proposed method guarantees to exclude such a possibility, and can be applied to optimize the timing of combinational networks in technology independent, and dependent phase.

  • PDF

입자 군집 최적화와 개선된 Dijkstra 알고리즘을 이용한 경로 계획 기법 (Path Planning Method Using the the Particle Swarm Optimization and the Improved Dijkstra Algorithm)

  • 강환일;이병희;장우석
    • 한국지능시스템학회논문지
    • /
    • 제18권2호
    • /
    • pp.212-215
    • /
    • 2008
  • 본 논문에서 개선된 Dijkstra 알고리즘과 입자 군집 최적화를 이용한 최적 경로 계획 알고리즘을 제안한다. 최적의 경로를 구하기 위해 우선 이동 로봇 공간에서 MAKLINK를 작성하고 MAKLINK와 관련한 그래프를 얻는다. 여기서 MAKLINK는 장애물의 꼭지점을 연결하면서 볼록집합이 만들어지도록 하는 모서리의 집합을 의미한다. 얻은 그래프에서 출발점과 도착점을 포함하여 Dijkstra 알고리즘을 이용하여 최소 비용 최적 경로를 얻고 이 최적의 경로에서 개선된 Dijkstra경로를 얻는다. 마지막으로 개선된 Dijkstra경로에서 입자 군집 최적화를 적용하여 최적의 경로를 얻는다. 제안된 방법이 논문[1]에 나온 결과보다 더 좋은 성능을 갖는다는 것을 실험을 통해 입증한다.

다수 드론의 충돌 회피를 위한 경로점 구간 속도 프로파일 최적화 (Multiple Drones Collision Avoidance in Path Segment Using Speed Profile Optimization)

  • 김태형;강태영;이진규;김종한;유창경
    • 한국항공우주학회지
    • /
    • 제50권11호
    • /
    • pp.763-770
    • /
    • 2022
  • 다수의 드론이 운용되는 환경에서 경로점이 겹칠 때 충돌이 발생할 수 있으며 이를 대비한 충돌 회피는 필수적이다. 다수의 드론이 여러 임무를 수행하는 경우 드론의 경로가 복잡하고 충돌 예상점이 너무 많아 경로계획 단계에서 충돌을 회피하는 경로를 생성하는 방법을 사용하는 것은 적합하지 않다. 본 논문에서는 일반적으로 사용하는 경로 생성 알고리즘을 통해 경로를 생성하고, 그 경로에서 속도 프로파일 최적화를 이용한 충돌 회피 방법을 제안한다. 드론의 경로 간 충돌 예상점에서 드론 사이의 안전거리를 고려하였고, 경로 구간에 속도 프로파일을 할당하도록 설계하였다. 최적화 문제는 드론 간 거리에 대한 식을 비행시간을 변수로 두어 정의하였다. 선형화와 컨벡스화를 통해 구속 조건을 구성하고, 다수 드론 운용 환경에서 SQP(Sequential Quadratic Programming)알고리즘과 컨벡스 최적화 기법의 연산시간을 비교하였다. 마지막으로 20대 드론 운용 환경에서 컨벡스 최적화를 수행한 결과가 본 연구에서 제시한 다수 드론 운용에 적합한지 확인하였다.

스마트 팩토리 모빌리티 에너지 효율을 위한 경로 최적화에 관한 연구 (Route Optimization for Energy-Efficient Path Planning in Smart Factory Autonomous Mobile Robot)

  • 엄동희;조동욱;김성주;박상현;황성호
    • 드라이브 ㆍ 컨트롤
    • /
    • 제21권1호
    • /
    • pp.46-52
    • /
    • 2024
  • The advancement of autonomous driving technology has heightened the importance of Autonomous Mobile Robotics (AMR) within smart factories. Notably, in tasks involving the transportation of heavy objects, the consideration of weight in route optimization and path planning has become crucial. There is ongoing research on local path planning, such as Dijkstra, A*, and RRT*, focusing on minimizing travel time and distance within smart factory warehouses. Additionally, there are ongoing simultaneous studies on route optimization, including TSP algorithms for various path explorations and on minimizing energy consumption in mobile robotics operations. However, previous studies have often overlooked the weight of the objects being transported, emphasizing only minimal travel time or distance. Therefore, this research proposes route planning that accounts for the maximum payload capacity of mobile robotics and offers load-optimized path planning for multi-destination transportation. Considering the load, a genetic algorithm with the objectives of minimizing both travel time and distance, as well as energy consumption is employed. This approach is expected to enhance the efficiency of mobility within smart factories.

유전자 알고리즘을 이용한 부재 절단 경로 최적화 (A Study on Cutting Path Optimization Using Genetic Algorithm)

  • 박주용;서정진
    • 한국해양공학회지
    • /
    • 제23권6호
    • /
    • pp.67-70
    • /
    • 2009
  • Nesting and cutting path optimization have a great effect on the improvement of productivity in many industries such as shipbuilding, automotive, clothing, and so on. However, few researches have been carried out for the optimization of a cutting path algorithm. This study proposed a new method for cutting optimization using gravity center of cutting pieces and a genetic algorithm. The proposed method was tested for a sample plate including many different shapes of cutting pieces and compared to 2 other conventional methods. The test results showed that the new method had the shortest cutting path and the best effectiveness among the 3 methods.

Path Optimization for Welding/Soldering Robots Using an Improved Genetic Algorithm

  • Kang, Sung-Gyun;Kwon, Son;Choi, Hyuk-Jin
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2001년도 ICCAS
    • /
    • pp.180.6-180
    • /
    • 2001
  • Welding/soldering automation is one of the most important manufacturing issues in order to lower the cost, increase the quality, and avoid labor problems. An off-line programming, OLP, is one of the powerful methods to solve this kind of diver sity problem, Unless an OLP system is ready for the path optimization in welding/soldering, a waste of time and cost is unavoidable due to an inefficient path in welding/soldering processes. Therefore, this study attempts to obtain path optimization using a genetic algorithm based on artificial intelligences. The problem of the welding path optimization is defined as conventional TSP (traveling salesman problem), but still paths have to go through welding lines. An improved genetic algorithm was suggested and the problem was formulated as a TSP problem considering ...

  • PDF

레이저 토치의 절단경로 생성을 위한 혼합형 유전알고리즘 (A Hybrid Genetic Algorithm for Generating Cutting Paths of a Laser Torch)

  • 이문규;권기범
    • 제어로봇시스템학회논문지
    • /
    • 제8권12호
    • /
    • pp.1048-1055
    • /
    • 2002
  • The problem of generating torch paths for 2D laser cutting of a stock plate nested with a set of free-formed parts is investigated. The objective is to minimize the total length of the torch path starting from a blown depot, then visiting all the given Parts, and retuning back to the depot. A torch Path consists of the depot and Piercing Points each of which is to be specified for cutting a part. The torch path optimization problem is shown to be formulated as an extended version of the standard travelling salesman problem To solve the problem, a hybrid genetic algorithm is proposed. In order to improve the speed of evolution convergence, the algorithm employs a genetic algorithm for global search and a combination of an optimization technique and a genetic algorithm for local optimization. Traditional genetic operators developed for continuous optimization problems are used to effectively deal with the continuous nature of piercing point positions. Computational results are provided to illustrate the validity of the proposed algorithm.

Cooperative Path Planning of Dynamical Multi-Agent Systems Using Differential Flatness Approach

  • Lian, Feng-Li
    • International Journal of Control, Automation, and Systems
    • /
    • 제6권3호
    • /
    • pp.401-412
    • /
    • 2008
  • This paper discusses a design methodology of cooperative path planning for dynamical multi-agent systems with spatial and temporal constraints. The cooperative behavior of the multi-agent systems is specified in terms of the objective function in an optimization formulation. The path of achieving cooperative tasks is then generated by the optimization formulation constructed based on a differential flatness approach. Three scenarios of multi-agent tasking are proposed at the cooperative task planning framework. Given agent dynamics, both spatial and temporal constraints are considered in the path planning. The path planning algorithm first finds trajectory curves in a lower-dimensional space and then parameterizes the curves by a set of B-spline representations. The coefficients of the B-spline curves are further solved by a sequential quadratic programming solver to achieve the optimization objective and satisfy these constraints. Finally, several illustrative examples of cooperative path/task planning are presented.