• Journal of the Korea Institute of Military Science and Technology
• /
• v.21 no.6
• /
• pp.842-849
• /
• 2018

This research suggests the development of simulator for a Simulation Test of a moving object's path generation and following. There are many kinds of moving objects in weapon systems, such as vehicles, missiles, robots and so on. So need tests of moving simulations during development process of weapon systems. To simulate a moving object, need an flexible path. So this report suggests a $B\acute{e}zier$ curve algorithm for generation of smooth curve path. And when new developments of weapon systems are started, many kinds of simulators are created. But, these simulators are not reused in other project because there are different kinds of development environment. So need to allow users to add specific features, And this report suggests using Dynamic Link Library(DLL).

• Journal of Multimedia Information System
• /
• v.4 no.1
• /
• pp.9-18
• /
• 2017

Ubiquitous computing is a novel paradigm that is rapidly gaining in the scenario of wireless communications and telecommunications for realizing smart world. As rapid development of sensor technology, smart sensor system becomes more popular in automobile or vehicle. In this study, a new vehicle detection mechanism in real-time for blind spot area is proposed based on imaging sensors. To determine the position of other vehicles on the road is important for operation of driver assistance systems (DASs) to increase driving safety. As the result, blind spot detection of vehicles is addressed using an automobile detection algorithm for blind spots. The proposed vehicle verification utilizes the height and angle of a rear-looking vehicle mounted camera. Candidate vehicle information is extracted using adaptive shadow detection based on brightness values of an image of a vehicle area. The vehicle is verified using a training set with Haar-like features of candidate vehicles. Using these processes, moving vehicles can be detected in blind spots. The detection ratio of true vehicles was 91.1% in blind spots based on various experimental results.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.2
• /
• pp.9-16
• /
• 2022

The nodes constituting the vehicle ad hoc network (VANET) are vehicles moving along the road and road side units (RSUs) installed around the road. The vehicle ad hoc network is used to collect the status, speed, and location information of vehicles driving on the road, and to communicate with vehicles, vehicles, and RSUs. Today, as the number of vehicles continues to increase, urban roads are suffering from traffic jams, which cause various problems such as time, fuel, and the environment. In this paper, we propose a method to solve traffic congestion problems on urban roads and demonstrate that the method can be applied to solve traffic congestion problems through performance evaluation using two typical protocols of vehicle ad hoc networks, AODV and GPSR. The performance evaluation used ns-2 simulator, and the average number of traffic jams and the waiting time due to the average traffic congestion were measured. Through this, we demonstrate that the vehicle ad hoc-based traffic congestion management technique proposed in this paper can be applied to urban roads in smart cities.

• Journal of information and communication convergence engineering
• /
• v.13 no.3
• /
• pp.197-204
• /
• 2015

In this paper, we present an algorithm for the detection of illegally parked vehicles based on a combination of some image processing algorithms. A digital camera is fixed in the illegal parking region to capture the video frames. An adaptive Gaussian mixture model (GMM) is used for background subtraction in a complex environment to identify the regions of moving objects in our test video. Stationary objects are detected by using the pixel-level features in time sequences. A stationary vehicle is detected by using the local features of the object, and thus, information about illegally parked vehicles is successfully obtained. An automatic alarm system can be utilized according to the different regulations of different illegal parking regions. The results of this study obtained using a test video sequence of a real-time traffic scene show that the proposed method is effective.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.11a
• /
• pp.123-127
• /
• 2004

Nowadays it is necessary to manage the road system effectively because of the explosive increment of vehicles and goods. To resolve this problems through the fast upgrade of information about position and time of moving vehicles, the combined navigation system using GPS(Global Positioning System) and complementary navigation system, i.e. INS(Inertial Navigation System), DR(Dead Rocking), etc. has been used. Although GPS is popular for the vehicles in the urban canyon because of its few satellites. In this paper, position tracking algorithm is presented, which reduces vehicle position error dramatically by fusing GPS and INS sensors. And the validity of our algorithm is demonstrated by the experimental results with the real car.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2009.06a
• /
• pp.149-150
• /
• 2009

