Article

The virtual wall approach to limit cycle avoidance for unmanned ground vehicles.

Robotics and Autonomous Systems (Impact Factor: 1.11). 08/2008; 56:645-657. DOI: 10.1016/j.robot.2007.11.010
Source: DBLP

ABSTRACT Robot Navigation in unknown and very cluttered environments constitutes one of the key challenges in unmanned ground vehicle (UGV) applications. Navigational limit cycles can occur when navigating (UGVs) using behavior-based or other reac- tive algorithms. Limit cycles occur when the robot is navigating towards the goal but enters an enclosure that has its opening in a direction opposite to the goal. The robot then becomes efiectively trapped in the enclosure. This paper presents a solution named the Virtual Wall Approach (VWA) to the limit cycle problem for robot navigation in very cluttered environments. This algorithm is composed of three stages: detection, retraction, and avoidance. The detection stage uses spatial memory to identify the limit cycle. Once the limit cycle has been identifled, a label- ing operator is applied to a local map of the obstacle fleld to identify the obstacle or group of obstacles that are causing the deadlock enclosure. The retraction stage deflnes a way-point for the robot outside the deadlock area. When the robot crosses the boundary of the deadlock enclosure, a virtual wall is placed near the endpoints of the enclosure to designate this area as ofi-limits. Finally, the robot activates a virtual sensor so that it can proceed to its original goal, avoiding the virtual wall and obstacles found on its way. Simulations, experiments, and analysis of the VWA implemented on top of a preference-based fuzzy behavior system demonstrate the efiectiveness of the proposed method.

Download full-text

Full-text

Available from: Emmanuel G. Collins, Mar 28, 2014
0 Followers
 · 
104 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Path Planning is a classical problem in the field of robotics. The problem is to find a path of the robot given the various obstacles. The problem has attracted the attention of numerous researchers due to the associated complexities, uncertainties and real time nature. In this paper we propose a new algorithm for solving the problem of path planning in a static environment. The algorithm makes use of an algorithm developed earlier by the authors called Multi-Neuron Heuristic Search (MNHS). This algorithm is a modified A⁎ algorithm that performs better than normal A⁎ when heuristics are prone to sharp changes. This algorithm has been implemented in a hierarchical manner, where each generation of the algorithm gives a more detailed path that has a higher reaching probability. The map used for this purpose is based on a probabilistic approach where we measure the probability of collision with obstacle while traveling inside the cell. As we decompose the cells, the cell size reduces and the probability starts to touch 0 or 1 depending upon the presence or absence of obstacles in the cell. In this approach, it is not compulsory to run the entire algorithm. We may rather break after a certain degree of certainty has been achieved. We tested the algorithm in numerous situations with varying degrees of complexities. The algorithm was able to give an optimal path in all the situations given. The standard A⁎ algorithm failed to give results within time in most of the situations presented.
    Neurocomputing 07/2011; 74:2314-2335. DOI:10.1016/j.neucom.2011.03.006 · 2.01 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Robotic Path planning is one of the most studied problems in the field of robotics. The problem has been solved using numerous statistical, soft computing and other approaches. In this paper we solve the problem of robotic path planning using a combination of A* algorithm and Fuzzy Inference. The A* algorithm does the higher level planning by working on a lower detail map. The algorithm finds the shortest path at the same time generating the result in a finite time. The A* algorithm is used on a probability based map. The lower level planning is done by the Fuzzy Inference System (FIS). The FIS works on the detailed graph where the occurrence of obstacles is precisely known. The FIS generates smoother paths catering to the non-holonomic constraints. The results of A* algorithm serve as a guide for FIS planner. The FIS system was initially generated using heuristic rules. Once this model was ready, the fuzzy parameters were optimized using a Genetic Algorithm. Three sample problems were created and the quality of solutions generated by FIS was used as the fitness function of the GA. The GA tried to optimize the distance from the closest obstacle, total path length and the sharpest turn at any time in the journey of the robot. The resulting FIS was easily able to plan the path of the robot. We tested the algorithm on various complex and simple paths. All paths generated were optimal in terms of path length and smoothness. The robot was easily able to escape a variety of obstacles and reach the goal in an optimal manner.
    Artificial Intelligence Review 04/2010; 33(4):307-327. DOI:10.1007/s10462-010-9157-y · 0.90 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper surveys the utilization of the wall following concept for path planning in mobile robotics and proposes an improved wall following method for escaping from local minimum encountered by the artificial potential field (APF) method used in real-time path planning. In the new algorithm, more reliable switching conditions are designed to guarantee the success of escape. Moreover, memory information of key points is incorporated in to enhance the robot's capability of making decision. It can be applied effectively in some more complicated unknown environments in which some previous wall following methods are proved to be inefficient or invalid. Simulation studies have been carried out for analyzing the memory information and verify the validity of the proposed method.
    Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009. Proceedings of the 48th IEEE Conference on; 01/2010