• Title/Summary/Keyword: A-star search algorithm

Search Result 20, Processing Time 0.028 seconds

Development of Destination Optimal Path Search Method Using Multi-Criteria Decision Making Method and Modified A-STAR Algorithm (다기준의사결정기법과 수정 A-STAR 알고리즘을 이용한 목적지 최적경로 탐색 기법 개발)

  • Choi, Mi-Hyeong;Seo, Min-Ho;Woo, Je-Seung;Hong, Sun-Gi
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.24 no.6_2
    • /
    • pp.891-897
    • /
    • 2021
  • In this paper, we propose a destination optimal route algorithm for providing route finding service for the transportation handicapped by using the multi-criteria decision-making technique and the modified A-STAR optimal route search algorithm. This is a method to set the route to the destination centering on safety by replacing the distance cost of the existing A-STAR optimal route search algorithm with the safety cost calculated through AHP/TOPSIS analysis. To this end, 10 factors such as road damage, curb, and road hole were first classified as poor road factors that hinder road driving, and then pairwise comparison of AHP was analyzed and then defined as the weight of TOPSIS. Afterwards, the degree of driving safety was quantified for a certain road section in Busan through TOPSIS analysis, and the development of an optimal route search algorithm for the transportation handicapped that replaces the distance cost with safety in the finally modified A-STAR optimal route algorithm was completed.

A New Pivot Algorithm for Star Identification

  • Nah, Jakyoung;Yi, Yu;Kim, Yong Ha
    • Journal of Astronomy and Space Sciences
    • /
    • v.31 no.3
    • /
    • pp.205-214
    • /
    • 2014
  • In this study, a star identification algorithm which utilizes pivot patterns instead of apparent magnitude information was developed. The new star identification algorithm consists of two steps of recognition process. In the first step, the brightest star in a sensor image is identified using the orientation of brightness between two stars as recognition information. In the second step, cell indexes are used as new recognition information to identify dimmer stars, which are derived from the brightest star already identified. If we use the cell index information, we can search over limited portion of the star catalogue database, which enables the faster identification of dimmer stars. The new pivot algorithm does not require calibrations on the apparent magnitude of a star but it shows robust characteristics on the errors of apparent magnitude compared to conventional pivot algorithms which require the apparent magnitude information.

ACA: Automatic search strategy for radioactive source

  • Jianwen Huo;Xulin Hu;Junling Wang;Li Hu
    • Nuclear Engineering and Technology
    • /
    • v.55 no.8
    • /
    • pp.3030-3038
    • /
    • 2023
  • Nowadays, mobile robots have been used to search for uncontrolled radioactive source in indoor environments to avoid radiation exposure for technicians. However, in the indoor environments, especially in the presence of obstacles, how to make the robots with limited sensing capabilities automatically search for the radioactive source remains a major challenge. Also, the source search efficiency of robots needs to be further improved to meet practical scenarios such as limited exploration time. This paper proposes an automatic source search strategy, abbreviated as ACA: the location of source is estimated by a convolutional neural network (CNN), and the path is planned by the A-star algorithm. First, the search area is represented as an occupancy grid map. Then, the radiation dose distribution of the radioactive source in the occupancy grid map is obtained by Monte Carlo (MC) method simulation, and multiple sets of radiation data are collected through the eight neighborhood self-avoiding random walk (ENSAW) algorithm as the radiation data set. Further, the radiation data set is fed into the designed CNN architecture to train the network model in advance. When the searcher enters the search area where the radioactive source exists, the location of source is estimated by the network model and the search path is planned by the A-star algorithm, and this process is iterated continuously until the searcher reaches the location of radioactive source. The experimental results show that the average number of radiometric measurements and the average number of moving steps of the ACA algorithm are only 2.1% and 33.2% of those of the gradient search (GS) algorithm in the indoor environment without obstacles. In the indoor environment shielded by concrete walls, the GS algorithm fails to search for the source, while the ACA algorithm successfully searches for the source with fewer moving steps and sparse radiometric data.

A new hybrid optimization algorithm based on path projection

  • Gharebaghi, Saeed Asil;Ardalan Asl, Mohammad
    • Structural Engineering and Mechanics
    • /
    • v.65 no.6
    • /
    • pp.707-719
    • /
    • 2018
  • In this article, a new method is introduced to improve the local search capability of meta-heuristic algorithms using the projection of the path on the border of constraints. In a mathematical point of view, the Gradient Projection Method is applied through a new approach, while the imposed limitations are removed. Accordingly, the gradient vector is replaced with a new meta-heuristic based vector. Besides, the active constraint identification algorithm, and the projection method are changed into less complex approaches. As a result, if a constraint is violated by an agent, a new path will be suggested to correct the direction of the agent's movement. The presented procedure includes three main steps: (1) the identification of the active constraint, (2) the neighboring point determination, and (3) the new direction and step length. Moreover, this method can be applied to some meta-heuristic algorithms. It increases the chance of convergence in the final phase of the search process, especially when the number of the violations of the constraints increases. The method is applied jointly with the authors' newly developed meta-heuristic algorithm, entitled Star Graph. The capability of the resulted hybrid method is examined using the optimal design of truss and frame structures. Eventually, the comparison of the results with other meta-heuristics of the literature shows that the hybrid method is successful in the global as well as local search.

Elderly Assistance System Development based on Real-time Embedded Linux (실시간 임베디드 리눅스 기반 노약자 지원 로봇 개발)

  • Koh, Jae-Hwan;Yang, Gil-Jin;Choi, Byoung-Wook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.11
    • /
    • pp.1036-1042
    • /
    • 2013
  • In this paper, an elderly assistance system is developed based on Xenomai, a real-time development framework cooperating with the Linux kernel. A Kinect sensor is used to recognize the behavior of the elderly and A-star search algorithm is implemented to find the shortest path to the person. The mobile robot also generates a trajectory using a digital convolution operator which is based on a Bezier curve for smooth driving. In order to follow the generated trajectory within the control period, we developed real-time tasks and compared the performance of the tracking trajectory with that of non real-time tasks. The real-time task has a better result on following the trajectory within the physical constraints which means that it is more appropriate to apply to an elderly assistant system.

