• Title/Summary/Keyword: A-Star Algorithm

Search Result 148, Processing Time 0.032 seconds

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.

CCD PHOTOMETRY USING MULTIPLE COMPARISON STARS

  • Kim, Yong-gi;Andronov, Ivan L.;Jeon, Young-Beom
    • Journal of Astronomy and Space Sciences
    • /
    • v.21 no.3
    • /
    • pp.191-200
    • /
    • 2004
  • The accuracy of CCD observations obtained at the Korean 1.8m telescope has been studied. Seventeen comparison stars in the vicinity of the cataclysmic variable BG CMi have been measured. The 'artificial' star has been used instead of the 'control' star, what made possible to increase accuracy estimates by a factor of 1.3-2.1 times for 'good' and 'cloudy' nights, respectively. The algorithm of iterative determination of accuracy and weights of few comparison stars contributing to the artificial star, has been presented. The accuracy estimates for 13-mag stars are around $0.^m002$ mag for exposure times of 30 sec.

A STUDY ON THE VECTOR CONTROL OF INDUCTION MOTOR BASED ON SPEED ESTIMATION (유도전동기의 속도 추정 벡터제어에 관한 연구)

  • Sul, Seung-Ki;Kwon, Bong-Hyun;Kang, Jun-Koo
    • Proceedings of the KIEE Conference
    • /
    • 1989.11a
    • /
    • pp.264-267
    • /
    • 1989
  • In the vector controlled induction machine drives, mechanical speed sensors such as shaft encoder and resolver have been used. However, the mechanical speed sensors present some problems and restrict the wide applications of high performance AC drives. This paper describes the vector control strategy with the speed estimation algorithm in which motor slip frequency is calculated. Also, the angle deviation of the rotor flux vector is calculated and instaneously compensated to keep the q axis flux zero in the rotationary reference frame.

  • PDF

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.

Improvement of RRT*-Smart Algorithm for Optimal Path Planning and Application of the Algorithm in 2 & 3-Dimension Environment (최적 경로 계획을 위한 RRT*-Smart 알고리즘의 개선과 2, 3차원 환경에서의 적용)

  • Tak, Hyeong-Tae;Park, Cheon-Geon;Lee, Sang-Chul
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.27 no.2
    • /
    • pp.1-8
    • /
    • 2019
  • Optimal path planning refers to find the safe route to the destination at a low cost, is a major problem with regard to autonomous navigation. Sampling Based Planning(SBP) approaches, such as Rapidly-exploring Random Tree Star($RRT^*$), are the most influential algorithm in path planning due to their relatively small calculations and scalability to high-dimensional problems. $RRT^*$-Smart introduced path optimization and biased sampling techniques into $RRT^*$ to increase convergent rate. This paper presents an improvement plan that has changed the biased sampling method to increase the initial convergent rate of the $RRT^*$-Smart, which is specified as m$RRT^*$-Smart. With comparison among $RRT^*$, $RRT^*$-Smart and m$RRT^*$-Smart in 2 & 3-D environments, m$RRT^*$-Smart showed similar or increased initial convergent rate than $RRT^*$ and $RRT^*$-Smart.

The Hybrid LVQ Learning Algorithm for EMG Pattern Recognition (근전도 패턴인식을 위한 혼합형 LVQ 학습 알고리즘)

  • Lee Yong-gu;Choi Woo-Seung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.2 s.34
    • /
    • pp.113-121
    • /
    • 2005
  • In this paper, we design the hybrid learning algorithm of LVQ which is to perform EMG pattern recognition. The proposed hybrid LVQ learning algorithm is the modified Counter Propagation Networks(C.p Net. ) which is use SOM to learn initial reference vectors and out-star learning algorithm to determine the class of the output neurons of LVa. The weights of the proposed C.p. Net. which is between input layer and subclass layer can be learned to determine initial reference vectors by using SOM algorithm and to learn reference vectors by using LVd algorithm, and pattern vectors is classified into subclasses by neurons which is being in the subclass layer, and the weights which is between subclass layer and class layer of C.p. Net. is learned to classify the classified subclass. which is enclosed a class . To classify the pattern vectors of EMG. the proposed algorithm is simulated with ones of the conventional LVQ, and it was a confirmation that the proposed learning method is more successful classification than the conventional LVQ.

  • PDF

