• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.6
• /
• pp.726-732
• /
• 2013

It is required for UGV(Unmanned Ground Vehicle) to have a LPP(Local Path Plan) component which generate a local path via the center of road by analyzing binary map to travel autonomously unpaved road in rough environment. In this paper, we present the method of boundary estimation for unpaved road and a local path planning method based on RANGER algorithm using the estimated boundary. In specially, the paper presents an approach to estimate road boundary and the selection method of candidate path to minimize the problem of zigzag driving based on Bayesian probability reasoning. Field test is conducted with scenarios in rough environment in which bush, tree and unpaved road are included and the performance of proposed method is validated.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.15 no.3
• /
• pp.1-9
• /
• 2007

A major concern for Autonomous Military Robot in the rough terrain is the problem of moving robot from an initial configuration to goal configuration. In this paper, We generate a local path to looking for the best route to move an goal configuration while avoiding known obstacle from world model, not violating the mobility constraints of robot. Trough a Simulator for Unmanned Autonomous Vehicle, We can simulate a traversability of unmanned autonomous vehicle based on steering, acceleration, braking command obtained from local path planning.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.6
• /
• pp.803-812
• /
• 2017

This paper proposes a local path planning method for stable autonomous driving in rough terrain. There are various path planning techniques such as candidate paths, star algorithm, and Rapidly-exploring Random Tree algorithms. However, such existing path planning has limitations to reflecting the stability of unmanned ground vehicles. This paper suggest a path planning algorithm that considering the stability of unmanned ground vehicles. The algorithm is based on the genetic algorithm and assumes to have probability based obstacle map and elevation map. The simulation result show that the proposed algorithm can be used for real-time local path planning in rough terrain.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.59
• /
• pp.1-10
• /
• 2000

The traveling salesman problem is a representative NP-Complete problem. It needs lots of time to get a solution as the number of city increase. So, we need an efficient heuristic algorithm that gets good solution in a short time. Almost edges that participate in optimal path have somewhat low value cost. This paper discusses the property of nearest neighbor and 3-opt. This paper uses nearest neighbor's property to select candidate edge. Candidate edge is a set of edge that has high probability to improve cycle path. We insert edge that is one of candidate edge into intial cycle path. As two cities are connected. It does not satisfy hamiltonian cycle's rule that every city must be visited and departed only one time. This paper uses 3-opt's method to sustain hamiltonian cycle while inserting edge into cycle path. This paper presents a highly efficient heuristic algorithm verified by numerous experiments.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.9
• /
• pp.369-374
• /
• 2014

Path generation methods are required for safe and efficient driving in unmanned autonomous vehicles. There are two kinds of paths: global and local. A global path consists of all the way points including the source and the destination. A local path is the trajectory that a vehicle needs to follow from a way point to the next in the global path. In this paper, we propose a novel method for local path generation through machine learning, with an effective curve function used for initializing the trajectory. First, reinforcement learning is applied to a set of candidate paths to produce the best trajectory with maximal reward. Then the optimal steering angle with respect to the trajectory is determined by training an artificial neural network. Our method outperformed existing approaches and successfully found quality paths in various experimental settings, including the cases with obstacles.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.91-97
• /
• 2002

This paper describes a heuristic search technique carrying out collision avoidance for Autonomous Underwater Vehicles(AUVs). Fuzzy relational products are used as the mathematical implement for the analysis and synthesis of relations between obstacles that are met in the navigation environment and available candidate nodes. In this paper, we propose a more effective evaluation function that reflects the heuristic information of domain experts on obstacle clearance, and an advanced heuristic search method performing collision avoidance for AUVs. The search technique adopts fuzzy relational products to conduct path-planning of intelligent navigation system. In order to verify the performance of proposed heuristic search, it is compared with $A^*$ search method through simulation in view of the CPU time, the optimization of path and the amount of memory usage.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.37 no.1
• /
• pp.203-215
• /
• 2017

Recently, interest in Pedestrian Navigation Service (PNS) is being increased due to the diffusion of smart phone and the improvement of location determination technology and it is efficient to use landmarks in route guidance for pedestrians due to the characteristics of pedestrians' movement and success rate of path finding. Accordingly, researches on extracting landmarks have been progressed. However, preceding researches have a limit that they only considered the difference between buildings and did not consider visual attention of maps in display of PNS. This study improves this problem by defining building attributes as local variable and global variable. Local variables reflect the saliency of buildings by representing the difference between buildings and global variables reflects the visual attention by representing the inherent characteristics of buildings. Also, this study considers the connectivity of network and solves the overlapping problem of landmark candidate groups by network voronoi diagram. To extract landmarks, we defined building attribute data based on preceding researches. Next, we selected a choice point for pedestrians in pedestrian network data, and determined landmark candidate groups at each choice point. Building attribute data were calculated in the extracted landmark candidate groups and finally landmarks were extracted by principal component analysis. We applied the proposed method to a part of Gwanak-gu, Seoul and this study evaluated the extracted landmarks by making a comparison with labels and landmarks used by portal sites such as the NAVER and the DAUM. In conclusion, 132 landmarks (60.3%) among 219 landmarks of the NAVER and the DAUM were extracted by the proposed method and we confirmed that 228 landmarks which there are not labels or landmarks in the NAVER and the DAUM were helpful to determine a change of direction in path finding of local level.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.4
• /
• pp.249-257
• /
• 2015

This paper introduces a heuristic algorithm to NP-hard travelling salesman problem. The proposed algorithm, in its bid to determine initial path, applies SW-DNN, DW-DNN, and DC-DNN, which are modified forms of the prevalent Double-sided Nearest Neighbor Search and searches the minimum value. As a part of its optimization process on the initial solution, it employs 2, 2.5, 3-opt of a local search k-opt on candidate delete edges and 4-opt on undeleted ones among them. When tested on TSP-1 of 26 European cities and TSP-2 of 49 U.S. cities, the proposed algorithm has successfully obtained optimal results in both, disproving the prevalent disbelief in the attainability of the optimal solution and making itself available as a general algorithm for the travelling salesman problem.

• Journal of IKEEE
• /
• v.7 no.2 s.13
• /
• pp.288-298
• /
• 2003

We consider a window-controlled selective-repeat ARQ scheme for error control between two adjacent nodes lying on a communication path. In this scheme, each packet to be transmitted is endowed with a serial number in a cyclic and sequential fashion. In turn, the transmitting node is not allowed to transmit a packet belonging to a window before every packet in the previous window is positively acknowledged. Such postponement of packet transmission incurs a degradation in throughput and delay performance. In this paper, aiming at improving packet delay performance, we employs a supplement scheme in which a serial number is duplicated within a frame. Classifying duplication rules into fixed, random and adaptive categories, we present candidate rules in each category and evaluate the packet delay performance induced by each duplication rule. From numerical examples, we observe that duplicating serial numbers, especially ADR-T2 effectively reduces mean packet delay for the forward channel characterized by a low packet error rate. We also reveal that such delay enhancement is achieved by a high probability of hitting local optimal window size.