• Title/Summary/Keyword: Travel application design

Search Result 53, Processing Time 0.023 seconds

Development and Application of Penetration Type Field Shear Wave Apparatus (관입형 현장 전단파 측정장치의 개발 및 적용)

  • Lee, Jong-Sub;Lee, Chang-Ho;Yoon, Hyung-Koo;Lee, Woo-Jin;Kim, Hyung-Sub
    • Journal of the Korean Geotechnical Society
    • /
    • v.22 no.12
    • /
    • pp.67-76
    • /
    • 2006
  • The reasonable assessment of the shear stiffness of a dredged soft ground and soft clay is difficult due to the soil disturbance. This study addresses the development and application of a new in-situ shear wave measuring apparatus (field velocity probe: FVP), which overcomes several of the limitations of conventional methods. Design concerns of this new apparatus include the disturbance of soils, cross-talking between transducers, electromagnetic coupling between cables, self acoustic insulation, the constant travel distance of S-wave, the rotation of the transducer, directly transmitted wave through a frame from transducer to transducer, and protection of the transducer and the cable. These concerns are effectively eliminated by continuous improvements through performing field and laboratory tests. The shear wave velocity of the FVP is simply calculated, without any inversion process, by using the travel distance and the first arrival time. The developed FVP Is tested in soil up to 30m in depth. The experimental results show that the FVP can produce every detailed shear wave velocity profiles in sand and clay layers. In addition, the shear wave velocity at the tested site correlates well with the cone tip resistance. This study suggests that the FVP may be an effective technique for measuring the shear wave velocity in the field to assess dynamic soil properties in soft ground.

Application of 3-D Laser Scanner for the Measurement of Slope Displacement (사면 변형 측정을 위한 3차원 레이저 스캐너의 적용)

  • Oh, Seok-Hoon;Suh, Baek-Soo
    • Journal of the Korean earth science society
    • /
    • v.31 no.6
    • /
    • pp.555-562
    • /
    • 2010
  • Three-dimensional laser scanner was used to accurately measure any possible strain on a slope under pertaining stress with the time difference of 7 months. The laser scanner has the ability to measure the 3-D coordinate of a target point by calculating the travel time of laser beam between the laser device and the target point, and has been proved to be effective for analysis of the displacement of slopes or large construction. The scanning data measured with time difference were analyzed to find any strain by approaches of plane angle change, curvature variation, twist of frame, displacement of merging point, etc. From the analysis, some weak points showing heavily distorted shape were detected, which was used to design the reinforcement.

Tool path planning of hole-making operations in ejector plate of injection mould using modified shuffled frog leaping algorithm

  • Dalavi, Amol M.;Pawar, Padmakar J.;Singh, Tejinder Paul
    • Journal of Computational Design and Engineering
    • /
    • v.3 no.3
    • /
    • pp.266-273
    • /
    • 2016
  • Optimization of hole-making operations in manufacturing industry plays a vital role. Tool travel and tool switch planning are the two major issues in hole-making operations. Many industrial applications such as moulds, dies, engine block, automotive parts etc. requires machining of large number of holes. Large number of machining operations like drilling, enlargement or tapping/reaming are required to achieve the final size of individual hole, which gives rise to number of possible sequences to complete hole-making operations on the part depending upon the location of hole and tool sequence to be followed. It is necessary to find the optimal sequence of operations which minimizes the total processing cost of hole-making operations. In this work, therefore an attempt is made to reduce the total processing cost of hole-making operations by applying relatively new optimization algorithms known as shuffled frog leaping algorithm and proposed modified shuffled frog leaping algorithm for the determination of optimal sequence of hole-making operations. An industrial application example of ejector plate of injection mould is considered in this work to demonstrate the proposed approach. The obtained results by the shuffled frog leaping algorithm and proposed modified shuffled frog leaping algorithm are compared with each other. It is seen from the obtained results that the results of proposed modified shuffled frog leaping algorithm are superior to those obtained using shuffled frog leaping algorithm.

A Multi-modal Continuous Network Design Model by Using Cooperative Game Approach (협력적 게임을 이용한 다수단 연속형 교통망 설계 모형)

  • Kim, Byeong-Gwan;Lee, Yeong-In;Im, Yong-Taek;Im, Gang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.29 no.1
    • /
    • pp.81-93
    • /
    • 2011
  • This research deals with the multi-modal continuous network design problem to resolve the transportation policy problems for constructing and operating transportation facilities with considering the mutual decision-making process between transportation operator and user in the multi-modal network. Particularly, in the consideration of changes in travel pattern between transport modes due to the changes in transportation policy, road network for passenger car and transit network for public transportation are considered together. In the development of network design model, more rational Stackelberg equilibrium(cooperative game) rather than more general Nash equilibrium(non-cooperative game) approach is used and sensitivity analysis considering transport mode is used. A multi-modal continuous network design model in this study is developed for the arbitrary continuous network design parameters(${\epsilon},\hat{\epsilon},p$) of transportation policy decisions. As examples of application and evaluation for these design parameters, the developed model is applied to calculate 1)the optimal capacity of road link in the road transport policy, 2)the optimal frequency of transit line in public transport policy and 3)the optimal modal split in transport modal share policy.

