• 제목/요약/키워드: 지역경로탐색

Search Result 125, Processing Time 0.026 seconds

Searching a Navigation Path to Avoid Danger Area for Safe Driving (안전운전을 위해 위험지역을 회피하는 내비게이션 경로탐색)

  • Lee, Yong-Hu;Kim, Sang-Woon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.8
    • /
    • pp.171-179
    • /
    • 2013
  • The primary function of navigation system is to provide route search and road guidance for safe driving for drivers. However, the existing route search system provides a simple service that looks up the shortest route using a safe driving DB without considering different road characteristics for the safety of the drivers. In order to maintain the safe driving, rather than searching the shortest path, a navigation system, in which the danger areas and/or the dangerous time zones have been considered, is required. Therefore, in this paper we propose a strategy of searching a navigation path to avoid danger areas for safe driving by using the A* algorithm. In the strategy, when evaluating the path-specific fitness of the navigation nodes, different heuristic weights were assigned to different types of risk areas. In particular, we considered three kinds of danger areas, such as accident-prone sections where accidents occur frequently, school zones, and intersection regions, as well as the time slots when the probability of danger is high. From computer simulation, the results demonstrate that the proposed scheme can provide the way to avoid danger areas on the route searching and confirm the possibility of providing the actual service.

Optimal Region Deployment for Cooperative Exploration of Swarm Robots (군집로봇의 협조 탐색을 위한 최적 영역 배치)

  • Bang, Mun Seop;Joo, Young Hoon;Ji, Sang Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.6
    • /
    • pp.687-693
    • /
    • 2012
  • In this paper, we propose a optimal deployment method for cooperative exploration of swarm robots. The proposed method consists of two parts such as optimal deployment and path planning. The optimal area deployment is proposed by the K-mean Algorithm and Voronoi tessellation. The path planning is proposed by the potential field method and A* Algorithm. Finally, the numerical experiments demonstrate the effectiveness and feasibility of the proposed method.

Efficient restriction of route search area in cluster based wireless ad hoc networks (클러스터 기반 무선 애드 혹 네트워크에서의 효율적인 경로 탐색 지역 제어)

  • Lee, Jangsu;Kim, Sungchun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.792-795
    • /
    • 2012
  • 애드 혹 네트워크(MANET: Mobile Ad hoc NETworks)는 기본적인 내부구조(infrastructure) 없이 노드들만으로 네트워크 망을 구성한다. 경로 탐색 정책으로 리액티브(reactive) 방식과 프로액티브(proactive) 방식이 있는데, 전통적으로 리액티브 방식의 성능이 더 좋은 것으로 평가된다. 그리고 두가지 방식의 장점을 취합한 하이브리드(hybrid) 방식의 클러스터 토폴로지(cluster topology) 도입에 관한 연구가 이루어지고 있다. 그 중, HCR(Hybrid Cluster Routing)이 제안되었는데, 이는 프로액티브 방식에 보다 중심을 둔 기법이다. HCR 은 리액티브 방식 경로 탐색 방법인 플라딩(flooding)의 탐색 지역을 한정된 범위로 제한할 수 있으나, 프로액티브 방식의 전체 네트워크 구성 정보 유지에 따른 막대한 오버헤드를 발생한다. 본 논문에서는 이러한 오버헤드를 줄이기 위해, 클러스터 내부 경로 탐색 기법인 MICF(Maginot path based Intra Cluster Flooding)를 제안한다. MICF 는 HCR 을 개선한 FSRS(First Search and Reverse Setting) 기반의 기법으로서, 클러스터 내부의 마지노 패스(maginot path)를 기준으로 경로 탐색 지역을 제한한다. MICF 는 게이트웨이(gateway) 간 최단 거리가 항상 클러스터 헤드(cluster head)를 중점으로 원의 내각 지역에 존재함을 바탕으로 하며, 최단 경로의 보장과 플라딩 지역 제한을 동시에 만족한다. 실험 결과, MICF 는 FSRS 기반의 기존 클러스터 내부 플라딩 방식보다 총 에너지의 7.79%만큼 더 에너지를 보존하였다. 결론적으로, MICF 역시 기존의 방식보다 에너지를 더 효율적으로 사용할 수 있으며, 마지노패스 설정과 이를 기반으로 한 제어 과정에 추가적인 오버헤드가 발생하지 않는다. 그리고 플라딩 면적이 작을수록 오버헤드가 줄어들게 됨을 알 수 있다.

