scholarly journals Interoperability between Real and Virtual Environments Connected by a GAN for the Path-Planning Problem

2021 ◽  
Vol 11 (21) ◽  
pp. 10445
Author(s):  
Javier Maldonado-Romo ◽  
Mario Aldape-Pérez

Path planning is a fundamental issue in robotic systems because it requires coordination between the environment and an agent. The path-planning generator is composed of two modules: perception and planning. The first module scans the environment to determine the location, detect obstacles, estimate objects in motion, and build the planner module’s restrictions. On the other hand, the second module controls the flight of the system. This process is computationally expensive and requires adequate performance to avoid accidents. For this reason, we propose a novel solution to improve conventional robotic systems’ functions, such as systems having a small-capacity battery, a restricted size, and a limited number of sensors, using fewer elements. A navigation dataset was generated through a virtual simulator and a generative adversarial network to connect the virtual and real environments under an end-to-end approach. Furthermore, three path generators were analyzed using deep-learning solutions: a deep convolutional neural network, hierarchical clustering, and an auto-encoder. Since the path generators share a characteristic vector, transfer learning approaches complex problems by using solutions with fewer features, minimizing the costs and optimizing the resources of conventional system architectures, thus improving the limitations with respect to the implementation in embedded devices. Finally, a visualizer applying augmented reality was used to display the path generated by the proposed system.

2015 ◽  
Vol 21 (4) ◽  
pp. 949-964 ◽  
Author(s):  
Alejandro Hidalgo-Paniagua ◽  
Miguel A. Vega-Rodríguez ◽  
Joaquín Ferruz ◽  
Nieves Pavón

Robotica ◽  
2021 ◽  
pp. 1-30
Author(s):  
Ümit Yerlikaya ◽  
R.Tuna Balkan

Abstract Instead of using the tedious process of manual positioning, an off-line path planning algorithm has been developed for military turrets to improve their accuracy and efficiency. In the scope of this research, an algorithm is proposed to search a path in three different types of configuration spaces which are rectangular-, circular-, and torus-shaped by providing three converging options named as fast, medium, and optimum depending on the application. With the help of the proposed algorithm, 4-dimensional (D) path planning problem was realized as 2-D + 2-D by using six sequences and their options. The results obtained were simulated and no collision was observed between any bodies in these three options.


Author(s):  
Duane W. Storti ◽  
Debasish Dutta

Abstract We consider the path planning problem for a spherical object moving through a three-dimensional environment composed of spherical obstacles. Given a starting point and a terminal or target point, we wish to determine a collision free path from start to target for the moving sphere. We define an interference index to count the number of configuration space obstacles whose surfaces interfere simultaneously. In this paper, we present algorithms for navigating the sphere when the interference index is ≤ 2. While a global calculation is necessary to characterize the environment as a whole, only local knowledge is needed for path construction.


1998 ◽  
Vol 29 (8) ◽  
pp. 807-868 ◽  
Author(s):  
ALBERT Y. ZOMAYA MATT R. WRIGHT TAR

Manufacturing ◽  
2002 ◽  
Author(s):  
Mahadevan Balasubramaniam ◽  
Taejung Kim ◽  
Sanjay Sarma

In previous work, we and others have developed visibility-based tool path generation schemes. Almost all previous research implicitly assumes that all visible parts are machinable. Though usually true practice, this assumption hides several subtleties inherent to the geometry of the machining process. Here, we define machinability in a stricter sense, as a generalization of the robotic path planning problem. Then, we define various “tight” necessary conditions for strict machinability, and show the connections between these conditions. After demonstrating the richness of the information contained in visibility, we show how to compute visibility effectively. Visible directions constitute an approximate feasible configuration space of a cutting tool. We also address questions pertaining to the topological connectivity of the feasible space. The theoretical results of this paper lay down a firmer foundation of machining path planning.


Author(s):  
C. Y. Liu ◽  
R. W. Mayne

Abstract This paper considers the problem of robot path planning by optimization methods. It focuses on the use of recursive quadratic programming (RQP) for the optimization process and presents a formulation of the three dimensional path planning problem developed for compatibility with the RQP selling. An approach 10 distance-to-contact and interference calculations appropriate for RQP is described as well as a strategy for gradient computations which are critical to applying any efficient nonlinear programming method. Symbolic computation has been used for general six degree-of-freedom transformations of the robot links and to provide analytical derivative expressions. Example problems in path planning are presented for a simple 3-D robot. One example includes adjustments in geometry and introduces the concept of integrating 3-D path planning with geometric design.


Sign in / Sign up

Export Citation Format

Share Document