Integrating Ant Colony Clustering Method to a Multi-Robot System Using Mobile Agents

  • Kambayashi, Yasushi;Ugajin, Masataka;Sato, Osamu;Tsujimura, Yasuhiro;Yamachi, Hidemi;Takimoto, Munehiro;Yamamoto, Hisashi
    • Industrial Engineering and Management Systems
    • /
    • v.8 no.3
    • /
    • pp.181-193
    • /
    • 2009
  • This paper presents a framework for controlling mobile multiple robots connected by communication networks. This framework provides novel methods to control coordinated systems using mobile agents. The combination of the mobile agent and mobile multiple robots opens a new horizon of efficient use of mobile robot resources. Instead of physical movement of multiple robots, mobile software agents can migrate from one robot to another so that they can minimize energy consumption in aggregation. The imaginary application is making "carts," such as found in large airports, intelligent. Travelers pick up carts at designated points but leave them arbitrary places. It is a considerable task to re-collect them. It is, therefore, desirable that intelligent carts (intelligent robots) draw themselves together automatically. Simple implementation may be making each cart has a designated assembly point, and when they are free, automatically return to those points. It is easy to implement, but some carts have to travel very long way back to their own assembly point, even though it is located close to some other assembly points. It consumes too much unnecessary energy so that the carts have to have expensive batteries. In order to ameliorate the situation, we employ mobile software agents to locate robots scattered in a field, e.g. an airport, and make them autonomously determine their moving behaviors by using a clustering algorithm based on the Ant Colony Optimization (ACO). ACO is the swarm intelligence-based methods, and a multi-agent system that exploit artificial stigmergy for the solution of combinatorial optimization problems. Preliminary experiments have provided a favorable result. In this paper, we focus on the implementation of the controlling mechanism of the multi-robots using the mobile agents.

Development of a Banner Advertisement System based on Geographic Information (지리정보 기반의 배너광고 시스템 개발)

  • Kwon, Jae-Hyuk;Kim, Dong-Soo
    • The Journal of Society for e-Business Studies
    • /
    • v.14 no.2
    • /
    • pp.117-130
    • /
    • 2009
  • Lots of applications that represent and utilize geographic information on the Web have emerged on the Web. In addition, personal electronic devices equipped with GPS function, which can record personal location information in real time, are being increasingly adopted by people. Such geographic information enables Internet business companies to provide users more useful services based on the location information. Most successful Internet business companies have adopted and utilized Web 2.0 technologies, which promote users' participation and emphasize openness and information sharing. Especially, using open APIs (Application Programming Interfaces) can reduce the costs of a program development. In this study, we design and develop a banner advertisement system based on geographic information using open APIs. We propose a business model using the advertisement system, and a prototype system has been illustrated in order to explain the proposed business model. Finally, we summarize the benefits of our system by describing factors generating values of the proposed business model. Hopefully, main ideas proposed in this paper can be applied to real industry sectors that use geographic information widely such as travel, real estate and so on.

  • PDF

Measuring the Connectivity of Nodes in Road Networks (도로 네트워크의 노드 연계성 산정에 관한 연구)

  • Park, Jun-Sik;Gang, Seong-Cheol
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.4
    • /
    • pp.129-139
    • /
    • 2010
  • This study proposes a model for measuring the connectivity of nodes in road networks. The connectivity index between two nodes is characterized by the number of routes, degree of circuitousness, design speed, and route capacity between the nodes. The connectivity index of a node is then defined as the weighted average of the connectivity indexes between the node and other nodes under consideration. The weighting factor between two nodes is determined by the travel demand and distance between them. The application of the model to a toy network shows that it reasonably well quantifies the level of connectivity of nodes in the network. If flow of rail networks can be measured in the same scale as that of road networks and the capacity of rail links can be estimated, the model proposed in this paper could be applied to intermodal transportation networks as well.

Design of complex IPS system to improve positioning accuracy (측위 정확도 향상을 위한 복합 IPS 시스템 설계)

  • Lee, Hyoun-sup;Kim, Jin-deog
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.10
    • /
    • pp.1917-1922
    • /
    • 2017
  • WPS(Wifi Positioning System) conducts positioning using wireless signals scattered in real world. This process is divided into two stages: Construction Stage that collects information on wireless signals for determining location and constructs a radio map and Positioning Stage that compares the constructed information with the collected information on wireless signals. WPS lowers the accuracy of positioning if changes occur to the collected signals during positioning. PDR have recently been studied. IPS is a system designed to find out the final destination by analyzing pedestrian's no. of gait, travel range, and direction through inertial sensors. If the positioning results of WPS appear in more than two locations, it can be thought as the problem of positioning accuracy. In some cases, problems occur. In this respect, this study analyzes the situations in which the problem as mentioned above occurs and proposes a system to solve this problem through PDR.

