• Title/Summary/Keyword: searching car

Search Result 38, Processing Time 0.021 seconds

VTA* Algorithm: A* Path-Finding Algorithm using Variable Turn Heuristic (VTA* 알고리즘: 가변적인 턴 휴리스틱을 적용한 A* 경로탐색 알고리즘)

  • Kim, Ji-Soo;Cho, Dae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.3
    • /
    • pp.663-668
    • /
    • 2010
  • In driving a car, turns such as left turns, right turns, or u-turns, make the speed of the car decrease considerably. A more straight path, therefore, is probably faster to arrive at the destination than zig-zag path with same distance. In this paper, we have newly proposed the turn heuristic to make more straight path. The path navigation algorithm with turn heuristic(called as TA* algorithm) could enhance the straightness of a path by putting the turned-edges to the turn cost. It requires higher cost to use TA* algorithm than traditional A* algorithm because the straight-edge first searching have increased the search space. We have improved the TA* algorithm into the variable TA* algorithm(called as VTA* algorithm) which adopt the turn-heuristic during the a portion of the whole path.

Development of Gap Searching System for Car Body Assembly by Decomposition Model Representation (분해 모델을 이용한 자동차 차체의 틈새 탐색 시스템 개발)

  • Bae, Won-Jung;Lee, Sung-Hoon;Park, Sung-Bae;Jung, Yoong-Ho
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.20 no.4
    • /
    • pp.109-118
    • /
    • 2012
  • Large number of part design for aircraft and automobile is preceded by functional or sectional design groups for efficiency. However, interferences and gaps can be found when the parts and sub-assemblies by those design groups are to be assembled. These interferences and gaps cause design changes and additional repair processes. While interference problem has been resolved by digital mockup and concurrent engineering methodology, gap problem has been covered by temporary treatment of filling gap with sealant. This kind of fast fix causes fatal problem of leakage when the gap is too big for filling or the treatment gets old. With this research, we have developed a program to find the gap automatically among parts of assembly so that users can find them to correct their design before manufacturing stage. By using decomposition model representation method, the developed program can search the gap among complex car body parts to be visualized with volumetric information. It can also define the boundary between the gap and exterior empty space automatically. Though we have proved the efficiency of the developed program by applying to automobile assembly, application of the program is not limited to car body only, but also can be extended to aircraft and ship design of large number of parts.

Recognition System of Car License Plate using Fuzzy Neural Networks (퍼지 신경망을 이용한 자동차 번호판 인식 시스템)

  • Kim, Kwang-Baek;Cho, Jae-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.5
    • /
    • pp.313-319
    • /
    • 2007
  • In this paper, we propose a novel method to extract an area of car licence plate and codes of vehicle number from a photographed car image using features on vertical edges and a new Fuzzy neural network algorithm to recognize extracted codes. Prewitt mask is used in searching for vertical edges for detection of an area of vehicle number plate and feature information of vehicle number palate is used to eliminate image noises and extract the plate area and individual codes of vehicle number. Finally, for recognition of extracted codes, we use the proposed Fuzzy neural network algorithm, in which FCM is used as the learning structure between input and middle layers and Max_Min neural network is used as the learning structure within inhibition and output layers. Through a variety of experiments using real 150 images of vehicle, we showed that the proposed method is more efficient than others.

  • PDF

A Study on The Application of WEB-Site to Rent-a-car (차량대여업체 웹사이트 활용방안에 관한 연구)

  • 강태석
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.11
    • /
    • pp.1445-1452
    • /
    • 2001
  • Internet system is now essential part of modern human life to get useful information totally by network. Moreover, in terms of travel agency business, the application of electronic commerce system using Internet is extremely important, because that providing and getting proper information is the focus to success in the business. They don't provide enough sub tools like keyboard searching function, sitemap and real-online reservation system. The bulletin board usually has a big role to gather visitors opinion, provide new information and Promotion their company to everyone.

  • PDF

Fast Route Searching Algorithm Using Fuzzy (Fuzzy를 이용한 빠른 경로 탐색 알고리즘)

  • 이기정;황보택근
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2004.03a
    • /
    • pp.51-56
    • /
    • 2004
  • 인터넷 통신과 무선 이동 통신의 발달은 최적 경로 탐색이 인터넷 웹 페이지를 통하여 서비스될 수 있도록 하였으며, CNS(Car Navigation System)를 이용한 서비스도 가능하도록 하였다. 나아가 개인용 휴대통신 장비인 PDA나 핸드폰을 이용하여서도 그 서비스가 제공되고 있다. 기존의 양방향 A* 알고리즘에서는 현재 노드에서 목적지까지의 예상 비용을 직선 거리를 사용하였지만 본 논문에서는 현재 노드까지 지나온 경로에 대한 정보를 이용하였다. 지금까지 지나온 경로의 평균 경로 비용을 계산하여 이용함으로써, 직선 길이가 아닌 지금까지 지나온 경로의 정보를 이용할 수 있었고, 지나온 경로의 정보와 앞으로 탐색할 경로에 대한 애매한 정보들(도로의 속도, 날씨, 주행시간대)을 퍼지를 이용하여 계산하였다. 퍼지를 이용하여 도로의 애매한 정보들을 실시간으로 활용할 수 있는 알고리즘을 제안하고 제안한 알고리즘의 타당성을 실험을 통하여 검증하였다.

  • PDF

