scholarly journals Modal Planning for Cooperative Non-Prehensile Manipulation by Mobile Robots

2019 ◽  
Vol 9 (3) ◽  
pp. 462 ◽  
Author(s):  
Changxiang Fan ◽  
Shouhei Shirafuji ◽  
Jun Ota

If we define a mode as a set of specific configurations that hold the same constraint, and if we investigate their transitions beforehand, we can efficiently probe the configuration space by using a manipulation planner. However, when multiple mobile robots together manipulate an object by using the non-prehensile method, the candidates for the modes and their transitions become enormous because of the numerous contacts among the object, the environment, and the robots. In some cases, the constraints on the object, which include a combination of robot contacts and environmental contacts, are incapable of guaranteeing the object’s stability. Furthermore, some transitions cannot appear because of geometrical and functional restrictions of the robots. Therefore, in this paper, we propose a method to narrow down the possible modes and transitions between modes by excluding the impossible modes and transitions from the viewpoint of statics, kinematics, and geometry. We first generated modes that described an object’s contact set from the robots and the environment while ignoring their exact configurations. Each multi-contact set exerted by the robots and the environment satisfied the condition necessary for the force closure on the object along with gravity. Second, we listed every possible transition between the modes by determining whether or not the given robot could actively change the contacts with geometrical feasibility. Finally, we performed two simulations to validate our method on specific manipulation tasks. Our method can be used in various cases of non-prehensile manipulations by using mobile robots. The mode transition graph generated by our method was used to efficiently sequence the manipulation actions before deciding the detailed configuration planning.

1997 ◽  
Vol 9 (5) ◽  
pp. 373-379
Author(s):  
Yoshinobu Adachi ◽  
◽  
Masayoshi Kakikura ◽  

The purpose of this paper is to propose a design concept for a simulation language to be used in path planning in a multiple mobile robots system. The paper also includes some examples of programming of path planning for multiple mobile robots. In some path planning problems with mobile robots, graph theory can be a powerful tool. In our system, the environment information of the robots is represented in a graph structure. By handling this graph with a programming language, path planning tasks can be executed in a systematic way. Each task of the multiple mobile robots can be described using a Petrinet expression, and several features of the given robot system, for example, the optimum path problem, the deadlock problem of multiple robots, etc., can be deduced using the network model.


Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 4156
Author(s):  
Luís B. P. Nascimento ◽  
Dennis Barrios-Aranibar ◽  
Vitor G. Santos ◽  
Diego S. Pereira ◽  
William C. Ribeiro ◽  
...  

The planning of safe paths is an important issue for autonomous robot systems. The Probabilistic Foam method (PFM) is a planner that guarantees safe paths bounded by a sequence of structures called bubbles that provides safe regions. This method performs the planning by covering the free configuration space with bubbles, an approach analogous to a breadth-first search. To improve the propagation process and keep the safety, we present three algorithms based on Probabilistic Foam: Goal-biased Probabilistic Foam (GBPF), Radius-biased Probabilistic Foam (RBPF), and Heuristic-guided Probabilistic Foam (HPF); the last two are proposed in this work. The variant GBPF is fast, HPF finds short paths, and RBPF finds high-clearance paths. Some simulations were performed using four different maps to analyze the behavior and performance of the methods. Besides, the safety was analyzed considering the new propagation strategies.


2019 ◽  
Vol 16 (4) ◽  
pp. 172988141986038
Author(s):  
Huang Yiqing ◽  
Wang Hui ◽  
Wei Lisheng ◽  
Gao Wengen ◽  
Ge Yuan

This article presented a cooperative mapping technique using a novel edge gradient algorithm for multiple mobile robots. The proposed edge gradient algorithm can be divided into four behaviors such as adjusting the movement direction, evaluating the safety of motion behavior, following behavior, and obstacle information exchange, which can effectively prevent multiple mobile robots falling into concave obstacle areas. Meanwhile, a visual field factor is constructed based on biological principles so that the mobile robots can have a larger field of view when moving away from obstacles. Also, the visual field factor will be narrowed due to the obstruction of the obstacle when approaching an obstacle and the obtained map-building data are more accurate. Finally, three sets of simulation and experimental results demonstrate the performance superiority of the presented algorithm.


2002 ◽  
Vol 68 (665) ◽  
pp. 165-172
Author(s):  
Atsushi YAMASHITA ◽  
Masaki FUKUCHI ◽  
Jun OTA ◽  
Tamio ARAI ◽  
Hajime ASAMA

1992 ◽  
Vol 63 (1-2) ◽  
pp. 55-85 ◽  
Author(s):  
B.J. Oommen ◽  
I. Reichstein

Sign in / Sign up

Export Citation Format

Share Document