• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.2
• /
• pp.65-71
• /
• 2018

In order to make the underwater vehicle carry out the mission in a submarine environment, it is needed to plan a safe and efficient route to a given destination and prevent the autonomous submersible from colliding with obstacles while moving along the planned route. The function of collision avoidance makes the travel distance of the autonomous submersible longer. Moreover, it should move slowly near to obstacles against their moving disturbance. As a result, this invokes the degradation of the navigation efficiency in the process of collision avoidance. The side effect of the collision avoidance is not ignorable in the case of high congested environments such as the coast with many obstacles. In this paper, we suggest a path planning method which provides the route with minimum travel time considering collision avoidance in congested environment. For the purpose, we define environmental congestion map related to geometric information and obstacles. And we propose a method to consider the moving cost in the RRT scheme that provides the existing minimum distance path. We verified that the efficiency of our algorithm with simulation experiments.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.120.4-120
• /
• 2001

In this paper, a method of generating trajectories in real time for a mobile robot in a dynamic environment is proposed. Specifically, this method is focused on soccer-playing robots that need to calculate trajectories in real time, which are constantly subject to rapidly change as targets and obstacles move. The robots also should move at the fastest available speed, while tracking the generated trajectories. The method proposed in this paper solves the geometric problem of finding a smooth curve that joins two endpoints. To have this solved, we assign five constraints to each endpoint, which are the usual x, y, theta, and curvature as well as the influence of the initial robot velocity on the path. With these five constraints, the path generated can always be physically followed by robot. Through this method, the travel time of the robot over the entire path can b optimized. Therefore it can ...

• Journal of the Korea Convergence Society
• /
• v.10 no.9
• /
• pp.17-22
• /
• 2019

Gentry, an SMT equipment, is a device that absorbs electronic components from the feeder and mounts them correctly on the PCB. At this time, the gantry stops in front of the camera to check whether the parts are correctly adsorbed. In this paper, we propose a method to shorten the moving time by moving the gantry without stopping in front of the camera. This method shows that the moving time is shorter than that of the conventional method by finding a path that can be moved in the fastest time among the various moving paths. The proposed method (moving-motion) reduces the gantry travel time by 20% compared to the conventional method (stop-motion).

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.607-613
• /
• 2011

This paper reviews search methods of multiple reasonable paths to implement multimodal public transportation network of Seoul. Such a large scale multimodal public transportation network as Seoul, the computation time of path finding algorithm is a key and the result of path should reflect route choice behavior of public transportation passengers. Search method of alternative path is divided by removing path method and deviation path method. It analyzes previous researches based on the complexity of algorithm for large-scale network. Applying path finding algorithm in public transportation network, transfer and loop constraints must be included to be able to reflect real behavior. It constructs the generalized cost function based on the smart card data to reflect travel behavior of public transportation. To validate the availability of algorithm, experiments conducted with Seoul metropolitan public multimodal transportation network consisted with 22,109 nodes and 215,859 links by using the deviation path method, suitable for large-scale network.

• Transactions on Electrical and Electronic Materials
• /
• v.7 no.5
• /
• pp.252-256
• /
• 2006

When a partial discharge takes place at the stator of a generator, the electrical pulse will propagate along the stator bars and the capacitor chains formed by the end part of the stator winds. On the first path, the pulse propagates as a travel wave at slow speed. On the second path, the pulse propagates at quick speed. Based on the data of the experiments on a real 50 MW steam generator, the author has found the pulses can propagate by magnetic field of the stator winding. It was studied that how to locating the partial discharge by signals coming from the different paths, including the features of signals on the two paths at time domain and frequency domain, the measurement frequency rang of the signals, the blind area, the advantage and disadvantage of this method.

• Earthquakes and Structures
• /
• v.26 no.2
• /
• pp.87-96
• /
• 2024

This paper proposes a logistic multinomial regression approach to model the spatial cross-correlation of damage probabilities among different damage states in an expanded transportation network. Utilizing Bayesian theory and the multinomial logistic model, we analyze the damage states and probabilities of bridges while incorporating damage correlation. This correlation is considered both between bridges in a network and within each bridge's damage states. The correlation model of damage probabilities is applied to the seismic assessment of a portion of Tehran's transportation network, encompassing 26 bridges. Additionally, we introduce extra daily traffic time (EDTT) as an operational parameter of the transportation network and employ the shortest path algorithm to determine the path between two nodes. Our results demonstrate that incorporating the correlation of damage probabilities reduces the travel time of the selected network. The average decrease in travel time for the correlated case compared to the uncorrelated case, using two selected EDTT models, is 53% and 71%, respectively.

• Journal of Information Technology Services
• /
• v.10 no.4
• /
• pp.259-268
• /
• 2011

A robot education system by emulation based on Web can be efficiently used for understanding concept of robot assembly practice and control mechanism of robot by control programming. It is important to predict the path of the line tracer robot which has to be decided by the robot. Shortest Path Algorithm is a well known algorithm which searches the most efficient path between the start node and the end node. There are two related typical algorithms. Dijkstra Algorithm searches the shortest path tree from a node to the rest of the other nodes. $A^*$ Algorithm searches the shortest paths among all nodes. The delay time caused by turning the direction of navigation for the line tracer robot at the crossroads can give big differences to the travel time of the robot. So we need an efficient path determine algorithm which can solve this problem. Thus, It is necessary to analyze the overhead of changing direction of robot at multi-linked node to determine the next direction for efficient routings. In this paper, we reflect the real delay time of directional changing from the real robot. A speed based Dijkstra algorithm is proposed and compared with the previous ones to analyze the performance.

• 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.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.67-83
• /
• 2018

This research is motivated by the question, "Where, when, and through what mode does an individual passenger moving within a subway station use to travel from starting to final destinations ?" To answer this, the stations passed by the individual passenger, the path taken, and modes used need to be known beforehand. In the metropolitan integrated public transportation fare system, Automated Fare Collection System(AFC) can be a source of information on transit modes, stations, and paths of individual passengers. AFC calculates a fare for the passenger based on travel data such as boarding and alighting stations, time, and mode used. In this research, an Selected Station Analysis(SSA) method, in which AFC data is used to observe passenger movement in the metropolitan public transportation subway station from the perspective of subway transfer stations, is proposed. SSA subdivides individual passenger movement in transfer stations and analyzes initial station/time and final destination station/time information using the trip chain perspective.

• Journal of Korean Society of Transportation
• /
• v.24 no.5 s.91
• /
• pp.77-88
• /
• 2006

The purpose of this study is to Propose the time dependent K-least time path algorithm applicable to a real-time based operation strategy in multi-modal transportation network. For this purpose, we developed the extended method based on entire path deletion method which was used in the static K-least time path algorithm. This method was applied to time dependent K-least time path algorithm to find k least time paths in order based on both time dependant mode-link travel time and transfer cost In particular, this algorithm find the optimal solution, easily describing transfer behavior, such as walking and waiting for transfer by applying a link-based time dependent label. Finally, we examined the verification and application of the Proposed algorithm through case study.