The problem of vehicle routing problem(VRP) with pair operations of pick up and delivery are well-known in real applications in logistics networks, as in planning the routes for automatic guided vehicles(AGVs) in an automatic container terminal(ACT), warehouses or in some just-in-time services. This paper will present a formulation to modeling the problem mathematically which can be used to generate optimal routes of carried vehicles in the field to reduce the incurred cost of moving goods. This selected model could be used in (semi-)automatic short-term planning systems for vehicle fleet working in ACT, or in modern warehouses which the long list of requests is parted and sorted in preprocessing orders systems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.14 no.23
• /
• pp.47-55
• /
• 1991

In automated assembly line, an automatic guided vehicle system(AGVS) represents a mire versatile means of moving materials automatically. In this paper, the vehicles not only provide the transportation medium between workstations but also as mobile workstations. The objective for the developed model is the determination of the appropriate time to control AGV based assembly line in order to minimize production makespan while maximizing the efficient use of vehicles. In this paper, we consider the finished goods of two types which are produced in assembly line. The assembly line is considered with and without queue. Because no buffer are present in case 1. this model seeks to determine the point in time at which vehicles should be launched in the assembly line without experiencing a delay. The case 2 model also seek to determine the vehicle launch times while minimizing production makespan. The assumption in this model is that the maximum queue size cannot exceed 1 at any time.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.3
• /
• pp.19-27
• /
• 2019

This paper proposes a new method using multi-layer overlapped windows to improve the performance of YOLO network which is vulnerable to detect small dense objects. In particular, the proposed method uses the YOLO Network based on the multi-layer overlapped windows to track small dense vehicles that approach from long distances. The method improves the detection performance for location and size of small vehicles. It allows crossing area of two multi-layer overlapped windows to track moving vehicles from a long distance to a short distance. And the YOLO network is optimized so that GPU computation time due to multi-layer overlapped windows should be reduced. The superiority of the proposed algorithm has been proved through various experiments using captured images from road surveillance cameras.

• Journal of the Korean Regional Science Association
• /
• v.6 no.1
• /
• pp.57-68
• /
• 1990

The purpose of this study is to develop the models to predict the noise PCE (Passenger Car Equivalence) of large running vehicles through noise prediction models. The noises were measured at the distance of 7.5M, 11.0M, and 14.5M from the noise source with test vehicles running at the speed of 40 Km/h, 60 Km/h, and 80 Km/h while normal traffic were detoured. Total noise levels were measured while vehicles were running at given speeds, Engine noise level was considered as the noise of its idle running at the three vehicle speeds shown above friction noise level was ascertained by moving the vehicle at given speeds without the engin operating. The noise prediction models for each noise source were developed by factors which affect to the each noise level. As a result of this paper, the reduction of total vehicle noise by increasing the distance to the noise source from 10 M to 15 M is as much as that by dropping its speed from 60 Km/h to 40 Km/h. Also, the reduction of PCE of total noise of large vehicle by making the noise source to that by reducing its speed from 80 Km/h to 60 Km/h. Enging noise PCE, which is in range between 65 and 160, is larger than friction noise PCE which is in range 3.5 and 5.5. Engin noise is the main noise of the large vehicles while friction noise is that of the small vehicles. Machine noise for large vehicles, and engin noise for small vehicles should be tightly controlled to reduce the vehicle noise. A low noise engine and tire, and the shape of vehicle body are needed to be developed to reduce noise further.

• Journal of Korea Game Society
• /
• v.13 no.3
• /
• pp.47-54
• /
• 2013

In general, algorithms to find continuous k-nearest neighbors has been researched on the location based services monitoring periodically the moving objects such as vehicles and mobile phone. Those researches assume the environment that the number of query points is much less than that of moving objects and the query points are not moved but fixed. In gaming environments, cases to find k-nearest neighbors are when computing the next movement considering the neighbors such as flocking, crowd and robot simulations. Thus, every moving object becomes a query point so that the number of query point is same to that of moving objects and the query points are also moving. In this paper, we analyze the performance of the existing algorithms focused on location based services how they operate under the gaming environments.