• Title/Summary/Keyword: Path setting system

Search Result 58, Processing Time 0.026 seconds

A Design of AMCS(Agricultural Machine Control System) for the Automatic Control of Smart Farms (스마트 팜의 자동 제어를 위한 AMCS(Agricultural Machine Control System) 설계)

  • Jeong, Yina;Lee, Byungkwan;Ahn, Heuihak
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.3
    • /
    • pp.201-210
    • /
    • 2019
  • This paper proposes the AMCS(Agricultural Machine Control System that distinguishes farms using satellite photos or drone photos of farms and controls the self-driving and operation of farm drones and tractors. The AMCS consists of the LSM(Local Server Module) which separates farm boundaries from sensor data and video image of drones and tractors, reads remote control commands from the main server, and then delivers remote control commands within the management area through the link with drones and tractor sprinklers and the PSM that sets a path for drones and tractors to move from the farm to the farm and to handle work at low cost and high efficiency inside the farm. As a result of AMCS performance analysis proposed in this paper, the PSM showed a performance improvement of about 100% over Dijkstra algorithm when setting the path from external starting point to the farm and a higher working efficiency about 13% than the existing path when setting the path inside the farm. Therefore, the PSM can control tractors and drones more efficiently than conventional methods.

THE METHOD FOR SETTING DESTINATION BASED ON IDENTIFIER OF MOVING OBJECT

  • Jang, In-Sung
    • Proceedings of the KSRS Conference
    • /
    • 2008.10a
    • /
    • pp.107-110
    • /
    • 2008
  • In this study, we propose a system for setting a Destination on CNS(Car Navigation System) or PNS(Personal Navigation System). The present Navigation does set the destination by only static method like name search, address search and wire telegraph telephone number search. But, the kind of setting a static destination does not reflect the dynamic moving situation. So we suggest setting the destination of navigation using Identifier of moving terminal. And it includes privacy protection on personal position information

  • PDF

Web3D Tour Path Setting-Method Using Spline Curve (스플라인 곡선을 이용한 Web3D 투어패스 설정 기법)

  • Song, Teuk-Seob
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.544-547
    • /
    • 2008
  • Navigation in 3D virtual environment(VE) is very difficult because the virtual environment is lack information than real 3D world. So navigation is import research subject in 3D VE. In this paper, we study tour path setting method using spline curve. The spline curve is augmented polynomial function. So the curve is differentiable. In particular, since the curves which are order of 2 and 3 are second order differentiable those are sufficiently smooth for using the computer graphics and CAD system.

  • PDF

Steering Characteristics of an Autonomous Tractor with Variable Distances to the Waypoint

  • Kim, Sang Cheol;Hong, Yeong Gi;Kim, Kook Hwan
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.2 no.2
    • /
    • pp.123-130
    • /
    • 2013
  • Autonomous agricultural machines that are operated in small-scale farmland frequently experience turning and changes in direction. Thus, unlike when they are operated in large-scale farmland, the steering control systems need to be controlled precisely so that travel errors can be minimized. This study aims to develop a control algorithm for improving the path tracking performance of a steering system by analyzing the effect of the setting of the waypoint, which serves as the reference point for steering when an autonomous agricultural machine moves along a path or a coordinate, on control errors. A simulation was performed by modeling a 26-hp tractor steering system and by applying the equations of motion of a tractor, with the use of a computer. Path tracking errors could be reduced using an algorithm which sets the waypoint for steering on a travel path depending on the radius of curvature of the path and which then controls the speed and steering angle of the vehicle, rather than by changing the steering speed or steering ratio which are dependent on mechanical performance.

Transfer Path Analysis of vibration and noise for medical air compressor using PAK system (PAK system 을 이용한 의료용 컴프레서의 진동.소음 전달경로 해석)

  • Kang, Kwi-Hyun;Kang, Jin-Chul;Park, Chun-Kwon;Lee, Jeong-Hwan;Oh, Jae-Eung
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2008.04a
    • /
    • pp.1000-1004
    • /
    • 2008
  • As performance of medical air compressor improve, the problem of noise increased. Noise is very important to medical air compressor because most of this installed inside of building. The main goal of this paper is show TPA (Transfer Path Analysis) result for contribution analysis using PAK system. Generally, the conventional TPA method consists of two steps. First, transfer functions between output sound and sources are measured by excitation experiment. Second, transferred sound in each transfer path is generated by multiplying the transfer function and the sound source signal. Then, if the output sound synthesized from all transferred sounds doesn't give good agreement with the measured output sound (i.e., the accuracies of the transfer functions are low), setting a suitable countermeasure guideline becomes difficult. For obtaining highly accurate transfer functions, eliminating correlations among transfer functions and noise included in the measured data are necessary. In the new method with PAK system, the vibration acceleration and sound signals around the sound sources and the output sound were measured simultaneously to obtain the transfer functions when compressor was operating. By applying PAK system, a highly accurate and efficient transfer path analysis method was developed that does not require an excitation experiment.

  • PDF

Obstacle Avoidance of GNSS Based AGVs Using Avoidance Vector (회피 벡터를 이용한 위성항법 기반 AGV의 장애물 회피)

  • Kang, Woo-Yong;Lee, Eun-Sung;Chun, Se-Bum;Heo, Moon-Beom;Nam, Gi-Wook
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.39 no.6
    • /
    • pp.535-542
    • /
    • 2011
  • The Global Navigation Satellite System(GNSS) is being utilized in numerous applications. The research for autonomous guided vehicles(AGVs) using precise positioning of GNSS is in progress. GNSS based AGVs is useful for setting driving path. This AGV system is more efficient than the previous one. Escipecially, the obstacle is positioned the driving path. Previcious AGVs which follow marker or wires laid out on the road have to stop the front of obstacle. But GNSS based AGVS can continuously drive using obstacle avoidance. In this paper, we developed collision avoidance system for GNSS based AGV using laser scanner and collision avoidance path setting algorithm. And we analyzed the developed system.

The Effects of Group Interaction on The Performance of Group Decision Making in A GDSS Environment (GDSS환경하에서 집단상호작용이 집단의사 결정의 성과에 미치는 영향)

  • Kim, Jae-Jeon
    • Asia pacific journal of information systems
    • /
    • v.6 no.1
    • /
    • pp.39-74
    • /
    • 1996
  • Most of the research on a group decision support system [GDSS] has focused on directly examining its effect on the decision outcomes. Under this research framework, however, the role of group interaction process is largely ignored. This study focuses on the effect of the group interaction process on decision-making performance when a GDSS is used as the only medium for group interaction. Specifically, this study sought to determine whether significant relationships exist between the quality of the decision and the decision functions, contingent phases, and different decision paths. Natural interaction processes of decision -making groups was simulated in an experimental setting in which volunteer subjects from several business classes were assigned to dispersed three-person groups undertook the experimental task via a decision network. A baseline GDSS was developed for this setting. The results of this study confirmed earlier studies in a non - GDSS setting to suggest significant effects of decision functions and contingent phases on the quality of decision but no significant relationship between decision path and the quality of group decision.

  • PDF

A Point-to-Point Shortest Path Search Algorithm in an Undirected Graph Using Minimum Spanning Tree (최소신장트리를 이용한 무방향 그래프의 점대점 최단경로 탐색 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.7
    • /
    • pp.103-111
    • /
    • 2014
  • This paper proposes a modified algorithm that improves on Dijkstra's algorithm by applying it to purely two-way traffic paths, given that a road where bi-directional traffic is made possible shall be considered as an undirected graph. Dijkstra's algorithm is the most generally utilized form of shortest-path search mechanism in GPS navigation system. However, it requires a large amount of memory for execution for it selects the shortest path by calculating distance between the starting node and every other node in a given directed graph. Dijkstra's algorithm, therefore, may occasionally fail to provide real-time information on the shortest path. To rectify the aforementioned shortcomings of Dijkstra's algorithm, the proposed algorithm creates conditions favorable to the undirected graph. It firstly selects the shortest path from all path vertices except for the starting and destination vertices. It later chooses all vertex-outgoing edges that coincide with the shortest path setting edges so as to simultaneously explore various vertices. When tested on 9 different undirected graphs, the proposed algorithm has not only successfully found the shortest path in all, but did so by reducing the time by 60% and requiring less memory.

The Empirical Test of System Model for Family Resource Management -Based on the Managerial Behaviors of Wives Living in Seoul- (가정관리체계모형의 실증적 검증 -서울시내 주부의 가사활동을 중심으로-)

  • 이연숙
    • Journal of the Korean Home Economics Association
    • /
    • v.30 no.1
    • /
    • pp.163-178
    • /
    • 1992
  • The purpose of this study was to test system model for family resources management developed by Deacon and Firebaugh. The data were collected by means of a questionnaire destributed to a stratified sample of 600 housewives living in Seoul. The questionnaires specially developed by the researchers contained of 118 items. the coefficient alpha reliability estimate for this instrument was conducted using Cronbach' procedures. The data were analyzed using frequency, percentile, mean, step wise multiple regression and path analysis. The results of path analysis showed that the level of the elements of satisfaction with the management was correlated with demands(the household size, the age of the last child, employment status of respondents), resources(marital satisfaction, health of respondents), and throughput(standard setting, reality in planning, the existence of facilitating conditions). A system model for family resource management received considerabel empirical support. This presumed that the components of demands lead to the lower satisfaction with management. The throughput components were also important in explaining satisfaction with management some of research and methodology issues for the advanced study were suggested.

  • PDF

Multiple Path-Finding Algorithm in the Centralized Traffic Information System (중앙집중형 도로교통정보시스템에서 다중경로탐색 알고리즘)

  • 김태진;한민흥
    • Journal of Korean Society of Transportation
    • /
    • v.19 no.6
    • /
    • pp.183-194
    • /
    • 2001
  • The centralized traffic information system is to gather and analyze real-time traffic information, to receive traffic information request from user, and to send user processed traffic information such as a path finding. Position information, result of destination search, and other information. In the centralized traffic information system, a server received path-finding requests from many clients and must process clients requests in time. The algorithm of multiple path-finding is needed for a server to process clients request, effectively in time. For this reason, this paper presents a heuristic algorithm that decreases time to compute path-finding requests. This heuristic algorithm uses results of the neighbor nodes shortest path-finding that are computed periodically. Path-finding results of this multiple path finding algorithm to use results of neighbor nodes shortest path-finding are the same as a real optimal path in many cases, and are a little different from results of a real optimal path in non-optimal path. This algorithm is efficiently applied to the general topology and the hierarchical topology such as traffic network. The computation time of a path-finding request that uses results of a neighbor nodes shortest path-finding is 50 times faster than other algorithms such as one-to-one label-setting and label-correcting algorithms. Especially in non-optimal path, the average error rate is under 0.1 percent.

  • PDF