RG-trees: trajectory-free feedback motion planning using sparse random reference governor trees

Download
2018
Gölbol, Ferhat
Sampling based methods resulted in feasible and effective motion planning algorithms for high dimensional configuration spaces and complex environments. A vast majority of such algorithms as well as their application rely on generating a set of open-loop trajectories first, which are then tracked by feedback control policies. However, controlling a dynamic robot to follow the planned path, while respecting the spatial constraints originating from the obstacles is still a challenging problem. There are some studies which combine statistical sampling techniques and feedback control methods which address this challenge using different approaches. From the feedback control theory perspective, Reference Governors proved to be a useful framework for constraint enforcement. Very recently, Arslan and Koditschek (2017) introduced a feedback motion planner that utilizes Reference Governors that provably solves the motion planning problem in simplified spherical worlds. In this context, here we propose a ``trajectory-free'' novel feedback motion planning algorithm which combines the two ideas: random trees and reference governors. Random tree part of the algorithm generates a collision-free region as a set of connected simple polygonal regions. Then, reference governor part navigates the dynamic robot from one region to the adjacent region in the tree structure, ensuring it stays inside the current region and asymptotically reaches to the connected region. Eventually, our algorithm robustly routes the robot from the start location to the goal location without collision. We demonstrate the validity and feasibility of the algorithm on simulation studies.

Suggestions

RG-Trees: Trajectory-Free Feedback Motion Planning Using Sparse Random Reference Governor Trees
Gölbol, Ferhat; Ankaralı, Mustafa Mert; Saranlı, Afşar (2018-10-05)
Sampling based methods resulted in feasible and effective motion planning algorithms for high dimensional configuration spaces and complex environments. A vast majority of such algorithms as well as their application rely on generating a set of open-loop trajectories first, which are then tracked by feedback control policies. However, controlling a dynamic robot to follow the planned path, while respecting the spatial constraints originating from the obstacles is still a challenging problem. There are some ...
Multi-objective decision making using fuzzy discrete event systems: A mobile robot example
Boutalis, Yiannis; Schmidt, Klaus Verner (2010-09-29)
In this paper, we propose an approach for the multi-objective control of sampled data systems that can be modeled as fuzzy discrete event systems (FDES). In our work, the choice of a fuzzy system representation is justified by the assumption of a controller realization that depends on various potentially imprecise sensor measurements. Our approach consists of three basic steps that are performed in each sampling instant. First, the current fuzzy state of the system is determined by a sensor evaluation. Seco...
Implementation Studies of Robot Swarm Navigation Using Potential Functions and Panel Methods
Merheb, Abdel-Razzak; GAZİ, VEYSEL; Sezer Uzol, Nilay (2016-10-01)
This paper presents a practical swarm navigation algorithm based on potential functions and properties of inviscid incompressible flows. Panel methods are used to solve the flow equations around complex shaped obstacles and to generate the flowlines, which provide collision-free paths to the goal position. Safe swarm navigation is achieved by following the generated streamlines. Potential functions are used to achieve and maintain group cohesion or a geometric formation during navigation. The algorithm is i...
Numerical Solution of Multi-scale Electromagnetic Boundary Value Problems by Utilizing Transformation-Based Metamaterials
Ozgun, Ozlem; Kuzuoğlu, Mustafa (2011-06-23)
We present numerical solution techniques for efficiently handling multi-scale electromagnetic boundary value problems having fine geometrical details or features, by utilizing spatial coordinate transformations. The principle idea is to modify the computational domain of the finite methods (such as the finite element or finite difference methods) by suitably placing anisotropic metamaterial structures whose material parameters are obtained by coordinate transformations, and hence, to devise easier and effic...
Extraction of 3D transform and scale invariant patches from range scans
Akagunduz, Erdern; Ulusoy, İlkay (2007-06-22)
An algorithm is proposed to extract transformation and scale invariant 3D fundamental elements from the surface structure of 3D range scan data. The surface is described by mean and Gaussian curvature values at every data point at various scales and a scale-space search is performed in order to extract the fundamental structures and to estimate the location and the scale of each fundamental structure. The extracted fundamental structures can later be used as nodes in a topological graph where the links betw...
Citation Formats
F. Gölbol, “RG-trees: trajectory-free feedback motion planning using sparse random reference governor trees,” M.S. - Master of Science, Middle East Technical University, 2018.