Multi-day Trip Planning System with Collaborative Recommendation (협업적 추천 기반의 여행 계획 시스템)

  • Aprilia, Priska;Oh, Kyeong-Jin;Hong, Myung-Duk;Ga, Myeong-Hyeon;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.1
    • /
    • pp.159-185
    • /
    • 2016
  • Planning a multi-day trip is a complex, yet time-consuming task. It usually starts with selecting a list of points of interest (POIs) worth visiting and then arranging them into an itinerary, taking into consideration various constraints and preferences. When choosing POIs to visit, one might ask friends to suggest them, search for information on the Web, or seek advice from travel agents; however, those options have their limitations. First, the knowledge of friends is limited to the places they have visited. Second, the tourism information on the internet may be vast, but at the same time, might cause one to invest a lot of time reading and filtering the information. Lastly, travel agents might be biased towards providers of certain travel products when suggesting itineraries. In recent years, many researchers have tried to deal with the huge amount of tourism information available on the internet. They explored the wisdom of the crowd through overwhelming images shared by people on social media sites. Furthermore, trip planning problems are usually formulated as 'Tourist Trip Design Problems', and are solved using various search algorithms with heuristics. Various recommendation systems with various techniques have been set up to cope with the overwhelming tourism information available on the internet. Prediction models of recommendation systems are typically built using a large dataset. However, sometimes such a dataset is not always available. For other models, especially those that require input from people, human computation has emerged as a powerful and inexpensive approach. This study proposes CYTRIP (Crowdsource Your TRIP), a multi-day trip itinerary planning system that draws on the collective intelligence of contributors in recommending POIs. In order to enable the crowd to collaboratively recommend POIs to users, CYTRIP provides a shared workspace. In the shared workspace, the crowd can recommend as many POIs to as many requesters as they can, and they can also vote on the POIs recommended by other people when they find them interesting. In CYTRIP, anyone can make a contribution by recommending POIs to requesters based on requesters' specified preferences. CYTRIP takes input on the recommended POIs to build a multi-day trip itinerary taking into account the user's preferences, the various time constraints, and the locations. The input then becomes a multi-day trip planning problem that is formulated in Planning Domain Definition Language 3 (PDDL3). A sequence of actions formulated in a domain file is used to achieve the goals in the planning problem, which are the recommended POIs to be visited. The multi-day trip planning problem is a highly constrained problem. Sometimes, it is not feasible to visit all the recommended POIs with the limited resources available, such as the time the user can spend. In order to cope with an unachievable goal that can result in no solution for the other goals, CYTRIP selects a set of feasible POIs prior to the planning process. The planning problem is created for the selected POIs and fed into the planner. The solution returned by the planner is then parsed into a multi-day trip itinerary and displayed to the user on a map. The proposed system is implemented as a web-based application built using PHP on a CodeIgniter Web Framework. In order to evaluate the proposed system, an online experiment was conducted. From the online experiment, results show that with the help of the contributors, CYTRIP can plan and generate a multi-day trip itinerary that is tailored to the users' preferences and bound by their constraints, such as location or time constraints. The contributors also find that CYTRIP is a useful tool for collecting POIs from the crowd and planning a multi-day trip.

A study on the wire reduction design and effect analysis for the train vehicle line (화물열차 분산제어시스템 개발에 관한 연구)

  • Lee, Kangmi;Lee, Jaeho;Yoon, Yong-Ki
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.12
    • /
    • pp.778-784
    • /
    • 2017
  • In this paper, we propose wired and wireless distributed control systems designed to improve the freight logistics efficiency and verify wired distributed control systems. The verification condition required that 50 cargo vehicles be connected and operated to travel 21 km from Busan Sinhang station to Jinlye Station at an average speed of about 100km/h. The verification results show that the traction output and braking output of the control and controlled cars are dispersed by the wired distributed control system. The application is expected to more than double the efficiency of the logistics compared to the existing freight transportation system. However, in the case of the wired distributed control system, cable installation and maintenance are difficult, and it is impossible to change the combination of freight vehicles. Through the verification of the wired distributed control system, the applicability of distributed control systems to freight vehicles in Korea was confirmed and the system was further developed to produce a wireless distributed control system. In order to apply the wireless distributed control system, a propagation environment analysis for the ISM band was performed in the testbed and, as a result, it was confirmed that Wifi technology using the ISM band could be utilized. In order to use the WDP (Wireless Distributed Power) devices newly installed in the target vehicles, the transmission / reception control signals associated with the propulsion / braking / total control devices are defined. In the case of wireless distributed control systems, the convenience of their application and operation is guaranteed, but reliability and emergency safety measures should because of the dependence of the control of the vehicle on radio signals.