• Title/Summary/Keyword: Route Location

Search Result 408, Processing Time 0.02 seconds

OPTIMAL ROUTE DETERMINATION TECHNOLOGY BASED ON TRAJECTORY QUERYING MOVING OBJECT DATABASE

  • Min Kyoung-Wook;Kim Ju-Wan;Park Jong-Hyun
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.317-320
    • /
    • 2005
  • The LBS (Location-Based Services) are valuable information services combined the location of moving object with various contents such as map, POI (point of Interest), route and so on. The must general service of LBS is route determination service and its applicable parts are FMS (Fleet Management System), travel advisory system and mobile navigation system. The core function of route determination service is determination of optimal route from source to destination in various environments. The MODB (Moving Object Database) system, core part of LBS composition systems, is able to manage current or past location information of moving object and massive trajectory information stored in MODB is value-added data in CRM, ERP and data mining part. Also this past trajectory information can be helpful to determine optimal route. In this paper, we suggest methods to determine optimal route by querying past trajectory information in MODB system and verify the effectiveness of suggested method.

  • PDF

Application of GIS Based AHP for Route Location (노선 선정에서 계층분석과정을 이용한 GIS의 적용)

  • Roh, Tae Ho;Jeong, In Ju;Lee, Sung Rock
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.8 no.2
    • /
    • pp.55-67
    • /
    • 2005
  • This study presented the route location method by applying AHP and evaluating quantitatively. This study developed the program that can be easily applied to this kind of road design, and built the decision support system for route location. The study results are summarized as follows ; We could quantitatively evaluate the appropriateness of exiting routes by applying the AHP based on GIS. If we apply this to the roads that will be newly constructed, we can make the objective and reliable route location when making road plans and basic designs. We improved the technique of route location by applying the decision support system with third-dimensional data, which considers even the vertical alignment plan, to the existing decision support system with second-dimensional data. And, since we can set those data such as vertical slope, earth-volume, structure size, location and construction cost to independent variables, we can make road designs more scientifically and reasonably.

  • PDF

A Study on Route Location Using Decision Support System (의사결정체계를 이용한 노선 선정에 관한 연구)

  • Seo Dong Ju;Lee Jong Chool;Roh Tae Ho
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.23 no.2
    • /
    • pp.117-128
    • /
    • 2005
  • This study presented the route location method by applying AHP and evaluating quantitatively. This study developed the program that can be easily applied to this kind of road design, and built the decision support system fur route location. The study results are summarized as follows : We could quantitatively evaluate the appropriateness of exiting routes by applying the AHP based on GIS. If we apply this to the roads that will be newly constructed, we can make the objective and reliable route location when making road plans and basic designs. We improved the technique of route location by applying the decision support system with third-dimensional data, which considers even the vertical alignment plan, to the existing decision support system with second-dimensional data. had, since we call set those data such as vertical slope, earth-volume, structure size, location and construction cost to independent variables, we can make road designs more scientifically and reasonably.

ARM: Anticipated Route Maintenance Scheme in Location-Aided Mobile Ad Hoc Networks

  • Park Seungjin;Yoo Seong-Moo;Al-Shurman Mohammad;VanVoorst Brian;Jo Chang-Hyun
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.325-336
    • /
    • 2005
  • Mobile ad hoc networks (MANET) are composed of moving wireless hosts which, within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. In this paper, we propose anticipated route maintenance (ARM) protocol with two extensions to route discovery based routing scheme: Extend the route when nodes on a link move apart from each other and they have common neighbor that can be 'inserted' in the path, and shrink route when a node discovers that one of its neighbor which is not the next hop is also on the same route several hops later on. By utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. As the density of nodes increases, the chance to successfully utilize our route maintenance approach increases, and so does the savings. We have compared the performance of two protocols, pure dynamic source routing (DSR) protocol and DSR with ARM. The simulation results show how ARM improves the functionality of DSR by preventing the links in the route from breaking. Packets delivery ratio could be increased using ARM and achieved approximately $\100%$ improvement. The simulations clarify also how ARM shows a noticeable improvement in dropped packets and links stability over DSR, even though there is more traffic and channel overhead in ARM.

A Location-Aided Cooperative Transmission Method in Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크에서 위치도움 협력 전송 방법)

  • Son, Dong-Hwan;Lee, Joo-Sang;An, Beongku;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.2
    • /
    • pp.23-28
    • /
    • 2008
  • In this paper, we propose location-aided cooperative routing protocol (LACARP) for supporting power saving and stable route lifetime in mobile ad-hoc wireless sensor networks. The main ideas and features of the proposed routing protocol are as follows. First, the definition of the area of route search using location-based information to support power saving transmission. Second, the expect zone-based establishment of routing route within the area of route search. Third, the cooperative-aided transmission method. In the operation of data transmission over the established rout the datas are transmitted via both the established route and cooperative route aided by neighbor nodes. The performance evaluation using OPNET(Optimized Network Engineering Tool) shows the LACARP can improve the packet delivery ratio and power saving transmission efficiently.

  • PDF

