Simulation Language for Multiple Mobile Robots

1997 ◽  
Vol 9 (5) ◽  
pp. 373-379
Author(s):  
Yoshinobu Adachi ◽  
◽  
Masayoshi Kakikura ◽  
Keyword(s):  
Path Planning ◽  
Mobile Robots ◽  
Graph Structure ◽  
Multiple Robots ◽  
Robot System ◽  
Multiple Mobile Robots ◽  
Simulation Language ◽  
Optimum Path ◽  
The Given ◽  
Planning Problems

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.

Environment Recognition and Path Planning by Multiple Mobile Robots

1997 ◽  
Vol 9 (5) ◽  
pp. 380-386
Author(s):  
Toshiyuki Kumaki ◽  
◽  
Masahito Nakajima ◽  
Masayoshi Kakikura ◽  
Keyword(s):  
Path Planning ◽  
Mobile Robots ◽  
Simulation Experiment ◽  
Distributed Coordination ◽  
Multiple Robots ◽  
Multiple Mobile Robots ◽  
Unknown Environments ◽  
Environment Recognition ◽  
Coordination Work ◽  
Observation Method

This article, concerned with a part of the research on distributed coordination work by multiple robots, discusses an algorithm for creating maps of unknown environments which are searched for and observed by multiple mobile robots, and on the results of a simulation experiment using this algorithm. This algorithm comprises a moving method, an observation method, and a task planning method which are intended to help the multiple mobile robots carry out an efficient search of unknown environments.

Effects of Multi-Robot Team Formations on Distributed Area Coverage

2019 ◽  
pp. 1192-1219
Author(s):  
Prithviraj Dasgupta ◽  
Taylor Whipple ◽  
Ke Cheng
Keyword(s):  
Mobile Robots ◽  
Area Coverage ◽  
Experimental Results ◽  
Wheel Slip ◽  
Robot System ◽  
Multiple Mobile Robots ◽  
Unknown Environment ◽  
Robot Teams ◽  
And Performance ◽  
Multi Robot

This paper examines the problem of distributed coverage of an initially unknown environment using a multi-robot system. Specifically, focus is on a coverage technique for coordinating teams of multiple mobile robots that are deployed and maintained in a certain formation while covering the environment. The technique is analyzed theoretically and experimentally to verify its operation and performance within the Webots robot simulator, as well as on physical robots. Experimental results show that the described coverage technique with robot teams moving in formation can perform comparably with a technique where the robots move individually while covering the environment. The authors also quantify the effect of various parameters of the system, such as the size of the robot teams, the presence of localization, and wheel slip noise, as well as environment related features like the size of the environment and the presence of obstacles and walls on the performance of the area coverage operation.

Cooperative Towing With Multiple Robots

2008 ◽  
Author(s):  
Jonathan Fink ◽  
Peng Cheng ◽  
Vijay Kumar
Keyword(s):  
Mobile Robots ◽  
Dry Friction ◽  
Equations Of Motion ◽  
Static Model ◽  
Multiple Robots ◽  
Coordinated Motion ◽  
Multiple Mobile Robots ◽  
Basic Concepts ◽  
Simulation Results

In this paper, we address the cooperative towing of payloads by multiple mobile robots in the plane. Robots are attached via cables to a planar object or a pallet carrying a payload. Coordinated motion by the robots allow the payload to be manipulated through a planar, warehouse-like environment. We formulate a quasi-static model for manipulation and derive equations of motion that yield the motion of the payload for a prescribed motion of the robots in the presence of dry friction and tension constraints. We present experimental and simulation results that demonstrate the basic concepts.

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
Keyword(s):  
Mobile Robots ◽  
Configuration Space ◽  
Mode Transition ◽  
Transition Graph ◽  
Multiple Mobile Robots ◽  
Force Closure ◽  
The Given

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.

Effects of Multi-Robot Team Formations on Distributed Area Coverage

2011 ◽  
Vol 2 (1) ◽  
pp. 44-69 ◽  
Author(s):  
Prithviraj Dasgupta ◽  
Taylor Whipple ◽  
Ke Cheng
Keyword(s):  
Mobile Robots ◽  
Area Coverage ◽  
Experimental Results ◽  
Wheel Slip ◽  
Robot System ◽  
Multiple Mobile Robots ◽  
Unknown Environment ◽  
Robot Teams ◽  
And Performance ◽  
Multi Robot

This paper examines the problem of distributed coverage of an initially unknown environment using a multi-robot system. Specifically, focus is on a coverage technique for coordinating teams of multiple mobile robots that are deployed and maintained in a certain formation while covering the environment. The technique is analyzed theoretically and experimentally to verify its operation and performance within the Webots robot simulator, as well as on physical robots. Experimental results show that the described coverage technique with robot teams moving in formation can perform comparably with a technique where the robots move individually while covering the environment. The authors also quantify the effect of various parameters of the system, such as the size of the robot teams, the presence of localization, and wheel slip noise, as well as environment related features like the size of the environment and the presence of obstacles and walls on the performance of the area coverage operation.

Sign in / Sign up

Export Citation Format

Share Document