scholarly journals Analysis of Acceleration Bounds and Mobility for Multiple Robot Systems Based on Null Space Analysis Method

2006 ◽  
Vol 12 (5) ◽  
pp. 497-504
Robotics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 55
Author(s):  
Diogo Matos ◽  
Pedro Costa ◽  
José Lima ◽  
Paulo Costa

Most path planning algorithms used presently in multi-robot systems are based on offline planning. The Timed Enhanced A* (TEA*) algorithm gives the possibility of planning in real time, rather than planning in advance, by using a temporal estimation of the robot’s positions at any given time. In this article, the implementation of a control system for multi-robot applications that operate in environments where communication faults can occur and where entire sections of the environment may not have any connection to the communication network will be presented. This system uses the TEA* to plan multiple robot paths and a supervision system to control communications. The supervision system supervises the communication with the robots and checks whether the robot’s movements are synchronized. The implemented system allowed the creation and execution of paths for the robots that were both safe and kept the temporal efficiency of the TEA* algorithm. Using the Simtwo2020 simulation software, capable of simulating movement dynamics and the Lazarus development environment, it was possible to simulate the execution of several different missions by the implemented system and analyze their results.


Robotica ◽  
2001 ◽  
Vol 19 (5) ◽  
pp. 581-591 ◽  
Author(s):  
Jihong Lee

In this paper, the analysis of manipulability of robotic systems comprised of multiple cooperating arms is considered. Given bounds on the capabilities of joint actuators for each robot, the purpose of this study is to derive the bounds for task velocity achievable by the system. Since bounds on each joint velocity form a polytope in joint-velocity space and the task space velocity is connected with joint velocity through Jacobian matrices of each robot, the allowable task velocity space, i.e. velocity workspace, for multiple cooperating robot system is also represented as a polytope which is called manipulability polytope throughout this paper. Based on the fact that the boundaries of the manipulability polytope are mapped from the boundaries of allowable joint-velocity space, slack variables are introduced in order to transform given inequality constraint given on joint velocities into a set of normal linear equalities in which the unknowns of the equation are composed of the vertices of manipulability polytope, vectors spanning the null space of the Jacobian matrix, and the slack variables. Either redundant or nonredundant cooperating robot systems can be handled with the proposed technique. Several different application examples including simple SCARA-type robots as well as complex articulated robot manipulators are included, and, under the assumption of firm grip, it will be shown that the calculated manipulability polytope for cooperating robot system is actually the intersection of all the manipulability polytopes of every single robot which is hard to be derived through geometrical manipulation.


1992 ◽  
Vol 16 (4) ◽  
pp. 177-186 ◽  
Author(s):  
G. Jimenez ◽  
J.L. Sevillano ◽  
A. Civit-Balcells ◽  
F. Diaz ◽  
A. Civit-Breu
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document