A Performance Analysis of Routing Protocols Avoiding Route breakages in Ad hoc Networks (애드 흑 네트워크에서 경로 손실 회피 라우팅 프로토콜의 성능평가)

  • Wu Mary;Jung Sang Joon;Jung Youngseok;Kim Chonggun
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.1
    • /
    • pp.49-58
    • /
    • 2006
  • When the movement of a node breaks the route in ad-hoc network, on-demand routing protocol performs the local route recovery or a new route search for the route maintenance. And when it performs the new route search or the local search, the packet which is transmitted can be delayed. There are ARMP and RPAODV as the methods reducing the delay resulted from the route-breakage. They predict the route-breakage and construct an alterative local route before the occurrence of the route-breakage. When the link state is unstable, the success rate of the alternative local route that can avoid the route-breakage can give a direct effect on the route-breakage and the transmission delay, To estimate the performance of routing protocols avoiding route-breakage, we suggest the numerical formulas of AODV, the representative on-demand routing protocol, and ARMP, RPAODV. To verify the efficiency and accuracy of the proposed numerical formulas, we analysis and compare with the results of the computer simulation and that of the numerical formulas.

A Node-disjoint Multipath Discovery Method by Local Route Discovery based on AODV (AODV기반의 지역경로탐색을 이용한 노드 비중첩 다중 경로 검색 기법)

  • Jin, Dong-Xue;Kim, Young-Rag;Kim, Chong-Gun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.1 s.111
    • /
    • pp.87-94
    • /
    • 2007
  • In mobile ad hoc networks the most popular on demand routing protocols are the Dynamic Source Routing (DSR) protocol and the Ad hoc On demand Distance Vector (AODV) routing protocol. These and other representative standard routing protocols are designed to find and maintain only a single path. Whenever there is a link break on the active route, source node has to invoke a route discovery process from the beginning and it causes a lot of overhead. Multipath routing protocols, which can alleviate these problems by establishing multiple alternative paths between a source and a destination, are widely studied. In this paper we propose a node disjoint multipath discovery technique based on AODV local route discovery. This technique can find and build completely separated node disjoint multi paths from a source to a destination as many as possible. It will make routing more robust and stable.

An Improved Route Recovery using Bidirectional Searching Method for Ad hoc Networks (Ad hoc 네트워크에서의 양방향 경로탐색을 이용한 경로복구 개선 방안)

  • Han, Ho-Yeon;Nam, Doo-Hee;Kim, Seung-Cheon
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.1
    • /
    • pp.35-41
    • /
    • 2010
  • Since the ad-hoc network allow nodes to communicate each other without infrastructure system and predefined configuration, it comes into the spotlight that is suitable to ubiquitous society. In ad-hoc network, route recovery mechanism is considered important. Normally route recovery is needed to solve the link failure problem because there is no route maintaining system like a router in ad-hoc networks. In this paper we propose BS-AODV(Bidirectional Searching-AODV) route recovery method. The proposed method is a local repair method that can be applied in all of the network area. Unlike a limited local repair method in AODV. the proposed method adopts the bidirectional searching method where the upstream/downstream nodes can send the route maintenance messages. Restricting the flooding of route request messages, the proposed scheme attempts to minimize the costs of local repair, the performance of the proposed scheme is evaluated through the simulations. In two scenarios which variate the node numbers and node speed, the comparison among the proposed scheme, AODV and AOMDV is shown in terms of the control traffic and data delivery ratio.