Design and Implementation of Optimized Route Search Technique based on User Experience Using Open APIs (지도 오픈 API를 활용한 사용자 경험 기반 최적화 이동 경로 탐색 기법의 설계와 구현)

  • Sagong, Woon
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.5
    • /
    • pp.682-690
    • /
    • 2015
  • Among location-based systems, a route search service is very highly utilized as a representative technique, but it provides relatively low accuracy when we find a route path on foot in our real environment. In this paper, we design and implement an optimized route search technique based on user experience utilizing open APIs as location-based services. Finally, we develop an Android-based application to provide this feature. In our experiment, we found that our technique enhanced performance by about 14-36% compared to previous solutions, such as route path searches using map APIs. In addition, the performance of our technique can be further enhanced, as the number of users who find such optimized route path is increasing.

Study on the Acupoint Location of Kyoshin (KI8) (교신(KI8)혈 혈위에 관한 연구)

  • Park, Sang Kyun
    • Korean Journal of Acupuncture
    • /
    • v.37 no.4
    • /
    • pp.245-252
    • /
    • 2020
  • Objectives : The objective of this study was to examine the acupoint location of Kyoshin (KI8) from classic literatures. Methods : A review of KI8 location along the meridian route from 18 classics of acupuncture and moxibustion - 『Huangdineijing·Lingshu』, 『Huangdimingtangjingjixiao』, 『Zhenjiujiayijing』, 『Huangdineijingtaisu』, 『Huangdimingtangjiujing』, 『Beijiqianjinyaofang』, 『Waitaimiyaofang』, 『Ishimpo』, 『Taipingshenghuifang』, 『Tongrenshuxuezhenjiutujing』, 『Shengjizonglu』, 『Zhenjiuzishengjing』, 『Shisijingfahui』, 『Shenyingjing』, 『Zhenjiujuying』, 『Yixuerumen』, 『Zhenjiudacheng』, and 『Yizongjinjian』 - was performed. Then, KI7 location on classics and current standard KI8 location were compared. Results : Based on modern standard acupoint location system, the acupoint of KI8 is located on the medial aspect of the leg, in the depression posterior to the medial border of the tibia and it is on the route of spleen meridian. But no classics of acupuncture and moxibustion said KI8 was located on the route of spleen meridian. In addition, KI8 location on classics was largely described as being located in front of KI7, but only in 『Yizongjinjian』 was it written that KI8 was located posterior to KI7. Conclusions : Through a classic literature review, it is possible to explain that KI8 is located posterior to spleen meridian. The acupoint of KI8 seems to be located between medial border of flexor pollicis longus and flexor digitorum longus based on anatomical location.

PROJECTION OF TRAJECTORY FOR SUPPORTING UNCERTAINTY FUTURE TIME OF MOVING OBJECT

  • Won Ho-Gyeong;Jung Young Jin;Lee Yang Koo;Park Mi;Kim Hak-cheol;Ryu Keun Ho
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.72-75
    • /
    • 2005
  • Uncertainty of objects in Moving Object Database is a coherent property. It has been discussed in a lot of researches on modelling and query processing. The previous studies assume that uncertain future time is determined through utilizing recent speed and direction of vehicles. This method is simple and useful for estimating the time of the near future location. However, it is not appropriate when we estimate the time of the far future location. Therefore, in this paper, we propose a concept of planned route. It is used to estimate uncertain future time, which has to be located at a given point. If the route of an object is planned beforehand its locations are uncertainly distributed near that route. By a simple projection operation, the probability that a location lies in the planned route is increased. Moreover, we identify the future time of an object based on the speed for passing the route, which is offered via a website.

  • PDF

Routing Service Implementation using a Dual Graph (듀얼 그래프를 이용한 라우팅 서비스 구현)

  • 김성수;허태욱;박종현;이종훈
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.171-174
    • /
    • 2003
  • Shortest path problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is the route determination service, where various kinds of shortest path problems need to be solved in location-based service. Our research aim is to propose a route technique in real-time location-based service (LBS) environments according to user's route preferences such as shortest, fastest, easiest and so on. Turn costs modeling and computation are important procedures in route planning. We propose a new rest modeling method for turn costs which are traditionally attached to edges in a graph. Our proposed route determination technique also has an advantage that can provide service interoperability by implementing XML web service for the OpenLS route determination service specification.

  • PDF

Continuous Location Tracking Algorithm for Moving Position Data

  • Ahn, Yoon-Ae
    • Journal of the Korean Data and Information Science Society
    • /
    • v.19 no.3
    • /
    • pp.979-994
    • /
    • 2008
  • Moving objects are spatio-temporal data that change their location or shape continuously over time. Generally, if continuously moving objects are managed by a conventional database management system, the system cannot properly process the past and future location which is not stored in the database. Up to now, for the purpose of location tracking which is not stored, the linear interpolation to estimate the past location has been usually used. It is suitable for the moving objects on linear route, not curved route. In this paper, we propose a past location tracking algorithm for a moving object on curved routes, and also suggest a future location tracking algorithm using some past location information. We found that the proposed location tracking algorithm has higher accuracy than the linear interpolation function.

  • PDF