• IE interfaces
• /
• v.24 no.4
• /
• pp.304-313
• /
• 2011

An Unmanned Aerial Vehicle(UAV) is a powered pilotless aircraft, which is controlled remotely or autonomously. UAVs are currently employed in many military missions(surveillance, reconnaissance, communication relay, targeting, strike etc.) and a number of civilian applications(communication service, broadcast service, traffic control support, monitoring, measurement etc.). For accomplishing the UAV's missions, guarantee of survivability should be preceded. The main objective of this study is the path planning to maximize survivability for UAV based on 3-dimensional environment. A mathematical programming model is suggested by using MRPP(Most Reliable Path Problem) and solved by transforming MRPP into SPP(Shortest Path Problem). This study also suggests a $A^*PS$ algorithm based on 3-dimensional environment to UAV's path planning. According to comparison result of the suggested algorithm and SPP algorithms (Dijkstra, $A^*$ algorithm), the suggested algorithm gives better solution than SPP algorithms.

• Journal of the Korea Safety Management & Science
• /
• v.13 no.2
• /
• pp.103-113
• /
• 2011

This research is to select a path planning algorithm to maximize survivability for Unmanned Aerial Vehicle(UAV). An UAV is a powered pilotless aircraft, which is controlled remotely or autonomously. UAVs are currently employed in many military missions(surveillance, reconnaissance, communication relay, targeting, strike etc.) and a number of civilian applications(communication service, broadcast service, traffic control support, monitoring, measurement etc.). In this research, a mathematical programming model is suggested by using MRPP(Most Reliable Path Problem) and verified by using ILOG CPLEX. A path planning algorithm for UAV is selected by comparing of SPP(Shortest Path Problem) algorithms which transfer MRPP into SPP.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.12
• /
• pp.19-29
• /
• 1997

This paper presents stable kinematic modeling and path planning and path tracking algorithms for the poisition control of 4-wheeled 2-d.o.f(degree of freedom) mobile robot. We drived the actuated inverse and sensed forward solution for the calculation of actuator velocity and robot velocities. the deal-reckoning algorithm is introduced to calculate the position of WMR in real time. The gaussian functions are applied to control and to design the smooth orientation angle of WMR and the path planning algorithm for obstacle avoidance is prosed. We composed feedback control system to compensate for error because of uncertainty kinematic modeling and measurement noise. The simulation resutls show that the proposed kinematkc modeling and path planning and feedback control algorithms are useful.

• The Journal of Korea Robotics Society
• /
• v.5 no.2
• /
• pp.127-134
• /
• 2010

In this paper, a hybrid semi-3D path planning algorithm combining Virtual Tangential Vector(VTV) and fuzzy control is proposed. 3D dynamic environmental factors are reflected to the 2D path planning model, VTV. As a result, the robot can control direction from 2D path planning algorithm VTV and speed as well depending on the fuzzy inputs such as the distance between the robot and obstacle, roughness and slope. Performances and feasibilities of the suggested method are demonstrated by using Matlab simulations. Simulation results show that fuzzy rules and obstacle avoidance methods are working properly toward virtual 3D environments. The proposed hybrid semi-3D path planning is expected to be well applicable to a real life environment, considering its simplicity and realistic nature of the dynamic factors included.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.565-567
• /
• 2004

In active noise control (ANC) systems, the convergence behavior of the conventional Filtered-X Least Mean Square (FXLMS) algorithm may be affected by nonlinear distortions in the secondary path (e.g., in the power amplifiers, loudspeakers, transducers, etc.), which may lead to degradation of the error-reduction performance of the ANC systems. In this paper, a stable FXLMS algorithm with fast convergence is proposed to compensate for undesirable nonlinear distortions in the secondary-path of ANC systems by employing the Volterra filtering approach. In particular, the proposed approach is based on the utilization of the conventional P-th order inverse approach to nonlinearity compensation in the secondary path of ANC systems. Finally, the simulation results showed that the proposed approach yields a better convergence behavior In the nonlinear ANC systems than the conventional FXLMS.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.5
• /
• pp.1001-1004
• /
• 2010

Acoustic feedback and background noise variation can degrade the performance of an active noise control (ANC) system. In this paper, nonlinear ANC using a non-parametric VSS-NLMS (or NPVSS-NLMS) algorithm and online feedback path modeling is proposed, whereby the conventional linear ANC with online acoustic feedback-path modeling is further extended to nonlinear Volterra ANC with a linear acoustic feedback path. In particular, the step-size of the NPVSS-NLMS algorithm is controlled to reduce the effect of background noise variation in the ANC system. Simulation results demonstrate that the proposed approach yields better nonlinear ANC performance compared with the conventional nonlinear ANC method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.5
• /
• pp.413-418
• /
• 2012

This paper presents a multi-robot path planner for environment exploration and monitoring. Robotics systems are being widely used as data measurement tools, especially in dangerous environment. For large scale environment monitoring, multiple robots are required in order to save time. The path planner should not only consider the collision avoidance but efficient coordination of robots for optimal measurements. Nonlinear spring force based planning algorithm is integrated with the spatial gradient following path planner. Perturbation/Correlation based estimation of spatial gradient is applied. An algorithm of tuning the stiffness for robot coordination is presented. The performance of the proposed algorithm is discussed with simulation results.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.4
• /
• pp.392-398
• /
• 2008

We propose a new path planning method for autonomous mobile robots. To maximize the utility of mobile robots, the collision-free shortest path should be generated by on-line computation. In this paper, we develop an effective and practical method to generate a good solution by lower computation time. The initial path is obtained from skeleton graph by Dijkstra's algorithm. Then the path is improved by changing the graph and path dynamically. We apply the dynamic programming algorithm into the stage of improvement. Simulation results are presented to verify the performance of the proposed method.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.2
• /
• pp.252-260
• /
• 2016

Unlike terrestrial transportation, marine transportation should consider environment factors in order to optimize path planning. This is because, ship's path planning is greatly influenced by real-time ocean environment-sea currents, wave and wind. Therefore, in this study, we suggest a ship path planning algorithm based on real-time ocean environment using not only $A^*$ algorithm but also path smoothing method. Moreover, in order to improve objective function value, we also consider ship's moving distance based on ship's location and real-time ocean environment data on grid map. The efficiency of the suggested algorithm is proved by comparing with $A^*$ algorithm only. This algorithm can be used as a reasonable automatics control system algorithm for unmaned ship.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1389-1391
• /
• 1996

In this paper, we applies two methods - Genetic Algorithm(GA) and $A^*$ Algorithm - to find the optimal path in route guidance system. Under the assumption that the traveling costs of each link are given, the task to find the optimal path becomes very complicated problem if the number of nodes or links increase. Two well-known algorithms are modified to resolve the problem and the preliminary demonstration show both optimistic result and needs to improvement.