• Title/Summary/Keyword: Multi-route

Search Result 320, Processing Time 0.2 seconds

Multi-legged robot system enabled to decide route and recognize obstacle based on hand posture recognition (손모양 인식기반의 경로교사와 장애물 인식이 가능한 자율보행 다족로봇 시스템)

  • Kim, Min-Sung;Jeong, Woo-Won;Kwan, Bae-Guen;Kang, Dong-Joong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.8
    • /
    • pp.1925-1936
    • /
    • 2010
  • In this paper, multi-legged robot was designed and produced using stable walking pattern algorithm. The robot had embedded camera and wireless communication function and it is possible to recognize both hand posture and obstacles. The algorithm decided moving paths, and recognized and avoided obstacles through Hough Transform using Edge Detection of inputed image from image sensor. The robot can be controlled by hand posture using Mahalanobis Distance and average value of skin's color pixel, which is previously learned in order to decide the destination. The developed system has shown obstacle detection rate of 96% and hand posture recognition rate of 94%.

An Algorithm for Searching Pareto Optimal Paths of HAZMAT Transportation: Efficient Vector Labeling Approach (위험물 수송 최적경로 탐색 알고리즘 개발: Efficient Vector Labeling 방법으로)

  • Park, Dong-Joo;Chung, Sung-Bong;Oh, Jeong-Taek
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.11 no.3
    • /
    • pp.49-56
    • /
    • 2011
  • This paper deals with a methodology for searching optimal route of hazard material (hazmat) vehicles. When we make a decision of hazmat optimal paths, there is a conflict between the public aspect which wants to minimize risk and the private aspect which has a goal of minimizing travel time. This paper presents Efficient Vector Labeling algorithm as a methodology for searching optimal path of hazmat transportation, which is intrinsically one of the multi-criteria decision making problems. The output of the presented algorithm is a set of Pareto optimal paths considering both risk and travel time at a time. Also, the proposed algorithm is able to identify non-dominated paths which are significantly different from each other in terms of links used. The proposed Efficient Vector Labeling algorithm are applied to test bed network and compared with the existing k-shortest path algorithm. Analysis of result shows that the proposed algorithm is more efficient and advantageous in searching reasonable alternative routes than the existing one.

Understanding how agent control based on social status affects user experience factors in multi-user autonomous driving environments (다중 사용자 자율 주행 운전 환경에서 사회적 지위에 따른 에이전트의 제어권이 사용자 경험 요소에 미치는 영향)

  • JiYeon Kim;JuHye Ha;ChangHoon Oh
    • The Journal of the Convergence on Culture Technology
    • /
    • v.9 no.1
    • /
    • pp.735-745
    • /
    • 2023
  • The purpose of this study is to examine how the control of an agent according to a driver's social status affects user experience factors in a multi-user environment of self-driving vehicles. We conducted a user study where participants viewed four scenarios (route changing/parking x accepting/declining a fellow passenger's command) and answered a survey, followed by a post-hoc interview. Results showed that either the routing scenario or accepting a passenger's command scenario had higher usefulness (convenience, effectiveness, efficiency) than their counterparts. Regardless of the car owner's social status, participants rated AI agents more positively when they met their goals effectively. They also stressed that vehicle owners should always be in control of their agents. This study can provide guidelines for designing future autonomous driving scenarios where an agent interacts with a driver, and passengers.

A New Routing Protocol in Wireless Ad-hoc Networks with Multiple Radios and Channels

  • Ko, Sung-Won;Cho, Jeong-Hwan;Hong, Kwon-Eui
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.24 no.7
    • /
    • pp.26-40
    • /
    • 2010
  • We propose a new routing protocol, MCQosR, that is based on bandwidth estimation, admission control, and a routing metric, MCCR - suitable for wireless ad-hoc networks with multiple radios and channels. To use the full capacity of a wireless link, we assume a node with multiple radios for full duplex operation, and a radio using multiple channels to exclude route-intra interference. This makes it possible to use the capacity of a wireless link. Then, to provide bandwidth and delay guarantee, we have a radio with a fixed channel for layer-3 data reception at each node, used to estimate the available bandwidth and expected delay of a wireless link. Based on the estimate of available bandwidth and delay, we apply the call admission control to a new call requiring bandwidth and delay guarantee. New calls with traffic that will overflow link or network capacity are rejected so the accepted calls can use the required bandwidth and delay. Finally, we propose a routing metric, MCCR, which considers the channel contentions and collisions of a wireless link operating in CSMA/CA. MCCR is useful for finding a route with less traffic and distributing traffic over the network to prevent network congestion as much as possible. The simulation of the MCQosR protocol and the MCCR metric shows traffic is distributed and guaranteed service is provided for accepted calls.

Stable Message Transmission Protocol Considering Remaining Energy of Nodes on Wireless Networks (무선네트워크에서 노드의 에너지를 고려한 종단간 안정성 있는 메시지 전송 프로토콜)

  • Duong, Mai Dinh;Kim, Myung-Kyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.5
    • /
    • pp.1215-1223
    • /
    • 2014
  • In multi-hop wireless networks, a message transmission path is set up on demand by a route discovery step, where a shortest path is used in general. The shortest path, however, normally uses the nodes near the center area, which causes a high traffic load in that area and reduces the message transmission reliability. We propose a stable routing protocol considering the remaining energy of nodes. Our protocol uses ETX as a link performance estimator and tries to avoid the nodes with smaller energy. By doing this, we can reduce the route failure probability and packet loss. We have evaluated the performance of the proposed protocol using QualNet and compared with AODV and MRFR protocols. The simulation result shows that our protocol has a similar performance as MRFR in terms of end-to-end message reception ratio, average message delay and delay jitter, but outperforms MRFR in terms of traffic load distribution.