Collision Avoidance for an Autonomous Mobile Robot Using Genetic Algorithms (유전 알고리즘을 이용한 자율 주행 로봇의 장애물 호피)

  • 이기성;조현철
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.8 no.4
    • /
    • pp.27-35
    • /
    • 1998
  • Navigation is a method to direct a mobile robot without collision when traversing the environment. This is to reach a destination without getting lost. In this paper, global and local path planning in fixed obstacle and moving obstacle using genetic algorithm are presented. First, mobile robot searches optimal global path using genetic algorithm without falling into local minima. Then if it finds a unknown obstacle, it searches new path without crashing obstacle. Also if there is a moving obstacle, mobile robot searches new optimal path without colliding with the obstacles. Various simulation results show the proposed algorithm can search a shortest path effectively.

  • PDF

Optimal solution search method by using modified local updating rule in ACS-subpath algorithm (부경로를 이용한 ACS 탐색에서 수정된 지역갱신규칙을 이용한 최적해 탐색 기법)

  • Hong, SeokMi;Lee, Seung-Gwan
    • Journal of Digital Convergence
    • /
    • v.11 no.11
    • /
    • pp.443-448
    • /
    • 2013
  • Ant Colony System(ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants which accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, ACS requires to explore various edges. In existing ACS, the local updating rule assigns the same pheromone to visited edge. In this paper, our local updating rule gives the pheromone according to the total frequency of visits of the currently selected node in the previous iteration. I used the ACS algoritm using subpath for search. Our approach can have less local optima than existing ACS and find better solution by taking advantage of more informations during searching.

A Path Fault Avoided RPAODV Routing in Ad Hoc Networks (Ad Hoc 네트워크의 경로손실 회피기반 RPAODV 라우팅)

  • Wu Mary;Kim Youngrak;Kim Chonggun
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.879-888
    • /
    • 2004
  • Ad Node transmits packets to a destination node using routing function of intermediate nodes on the path in Ad Hoc networks. When the link to a next hop node in a path is broken due to the next hop node's mobility, a new route search process is required for continuing packets transmission. The node which recognizes link fault starts a local route recovery or the source node starts a new route search in the on demand routing protocol AODV. In this case, the new route search or the local route search brings packet delays and bad QoSs by packet delay. We propose RPAODV that the node predicts a link fault selects a possible node in neighbor nodes as a new next hop node for the path. The proposed protocol can avoid path faults and improve QoS.

A Simulated Annealing Algorithm for Path Finding in A Game Map (게임 맵에서 경로 찾기 해법을 위한 시뮬레이티드 어닐링 알고리즘)

  • Kang, Myung-Ju
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2012.01a
    • /
    • pp.189-192
    • /
    • 2012
  • 게임 인공지능에서 경로 찾기는 매우 중요한 분야이다. 캐릭터나 NPC(Non Player Charater)가 목적지까지의 경로를 탐색하기 위해서는 복잡하게 구성된 게임 맵에서 오브젝트나 벽 등의 장애물을 회피하면서 가능한 최단 경로를 찾아야 한다. 기존의 일반적인 경로 찾기 알고리즘은 캐릭터의 움직임이 자유로운 간단한 게임 맵에서는 전역 최소해 탐색이 가능하다. 그러나 다양한 오브젝트 등이 배치된 큰 규모의 게임 맵에서는 캐릭터가 목적지까지의 경로를 탐색하는 과정에서 지역 최소해(Local Minima)로의 수렴이 발생함으로써 이를 탈피하는 것이 어렵고, 결국에는 목적지까지 도달하지 못하는 상황이 발생하게 된다. 본 논문에서는 이러한 기존 경로 찾기 알고리즘의 단점을 해결하기 위해 시뮬레이티드 어닐링 알고리즘을 제안하였다.

  • PDF