• 한국통신학회논문지
• /
• 제21권11호
• /
• pp.2897-2908
• /
• 1996

본 논문에서는 ATM 망의 가상경로상에서 Common Pool을 이용한 효율적인 호 수락 제어에 관하여 논한다. 호 수락 제어는 새로운 호에 대하여 기존의 연결된 호와 새로 요청된 호의 서비스 품질을 만족시키는 범위내에서 연결 여부를 결정하는 것이다. 제안한 알고리즘은 새로운 호의 요청에 대하여 기존 호의 대역폭과 새로운 호의 대역폭 합이 전체 대역폭을 초과하지 않으면 호를 수락한다. 그러나 요구 대역폭이 전체 대역폭을 초과하는 경우 미리 예비된 대역폭 Common Pool을 이용하여 다시 호의 수락 여부를 결정한다. 한편 제안한 알고리즘을 위하여 간단한 네트웍 모델을 통한 컴퓨터 모의실험을 통하여 호의 블록킹 확률을 구하여 평가하였다.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2002년도 춘계학술대회 논문집
• /
• pp.184-189
• /
• 2002

Collision free task planning for dual-arm robot which perform many subtasks in a common work space can be achieved in two steps : path planning and trajectory planning. Path planning finds the order of tasks for each robot to minimize path lengths as well as to avoid collision with static obstacles. A trajectory planning strategy is to let each robot move along its path as fast as possible and delay one robot at its initial position or reduce speed at the middle of its path to avoid collision with the other robot.

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

In this paper, we propose an efficient collision-free path planning method of two cooperating robot manipulators grasping a common object rigidly. For given two robots and an object, the procedure is described which constructs the reduced dimensional configuration space by the kinematic analysis of two cooperating robot manipulators. A path planning algorithm without explicit representation of configuration obstacles is also described. The primary steps of the algorithm is as follows. First, we compute a graph which represents the skeleton of the free configuration space. Second, a connection between an initial and a goal configuration to the graph is searched to find a collision-free path.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2001년도 춘계학술대회 논문집(한국공작기계학회)
• /
• pp.244-249
• /
• 2001

Collision free task planning for dual-arm robot which perform many subtasks in a common work space can be achieved in two steps : path planning and trajectory planning. Path planning finds the order of tasks for each robot to minimize path lengths as well as to avoid collision with static obstacles. A trajectory planning strategy is to let each robot move along its path as fast as possible and delay one robot at its initial position or reduce speed at the middle of its path to avoid collision with the other robot.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2000년도 추계학술대회논문집 - 한국공작기계학회
• /
• pp.113-118
• /
• 2000

Collision free task planning for dual-arm robot which perform many subtasks in a common work space can be achieved in two steps : path planning and trajectory planning. Path planning finds the order of tasks for each robot to minimize path lengths as well as to avoid collision with static obstacles. A trajectory planning strategy is to let each robot move along its path as fast as possible and delay one robot at its initial position or reduce speed at the middle of its path to avoid collision with the other robot.

• 한국CDE학회논문집
• /
• 제7권3호
• /
• pp.184-188
• /
• 2002

In 2D-Profile machining using cutter radius compensation cutter interferences are very common. To prevent the cutter interferences undercuts are inevitable in some regions of the profile. The undercut regions require cleanup machining using smaller radius tools. This paper considers a procedure of the tool path generation for the cleanup profile machining. And two methods are introduced for an efficient tool path generation. One is how to reduce the machining time by uniting adjacent tool paths of undercut regions, and the other is how to find the tool path with the minimal distance by applying TSP algorithm.

• 국제학술발표논문집
• /
• The 9th International Conference on Construction Engineering and Project Management
• /
• pp.1085-1092
• /
• 2022