The Development of a Tour Route Guidance System Using a Traveling Salesman Problem Algorithm (TSP 알고리듬을 이용한 관광노선 안내 시스템 개발)

  • 정영아;구자용
    • Spatial Information Research
    • /
    • v.11 no.3
    • /
    • pp.275-289
    • /
    • 2003
  • This study focused on offering a helpful information for the touring. To develop a tour route guidance tool, it is needed to use a GIS function, which can suggest a possible shortest path based on time and distance. A Traveling salesman problem algorithm, which was developed to solve multi destination problem in network analysis, was used to implement a tour guidance system. This system was developed using ArcObjects programming components within ArcGIS 8.3. Jeju city was selected for the case study to apply the tool and to test the effectiveness of it. This study demonstrated that this tool was considerably effective for finding a probable optimum tour path in the following aspects. First, it can help tourists to select several attractions from numerous tour sites in an area given limited time. Second, tourist can manage time efficiently by organizing their tour courses on the basis of the tool. Third, tourists can reduce the uncertainties that may happen under unexpected situations in unfamiliar places by obtaining specific spatial information using the tool. Fourth, the Graphic User Interface of the tool can be easily used to obtain visual information of spatial data.

  • PDF

Development of the Multi-Path Finding Model Using Kalman Filter and Space Syntax based on GIS (Kalman Filter와 Space Syntax를 이용한 GIS 기반 다중경로제공 시스템 개발)

  • Ryu, Seung-Kyu;Lee, Seung-Jae;Ahn, Woo-Young
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.7 s.85
    • /
    • pp.149-158
    • /
    • 2005
  • The object of this paper is to develop the shortest path algorithm. The existing shortest path algorithm models are developed while considering travel time and travel distance. A few problems occur in these shortest path algorithm models, which have paid no regard to cognition of users, such as when user who doesn't have complete information about the trip meets a strange road or when the route searched from the shortest path algorithm model is not commonly used by users in real network. This paper develops a shortest path algorithm model to provide ideal route that many people actually prefer. In order to provide the ideal shortest path with the consideration of travel time, travel distance and road cognition, travel time is predicted by using Kalman filtering and travel distance is predicted by using GIS attributions. The road cognition is considered by using space data of GIS. Optimal routes provided from this paper are shortest distance path, shortest time path, shortest path considering distance and cognition and shortest path considering time and cognition.

A Domain-based Reactive Routing Protocol for the Hybrid WMN (하이브리드 WMN을 위한 가상 도메인 기반의 반응형 라우팅 프로토콜)

  • Kim, Ho-Cheal
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.7
    • /
    • pp.59-70
    • /
    • 2014
  • This paper propose a new wireless multi-hop routing protocol that takes the hierarchical mesh of the hybrid WMN into account. WMN that is possible to provide various applications of wireless networks still has many open issues that should be solved despite the studies carried out over a decade. Especially, in routing protocol area, a problem degrading the routing efficiency by applying one of the routing protocols, which are designed for the MANET, to the hybrid WMN be solved above all. For the improvement of the routing performance, both good routing protocol and metric are essential. However, the recent studies are only concentrated in routing metric by use of the cross-layer design. Therefore, this paper is dedicated to the routing protocol that is essential for the performance of the routing but needed more studies. The proposed protocol in this paper is reactive, and designed to reorganize the hybrid WMN with several pseudo domains, and carry out domain-based route decision. By the simulation result for the performance analysis of the proposed protocol, the average delay for the route decision was decreased by 43% compared to AODV that is the typical reactive protocol.

An Energy-Efficient Protocol For Detecting Injurious Insect in Wireless Bio Sensor Networks (무선 바이오센서 네트워크에서 에너지 효율을 고려한 해충 감지 시스템을 구축하기 위한 프로토콜)

  • Yoo, Dae Hyun;Lee, Joo Sang;An, Beongku;Kim, Nam-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.2
    • /
    • pp.29-34
    • /
    • 2008
  • In this paper, we proposed a system protocol for detecting injurious insect to support energy saving transmission in wireless bio sensor networks. The main ideas and features of the system are as follows. First, the route establishment method which is based on the energy efficiency and stability by using time-division tree structure. Second, multi-hop direction-based data gatering structure. In this structure, the selected fading method is used to transmit packet via the established tree structure for supporting power saving and route lifetime efficiently. Finally, we can get the node power saving and reduce transmission delay, thus network lifetime and efficiency are improved. The performance evaluation of the proposed protocol is via OPNET(Optimized Network Engineering Tool).

  • PDF

Automatic Recovery Network Design for the Efficient Costs (효율적인 비용을 갖는 자동장애극복 네트워크의 설계방안)

  • Song, Myeong-Kyu
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.11
    • /
    • pp.5885-5889
    • /
    • 2013
  • In general, the network survivability means that The user do not know the network faults and the recovery of those. For this, we use the dual(multi) routes between each two nodes. It is important that the each dual routes have efficient costs(or minimum). Even if one route is the minimum cost in case of no fault, another route of dual may be very large cost in case of fault case. Therefore we need the dual routes of each two nodes having the efficient(or minimum) costs. In this paper we find the network design method for the dual routes of each two node having the efficient costs. Although the design method is very simple and heuristic and it may be not useful for some networks, we will use it in various network environment.. Because this design method can be used very easy. A sample design will proof this usefulness.