New iand use decision algorithm for distribution load forecast using $R\star$Tree Algorithm ($R\star$Tree 알고리즘을 이용한 배전부하 예측용 토지용도 판정 알고리즘 개발)

  • Park C. H.;Oh J. H.;Jung J. M.;Park S. M.;Chae W. K.
    • Proceedings of the KIEE Conference
    • /
    • summer
    • /
    • pp.135-137
    • /
    • 2004
  • This paper describes new land use estimation method for long term load forecast using $R\startree$ algorithm. Where $R\startree$ algorithms is a proposed method for efficient spatial search. An estimation result showed that execute time of the proposed method is prior to execute time of conventional method.

  • PDF

A new meta-heuristic optimization algorithm using star graph

  • Gharebaghi, Saeed Asil;Kaveh, Ali;Ardalan Asl, Mohammad
    • Smart Structures and Systems
    • /
    • v.20 no.1
    • /
    • pp.99-114
    • /
    • 2017
  • In cognitive science, it is illustrated how the collective opinions of a group of individuals answers to questions involving quantity estimation. One example of this approach is introduced in this article as Star Graph (SG) algorithm. This graph describes the details of communication among individuals to share their information and make a new decision. A new labyrinthine network of neighbors is defined in the decision-making process of the algorithm. In order to prevent getting trapped in local optima, the neighboring networks are regenerated in each iteration of the algorithm. In this algorithm, the normal distribution is utilized for a group of agents with the best results (guidance group) to replace the existing infeasible solutions. Here, some new functions are introduced to provide a high convergence for the method. These functions not only increase the local and global search capabilities but also require less computational effort. Various benchmark functions and engineering problems are examined and the results are compared with those of some other algorithms to show the capability and performance of the presented method.

DL-RRT* algorithm for least dose path Re-planning in dynamic radioactive environments

  • Chao, Nan;Liu, Yong-kuo;Xia, Hong;Peng, Min-jun;Ayodeji, Abiodun
    • Nuclear Engineering and Technology
    • /
    • v.51 no.3
    • /
    • pp.825-836
    • /
    • 2019
  • One of the most challenging safety precautions for workers in dynamic, radioactive environments is avoiding radiation sources and sustaining low exposure. This paper presents a sampling-based algorithm, DL-RRT*, for minimum dose walk-path re-planning in radioactive environments, expedient for occupational workers in nuclear facilities to avoid unnecessary radiation exposure. The method combines the principle of random tree star ($RRT^*$) and $D^*$ Lite, and uses the expansion strength of grid search strategy from $D^*$ Lite to quickly find a high-quality initial path to accelerate convergence rate in $RRT^*$. The algorithm inherits probabilistic completeness and asymptotic optimality from $RRT^*$ to refine the existing paths continually by sampling the search-graph obtained from the grid search process. It can not only be applied to continuous cost spaces, but also make full use of the last planning information to avoid global re-planning, so as to improve the efficiency of path planning in frequently changing environments. The effectiveness and superiority of the proposed method was verified by simulating radiation field under varying obstacles and radioactive environments, and the results were compared with $RRT^*$ algorithm output.

Path-finding Algorithm using Heuristic-based Genetic Algorithm (휴리스틱 기반의 유전 알고리즘을 활용한 경로 탐색 알고리즘)

  • Ko, Jung-Woon;Lee, Dong-Yeop
    • Journal of Korea Game Society
    • /
    • v.17 no.5
    • /
    • pp.123-132
    • /
    • 2017
  • The path-finding algorithm refers to an algorithm for navigating the route order from the current position to the destination in a virtual world in a game. The conventional path-finding algorithm performs graph search based on cost such as A-Star and Dijkstra. A-Star and Dijkstra require movable node and edge data in the world map, so it is difficult to apply online games with lots of map data. In this paper, we provide a Heuristic-based Genetic Algorithm Path-finding(HGAP) using Genetic Algorithm(GA). Genetic Algorithm is a path-finding algorithm applicable to game with variable environment and lots of map data. It seek solutions through mating, crossing, mutation and evolutionary operations without the map data. The proposed algorithm is based on Binary-Coded Genetic Algorithm and searches for a path by performing a heuristic operation that estimates a path to a destination to arrive at a destination more quickly.

Design and Implementation of an Optimal 3D Flight Path Recommendation System for Unmanned Aerial Vehicles (무인항공기를 위한 최적의 3차원 비행경로 추천 시스템 설계 및 구현)

  • Kim, Hee Ju;Lee, Won Jin;Lee, Jae Dong
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.10
    • /
    • pp.1346-1357
    • /
    • 2021
  • The drone technology, which is receiving a lot of attention due to the 4th industrial revolution, requires an Unmanned Aerial Vehicles'(UAVs) flight path search algorithm for automatic operation and driver assistance. Various studies related to flight path prediction and recommendation algorithms are being actively conducted, and many studies using the A-Star algorithm are typically performed. In this paper, we propose an Optimal 3D Flight Path Recommendation System for unmanned aerial vehicles. The proposed system was implemented and simulated in Unity 3D, and by indicating the meaning of the route using three different colors, such as planned route, the recommended route, and the current route were compared each other. And obstacle response experiments were conducted to cope with bad weather. It is expected that the proposed system will provide an improved user experience compared to the existing system through accurate and real-time adaptive path prediction in a 3D mixed reality environment.