• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제10권3호
• /
• pp.203-209
• /
• 2010

This paper presents a hierarchical fuzzy motion planner for humanoid robots in 3D uneven environments. First, we define both motion primitives and locomotion primitives of humanoid robots. A high-level planner finds a global path from a global navigation map that is generated based on a combination of 2.5 dimensional maps of the workspace. We use a passage map, an obstacle map and a gradient map of obstacles to distinguish obstacles. A mid-level planner creates subgoals that help the robot efficiently cope with various obstacles using only a small set of locomotion primitives that are useful for stable navigation of the robot. We use a local obstacle map to find the subgoals along the global path. A low-level planner searches for an optimal sequence of locomotion primitives between subgoals by using fuzzy motion planning. We verify our approach on a virtual humanoid robot in a simulated environment. Simulation results show a reduction in planning time and the feasibility of the proposed method.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2018년도 추계학술대회
• /
• pp.256-257
• /
• 2018

This paper deals with the path-following control for marine surface vehicles with underactuated characteristics. In consideration of practical limitations of actuators, an improved DVS(dynamic virtual ship) guidance algorithm is proposed with the multi-level DVS optionally selected to be tracked. To address the output-feedback control issue, an adaptive FLS(fuzzy logical systems) is devised to online approximate the kinematic states. Based on that observing framework, the path-following control law is thereafter derived. Simulations testify effectiveness of the proposed scheme

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권2호
• /
• pp.678-690
• /
• 2014

The current networks do not disclose information about a management domain due to scalability, manageability and commercial reasons. Therefore, it is very hard to calculate an optimal path to the destination. Also, due to poor information sharing, if an error occurs in the intermediate path, it is very difficult to re-search the path and find the best path. Hence, to manage each domain more efficiently, an architecture with top-level path computation node which can obtain information of separate nodes are highly needed This study aims to investigate a federation of a united network around NRN(National Research Network) that could allow resource sharing between countries and also independent resource management for each country. Considering first the aspects that can be accessed from the perspective of a national research network, ICE(Information Control Element) and GFO(Global Federation Organizer)-based architecture is designed as a top-level path computation element to support traffic engineering and applied to the multi-domain network. Then, the federation for the independent management of resources and resource information sharing among national research networks have been examined.

• 한국컴퓨터정보학회논문지
• /
• 제21권5호
• /
• pp.73-77
• /
• 2016

This paper deals with the network reliability problem that decides the communication line between main two districts while the k districts were destroyed in military communication network that the n communication lines are connected in m districts. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with O(n) linear time complexity to solve the optimal solution for this problem. This paper suggests the flow path algorithm (FPA) and level path algorithm (LPA). The FPA is to search the maximum number of distinct paths between two districts. The LPA is to construct the levels and delete the unnecessary nodes and edges. The proposed algorithm can be get the same optimal solution as LP for experimental data.

• 한국군사과학기술학회지
• /
• 제11권4호
• /
• pp.141-148
• /
• 2008

In this paper, we develop a detailed full dynamic model which includes various rough terrains for 6-wheel skid-steering mobile robot based on the real experimental autonomous vehicle called Dog-Horse Robot. We also design a co-simulation for performance comparison of path tracking algorithms. The control architecture in the co-simulation can be divided into two levels. The high level control is the closed-loop control of path tracking to follow a given path, and the low level is concerned about torque control of wheel motion. The simulation using the mechanical data of the Dog-Horse Robot is performed under the Matlab/Simulink environment. We also simulate and evaluate the performance of the model based adaptive controller.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• KIEAE Journal
• /
• 제5권1호
• /
• pp.35-42
• /
• 2005

The primary concerns of recreation plan are to provide visitors with quality of recreational experience and to protect of recreation resources. The quality of recreational experience is often defined in terms of social carrying capacity. The carrying capacity is revealed as perceived crowding. In this respects, measuring perceived crowding is useful tool of social carrying capacity determination. This study is to test the structural equation model that includes variables affecting perceived crowding. Through an on-site questionnaire survey, 467 visitors on Naejangsan national park were collected. The results of the study are follows. The encounter level on facility area is higher evaluated as crowding factor than other area in the park. It can be concluded that visitor perceived crowding when facility area situates high density use level rather than other areas expose high density use level. In the path analysis, the input variables(attitude, experience, encounter level) on the structural equation model affect significantly on perceived crowding. Especially, the attitude on the park management polocy is the most affecting factor on perceived crowding.

• 산업기술연구
• /
• 제15권
• /
• pp.23-32
• /
• 1995

The methodology of automatic generation of tool path for rough cutting of a sculptured surface is proposed with the improved contouring method, unequal level line machining. Considering the surface shape and the diameter of the endmill, the distance between level lines is obtained. To improve MMR, initial rough cutting is processed with the large diameter endmill and the remained material is removed by the relatively small diameter endmill. Tool path is generated from the offset curve of respective level line and the interferences between the tool and workpiece are automatically avoided. After generating NC part program, the sculptured surface is machined at the vertical machining center. From the experimental results, total cutting length and machining time are reduced more effectively than conventional contouring methods.

• 전자공학회논문지SC
• /
• 제45권4호
• /
• pp.68-78
• /
• 2008

연속적인 경로 사이를 부드러운 곡선으로 잇기 위해서 기존의 로봇 제어기들은 일반적으로 연속적인 경로를 시간 축에서 합성하는 방법을 사용해 왔다. 하지만 이런 방법은 다음과 같은 두 가지 단점을 내재하고 있다. 천이 경로의 형태가 연접하게 생성될 수 없다는 점과 천이하는 동안 속력을 제어할 수 없다는 점이 그것이다. 이러한 문제점들을 극복하기 위해서 본 논문은 매끄럽지 않게 연결된 두 경로들을 부드럽게 잇기 위해 곡률이 제한된 새로운 천이 궤적 생성 방법을 제시하고자 한다. 실험 결과는 기존의 방법들보다 천이 궤적이 더 부드럽게 생성되는 것을 보여주며, 또한 보장된 곡률의 제한 수준은 $0.02{\sim}1$임을 보여준다.

• 전자공학회논문지C
• /
• 제35C권9호
• /
• pp.1-10
• /
• 1998

본 논문에서는 대형 디지털 회로에 대하여 임계경로를 탐색하는 시간을 줄이고 기존의 방법에서 임계경로를 찾지 못했던 회로에서도 정확히 임계경로를 찾을 수 있는 임계경로 탐색 알고리듬(DYSAC)을 제안하였다. 또한 이 탐색 알고리듬의 내부에서 사용되는 경로부각기준(DYPSEC)을 함께 제안하였다. DYSAC는 각 노드에 레벨을 부과하기 위한 레벨지정 부알고리듬과 최장의 부각가능한 경로를 찾는 임계경로 탐색 부알고리듬으로 구성되었다. 제안된 알고리듬은 SUN Sparc 환경에서 C-언어로 구현되어 ISCAS'85 벤치마크회로에 적용, 제안된 알고리듬의 정확한 동작여부를 확인하였다. 또한 실험결과를 기존의 방법들과 비교하였는데, 그 결과 제안된 알고리듬이 임계경로를 찾는 능력과 임계경로를 찾는데 걸리는 시간 모두에서 기존의 방법들보다 월등히 우수함을 보였다.