Input Pattern Vector Extraction and Pattern Recognition of EEG (뇌파의 입력패턴벡터 추출 및 패턴인식)

  • Lee, Yong-Gu;Lee, Sun-Yeob;Choi, Woo-Seung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.5 s.43
    • /
    • pp.95-103
    • /
    • 2006
  • In this paper, the input pattern vectors are extracted and the learning algorithms is designed to recognize EEG pattern vectors. The frequency and amplitude of alpha rhythms and beta rhythms are used to compose the input pattern vectors. And the algorithm for EEG pattern recognition is used SOM to learn initial reference vectors and out-star learning algorithm to determine the class of the output neurons of the subclass layer. The weights of the proposed algorithm which is between the input layer and the subclass layer can be learned to determine initial reference vectors by using SOM algorithm and to learn reference vectors by using LVQ algorithm, and pattern vectors is classified into subclasses by neurons which is being in the subclass layer, and the weights between subclass layer and output layer is learned to classify the classified subclass, which is enclosed a class. To classify the pattern vectors of EEG, the proposed algorithm is simulated with ones of the conventional LVQ, and it was a confirmation that the proposed learning method is more successful classification than the conventional LVQ.

  • PDF

Mission Path Planning to Maximize Survivability for Multiple Unmanned Aerial Vehicles based on 3-dimensional Grid Map (3차원 격자지도 기반 생존성 극대화를 위한 다수 무인 항공기 임무경로 계획)

  • Kim, Ki-Tae;Jeon, Geon-Wook
    • IE interfaces
    • /
    • v.25 no.3
    • /
    • pp.365-375
    • /
    • 2012
  • An Unmanned Aerial Vehicle (UAV) is a powered pilotless aircraft, which is controlled remotely or autonomously. UAVs are an attractive alternative for many scientific and military organizations. UAVs can perform operations that are considered to be risky or uninhabitable for humans. UAVs are currently employed in many military missions and a number of civilian applications. For accomplishing the UAV's missions, guarantee of survivability should be preceded. The main objective of this study is to suggest a mathematical programming model and a $A^*PS$_PGA (A-star with Post Smoothing_Parallel Genetic Algorithm) for Multiple UAVs's path planning to maximize survivability. A mathematical programming model is composed by using MRPP (Most Reliable Path Problem) and MTSP (Multiple Traveling Salesman Problem). After transforming MRPP into Shortest Path Problem (SPP),$A^*PS$_PGA applies a path planning for multiple UAVs.

Improving CMD Areal Density Analysis: Algorithms and Strategies

  • Wilson, R.E.
    • Journal of Astronomy and Space Sciences
    • /
    • v.31 no.2
    • /
    • pp.121-130
    • /
    • 2014
  • Essential ideas, successes, and difficulties of Areal Density Analysis (ADA) for color-magnitude diagrams (CMD's) of resolved stellar populations are examined, with explanation of various algorithms and strategies for optimal performance. A CMD-generation program computes theoretical datasets with simulated observational error and a solution program inverts the problem by the method of Differential Corrections (DC) so as to compute parameter values from observed magnitudes and colors, with standard error estimates and correlation coefficients. ADA promises not only impersonal results, but also significant saving of labor, especially where a given dataset is analyzed with several evolution models. Observational errors and multiple star systems, along with various single star characteristics and phenomena, are modeled directly via the Functional Statistics Algorithm (FSA). Unlike Monte Carlo, FSA is not dependent on a random number generator. Discussions include difficulties and overall requirements, such as need for fast evolutionary computation and realization of goals within machine memory limits. Degradation of results due to influence of pixelization on derivatives, Initial Mass Function (IMF) quantization, IMF steepness, low Areal Densities ($\mathcal{A}$), and large variation in $\mathcal{A}$ are reduced or eliminated through a variety of schemes that are explained sufficiently for general application. The Levenberg-Marquardt and MMS algorithms for improvement of solution convergence are contained within the DC program. An example of convergence, which typically is very good, is shown in tabular form. A number of theoretical and practical solution issues are discussed, as are prospects for further development.

Genetic Algorithm Based 3D Environment Local Path Planning for Autonomous Driving of Unmanned Vehicles in Rough Terrain (무인 차량의 험지 자율주행을 위한 유전자 알고리즘 기반 3D 환경 지역 경로계획)

  • Yun, SeungJae;Won, Mooncheol
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.20 no.6
    • /
    • pp.803-812
    • /
    • 2017
  • This paper proposes a local path planning method for stable autonomous driving in rough terrain. There are various path planning techniques such as candidate paths, star algorithm, and Rapidly-exploring Random Tree algorithms. However, such existing path planning has limitations to reflecting the stability of unmanned ground vehicles. This paper suggest a path planning algorithm that considering the stability of unmanned ground vehicles. The algorithm is based on the genetic algorithm and assumes to have probability based obstacle map and elevation map. The simulation result show that the proposed algorithm can be used for real-time local path planning in rough terrain.