Travel distance is a parameter mainly used in the objective function of Construction Site Layout Planning (CSLP) automation models. To obtain travel distance, common approaches, such as linear distance, shortest-distance algorithm, visibility graph, and access road path, concentrate only on identifying the shortest path. However, humans do not necessarily follow one shortest path but can choose a safer and more comfortable path according to their situation within a reasonable range. Thus, paths generated by these approaches may be different from the actual paths of the workers, which may cause a decrease in the reliability of the optimized construction site layout. To solve this problem, this paper adopts reinforcement learning (RL) inspired by various concepts of cognitive science and behavioral psychology to generate a realistic path that mimics the decision-making and behavioral processes of wayfinding of workers on the construction site. To do so, in this paper, the collection of human wayfinding tendencies and the characteristics of the walking environment of construction sites are investigated and the importance of taking these into account in simulating the actual path of workers is emphasized. Furthermore, a simulation developed by mapping the identified tendencies to the reward design shows that the RL agent behaves like a real construction worker. Based on the research findings, some opportunities and challenges were proposed. This study contributes to simulating the potential path of workers based on deep RL, which can be utilized to calculate the travel distance of CSLP automation models, contributing to providing more reliable solutions.

• 한국정보과학회논문지:정보통신
• /
• 제35권6호
• /
• pp.538-548
• /
• 2008

IETF(Internet Engineering Task Force) NSIS(Next Step in Signaling) 워킹그룹에서는 MN(Mobile Node)의 핸드오버로 인해 데이타 전달 경로가 변경된 경우, 이전 경로와 새로운 경로가 분기 또는 통합되는 지점에 있는 노드인 CRN(Crossover Node)을 발견하는 방안을 제안하였다. 이 방안에서는 CRN 발견을 통해 새로운 경로 상에 자원예약 시그널링 지연을 줄이고 이전 경로와 새로운 경로의 공통경로 상에 중복 자원예약을 피함으로써 핸드오버 이후의 자원예약을 효율적으로 수행한다. 그러나 MN이 핸드오버하는 동안 지속적으로 QoS(Quality of Service)를 보장받기 위해서는 핸드오버 이전에 새로운 경로 상의 사전자원예약이 이루어져야 한다. 그런데 아직 핸드오버하지 않은 MN이 새로운 경로 상에 사전자원예약을 수행하려는 경우에는 기존의 CRN 메커니즘을 적용하기 어렵다. 이에 본 논문에서는 현재 자인이 예약된 경로와 MN이 핸드오버 할 가능성이 있는 하나 이상의 지역의 새로운 경로 상에 CRN이 될 가능성이 있는 노드인 PCRN(Passive Crossover Node)을 발견하고, 이후 새로운 경로 상에 사전자원예약을 수행하는 방안을 제안한다.

• 산업공학
• /
• 제24권4호
• /
• pp.447-456
• /
• 2011

Identifying the major moving patterns of shoppers' movements in the selling floor has been a longstanding issue in the retailing industry. With the advent of RFID technology, it has been easier to collect the moving data for a individual shopper's movement. Most of the previous studies used the traditional clustering technique to identify the major moving pattern of customers. However, in using clustering technique, due to the spatial constraint (aisle layout or other physical obstructions in the store), standard clustering methods are not feasible for moving data like shopping path should be adjusted for the analysis in advance, which is time-consuming and causes data distortion. To alleviate this problems, we propose a new approach to spatial pattern clustering based on longest common subsequence (LCSS). Experimental results using the real data obtained from a grocery in Seoul show that the proposed method performs well in finding the hot spot and dead spot as well as in finding the major path patterns of customer movements.

• International Journal of Aerospace System Engineering
• /
• 제1권1호
• /
• pp.29-33
• /
• 2014

A displacement measurement system that uses fiber-optical common-path interferometry has been developed. The system includes fiber-optic devices and a collimator attached to a linear translation stage. The interferometry effect was detected with a photodetector whose signal was measured on an oscilloscope. Experiments showed that vibration of the stage disturbed the signal by causing nanoscale interference. Under stable conditions, the measured distance was the almost the same as the value calculated from the linear translation stage parameters.