• 대한산업공학회지
• /
• 제31권4호
• /
• pp.334-340
• /
• 2005

A mouse is an important input device that is used in most of all computer works. A mouse control time prediction model was proposed in this study. Especially, the model described the time of mouse control that made a cursor to move within path constraints. The model was developed by a laboratory experiment. Cursor movement times were measured in 36 task conditions; 3 levels of path length, 3 levels of path width and 4 levels of target's width. 12 subjects participated in all conditions. The time of cursor movement with path constraints could be better explained by the combination of Fitts' law with steering law($r^2=0.947$) than by the other models; Fitts' law($r^2=0.740$), Steering law($r^2=0.633$) and Crossman's model($r^2=0.897$). The proposed model is expected to be used in menu design or computer game design.

• International Journal of Control, Automation, and Systems
• /
• 제4권1호
• /
• pp.77-86
• /
• 2006

A new method in robot path generation is presented using an analysis of the characteristics of multi-robot collision avoidance. The research is based on the concept of the collision map, where the collision between two robots is presented by a collision region and a crossing curve TLVSTC (traveled length versus servo time curve). Analytic collision avoidance is considered by translating the collision region in the collision map. The 4 different translations of collision regions correspond to the 4 parallel movements of the actual original robot path in the real world. This analysis is applied to path modifications where the analysis of collision characteristics is crucial and the resultant path for collision avoidance is generated. Also, the correlations between the translations of the collision region and robot paths are clarified by analyzing the collision/non-collision areas. The influence of the changes of robot velocity is investigated analytically in view of collision avoidance as an example.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.826-829
• /
• 1995

In this paper, the problem of minimum-time trajectory planning of a robot manipulator with an arbitrary path is dealt. As for a straight path, the trajectory planning can be done without difficulty since the path is easily parameterized by its length. However, this is not the case for a non-straight path. In this paper, by noting that the others' joint angles and velocities are determined if one joint's angle and velocity are known, we reduce the problem of trajectory planning on a non-straight path to one in the 2-dimensional space of one joint's angle and velocity. Then, by applying the dynamic programming, we achieve the minimum-time trajectory planning. A simulation is done for verifying this.

• 대한수학회논문집
• /
• 제37권4호
• /
• pp.957-967
• /
• 2022

Recently, Brešar's Jordan {g, h}-derivations have been investigated on triangular algebras. As a first aim of this paper, we extend this study to an interesting general context. Namely, we introduce the notion of Jordan 𝒢_n-derivations, with n ≥ 2, which is a natural generalization of Jordan {g, h}-derivations. Then, we study this notion on path algebras. We prove that, when n > 2, every Jordan 𝒢_n-derivation on a path algebra is a {g, h}-derivation. However, when n = 2, we give an example showing that this implication does not hold true in general. So, we characterize when it holds. As a second aim, we give a positive answer to a variant of Lvov-Kaplansky conjecture on path algebras. Namely, we show that the set of values of a multi-linear polynomial on a path algebra KE is either {0}, KE or the space spanned by paths of a length greater than or equal to 1.

• 한국전자파학회논문지
• /
• 제25권3호
• /
• pp.348-356
• /
• 2014

기존의 ITU-R 모델은 강우 환경이 다른 국내 측정치와 편차가 크고, 실효 경로 길이가 주파수와 무관함에도 주파수의 함수로 되어 있으며, 강우셀의 물리적 특성이 반영되지 않은 경험 모델이라는 단점이 있다. 본 논문에서는 강우셀 개념을 이용한 실효 경로 길이 모델에 대한 이론 모델을 제안하고, 측정 데이터를 이용하여 제안 모델의 타당성을 검증하였다. 강우셀 파라미터의 통계적 특성 분석을 위하여 한국 기상청의 기상레이더 측정 데이터(CAPPI)를 분석하고, 한국전자통신연구원에서 측정한 천리안 비콘 수신 데이터를 이용하여 보정계수를 도입함으로써 측정치와 잘 일치하는 물리적 이론 모델을 도출하였다. 도출된 실효 경로 길이 모델의 검증을 위하여 국방과학연구소의 연구비 지원을 받아 충남대학교에서 측정한 무궁화 5호(Ka 대역) 위성 비콘신호 측정 데이터를 사용하여 비교하였으며, 제안한 실효 경로 길이 모델과 측정데이터가 잘 일치함을 확인하였다.

• 로봇학회논문지
• /
• 제15권2호
• /
• pp.147-159
• /
• 2020