Link Label-Based Optimal Path Algorithm Considering Station Transfer Penalty - Focusing on A Smart Card Based Railway Network - (역사환승페널티를 고려한 링크표지기반 최적경로탐색 - 교통카드기반 철도네트워크를 중심으로 -)

  • Lee, Mee Young
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.38 no.6
    • /
    • pp.941-947
    • /
    • 2018
  • Station transfers for smart card based railway networks refer to transfer pedestrian movements that occur at the origin and destination nodes rather than at a middle station. To calculate the optimum path for the railway network, a penalty for transfer pedestrian movement must be included in addition to the cost of within-car transit time. However, the existing link label-based path searching method is constructed so that the station transfer penalty between two links is detected. As such, station transfer penalties that appear at the origin and destination stations are not adequately reflected, limiting the effectiveness of the model. A ghost node may be introduced to expand the network, to make up for the station transfer penalty, but has a pitfall in that the link label-based path algorithm will not hold up effectively. This research proposes an optimal path search algorithm to reflect station transfer penalties without resorting to enlargement of the existing network. To achieve this, a method for applying a directline transfer penalty by comparing Ticket Gate ID and the line of the link is proposed.

A Study on Road Network Modeling over POI for Pedestrian Navigation Services in Smart Phones (스마트폰에서 보행자 길안내 서비스를 위한 관심지점 기반 도로 네트워크 모델링 연구)

  • Chung, Weon-Il;Kim, Sang-Ki
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.1
    • /
    • pp.396-404
    • /
    • 2011
  • Recently, the wide spread popularity of smart phones causes the advent of various mobile applications base on the location information. Since previous pedestrian navigations are applied by extending car navigations, these are not only difficult to provide the appropriate route information, but also raise limitations in the efficient query processing by data structures of car road networks. In addition, these increase the power consumption caused by the growth of I/O frequency. In this paper, we propose a pedestrian road network model for the accurate route information and a storage structure for the pedestrian road network based on POI to reduce the I/O frequency. The proposed method enables efficient route searches over POI reflecting the characteristics and requirements of pedestrian roads. Also, a reduction of query processing costs for the route searching by a data structure considered with POI can save the power consumption more than previous approaches.

Digital Satellite Radio Broadcast Channel Information Search Process Method (Digital satellite radio 방송의 채널 정보 Searching 처리 Method에 관한 연구)

  • Lee, Seung-Hun;Kim, Yound-Cil
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.285-288
    • /
    • 2010
  • In this paper, we present a very useful method for updating digital satellite radio broadcast channel information. When a devices equipped with function to receive Digital Satellite Radio such as Home Theater, MP3 player, mobile phones, car audio system and various other types of Digital Devices, receives new Digital satellite radio (will be mentioned as XM radio onwards) broadcast channel information, only the current received XM radio broadcast channel and N number of pre/post nearby broadcast channels are scanned randomly in zigzag manner. Then the previous XM radio broadcast channel information updated with the newly received XM radio broadcast channel information. Since this method can prevent batch update for all XM radio channel, including some channels which less likely did not select by user, update process for real time frequently changed XM radio broadcast channel information can be performed efficiently with minimal or without delay.

  • PDF

An Exploratory Study on the Buying Decision-making Process of Automobile Books (자동차전문서적 구매의사 결정과정에 관한 탐색적 연구)

  • Kim, Kil-Hyun;Ha, Kyu-Soo
    • Asia-Pacific Journal of Business Venturing and Entrepreneurship
    • /
    • v.6 no.3
    • /
    • pp.1-18
    • /
    • 2011
  • Publication Industry of scientific technology is showing tendency of decreasing in sales, which clearly draws down curve since 2000. The printing culture is declining whether it is because of trend avoiding pure science or technological science and engineering, advancement of mass media or increasing frequency of using internet. Nevertheless, researcher considered car industry in publication industry as a life-long purpose for study. For this reason, the researcher tried to find the variables of the marketing which give impact on the customers such as student group and consumer who buys cars, when buying professional books. The found variables are expected to have a huge impact on the publication industry of professional books. As a result of research, in the area of the vision and motive, most said that they have "chosen a major in car because they liked car in usual base." In the stage of recognizing the problem, they buy the books when it is inevitably necessary. In the stage of searching for the information, they get information from advertisements, friends, professors, internet or sales clerk in book stores. In the stage of evaluation, they look for the title and the publication date of the books. In addition, in the stage of deciding purchase, "buy immediately" was the most frequent answer while impulsive purchase is the least frequent answer. In the stage of evaluating after purchase, many of them mostly are satisfied with their purchase.

  • PDF

An Efficient Search Mechanism for Dynamic Path Selection (동적 경로 선정을 위한 효율적인 탐색 기법)

  • Choi, Kyung-Mi;Park, Hwa-Jin;Park, Young-Ho
    • Journal of Digital Contents Society
    • /
    • v.13 no.3
    • /
    • pp.451-457
    • /
    • 2012
  • Recently, as the use of real time traffic information of a car navigation system increases rapidly with the development of Intelligent Transportation Systems (ITS), path search is getting more important. Previous algorithms, however, are mostly for the shortest distance searching and provide route information using static distance and time information. Thus they could not provide the most optimal route at the moment which changes dynamically according to traffic. Accordingly, in this study, Semantic Shortest Path algorithm with Reduction ratio & Distance(SSP_RD) is proposed to solve this problem. Additionally, a routing model based on velocity reduction ratio and distance and a dynamic route link map are proposed.