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

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


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


Available from: Emmanuel G. Collins, Mar 28, 2014
  • Source
    • "Fuzzy control is widely used to perform robust obstacle avoidance [4], [5]. This formalism allows to integrate several linguistic rules to avoid dead ends or local minima [6]. Unfortunately, its lacks of stability demonstration of the applied control laws. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Reactive navigation in very cluttered environment while insuring maximum safety and task efficiency is a challenging subject. This paper proposes online and adaptive elliptic trajectories to perform smooth and safe mobile robot navigation. These trajectories use limit-cycle principle already applied in the literature but with the difference that the applied limit-cycles are now elliptic (not circular) and are more generic and flexible to perform navigation in environments with different kinds of obstacles shape. The set points given to the robot are generated while following reactive obstacle avoidance algorithm embedded in a multi-controller architecture (Obstacle avoidance and Attraction to the target controllers). This algorithm uses specific reference frame which gives accurate indication of robot situation. The robot knows thus if it must avoid the obstacle in clockwise or counter-clockwise direction and prevent robot from local minima, dead ends and oscillations. The stability of the proposed bottom-up control architecture is proved according to Lyapunov synthesis. Simulations and experiments in different environments are performed to demonstrate the efficiency and the reliability of the proposed control architecture.
    Full-text · Conference Paper · Aug 2011
  • Source
    • "Shibata used Fuzzy Logic for fitness evaluation of the paths generated [30]. Various other approaches [6] [26] have also been proposed. "
    [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.
    Full-text · Article · Jul 2011 · Neurocomputing
  • Source
    • "for fitness evaluation of the paths generated. Various other approaches (Ordonez et al 2008; Cortes, Jaillet and Simeon 2008) have also been proposed. Zhu and Latombe (1991) used the concepts of cell decomposition and hierarchal planning. "
    [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.
    Full-text · Article · Apr 2010 · Artificial Intelligence Review
Show more