Over the last years, a number of different path following methods for the autonomous parking system have been proposed for tracking planned paths. However, it is difficult to find a study comparing path following methods for a short path length with large curvature such as a parking path. In this paper, we conduct a comparative study of the path following methods for perpendicular parking. By using Monte-Carlo simulation, we determine the optimal parameters of each controller and analyze the performance of the path following. In addition, we consider the path following error occurred at the switching point where forward and reverse paths are switched. To address this error, we conduct the comparative study of the path following methods with the one thousand switching points generated by the Monte-Carlo method. The performance of each controller is analyzed using the V-rep simulator. With the simulation results, this paper provides a deep discussion about the effectiveness and limitations of each algorithm.

• International Journal of Computer Science & Network Security
• /
• 제21권4호
• /
• pp.1-8
• /
• 2021

The subject of navigation has drawn a large interest in the last few years. Navigation problem (or path planning) finds the path between two points, source location and destination location. In smart cities, solving navigation problem is essential to all residents and visitors of such cities to guide them to move easily between locations. Also, the navigation problem is very important in case of moving robots that move around the city or part of it to get some certain tasks done such as delivering packages, delivering food, etc. In either case, solution to the navigation is essential. The core to navigation systems is the navigation algorithms they employ. Navigation algorithms can be classified into navigation algorithms that depend on maps and navigation without the use of maps. The map contains all available routes and its directions. In this proposal, we consider the first class. In this paper, we are interested in getting path planning solutions very fast. In doing so, we employ a parallel platform, Reconfigurable mesh (R-Mesh), to compute the path from source location to destination location. R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents two algorithms for path planning. The first assumes maps with linear streets. The second considers maps with branching streets. In both algorithms, the quality of the path is evaluated in terms of the length of the path and the number of turns in the path.

• 한국해안해양공학회지
• /
• 제14권4호
• /
• pp.286-294
• /
• 2002

본 연구에서는 응력이력과 시간이력이 과압밀 상태에서의 간극수압계수, A(Skempton, 1954)에 미치는 영향에 관하여 실험적으로 규명하였다. 응력경로 회전각, 과압밀비 및 접근길이로 정의되는 응력이력과 재하속도 이력 그리고 정지기간으로 정의되는 시간이력에 따른 간극수압계수(A)의 값과 변화 양상을 보았다. 응력경로 회전각에 따른 간극수압계수(A)는 그 값과 변화 경향에서 상이하게 나타났고, A의 값에 있어서는 과압밀비 의존성을 보였지만, 변화 양상에서는 의존성을 찾아 볼 수 없었다. 접근길이에 따른 간극수압계수(A)는 초기 미소 변형률 구간을 제외하고는 큰 영향을 받지 않았다. 또한, A의 값은 재하속도 이력에 영향을 받았지만, 변화 경향은 모두 동일하게 나타났다. 마지막으로 정지기간에 따른 과압밀점토의 간극수압계수, A는 정지기간의 유무에 따라 변화 경향과 값이 큰 차이를 보이다가 일정 축차응력 또는 변형률을 넘어서면 거의 유사한 값을 나타내었다.

• 한국해양공학회지
• /
• 제33권6호
• /
• pp.510-517
• /
• 2019

Efficient path planning is essential for unmanned surface vehicle (USV) navigation. The A^* algorithm is an effective algorithm for identifying a safe path with optimal distance cost. In this study, a modified version of the A^* algorithm is applied for planning the path of a USV in a static and dynamic obstacle environment. The current study adopts the A^* approach while maintaining a safe distance between the USV and obstacles. Two important parameters-path length and computational time-are considered at various start times. The results demonstrate that the modified approach is effective for obstacle avoidance by a USV that is compliant with the International Regulations for Preventing Collision at Sea (COLREGs).

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1128-1131
• /
• 1996

The collision-free path planning presented here uses linear parametric curve with one intermediate connection point between start and target points. The algorithm, in which connection point is organized in elliptic chord.(.theta., .delta.), maps objects in Euclidean Space into images in CPS through intersection check between path and obstacles a process defined as GM. Elliptic locus has special property that the total distance between focus points through a point on ellipse is the same regardless of .theta.. Hence by locating the start and target points to focus points of ellipse, and organizing connection point in elliptic coordinate, the .delta.-axis of CPS represents length of path. The GM of EWS requires calculation of interference in circumferential direction only. The procedures for GM is developed which include categorization of obstacles to reduce calculation amount. Simulations of GM of EWS, on a PC with Pentium/90MHz, is carried out to measure performance of algorithm and the results are reported on a table. The simulations are done for number of cases with different number of obstacles and location of start/target points.