Abstract
In this paper, we propose an off-line planning algorithm for cooperative tasks of multiple mobile robots. Sweeping means a motion that a robot covers a 2-dimensional area by its effecter. Sweeping of a whole work area and transporting some objects are fundamental and essential motions of mobile robot’s tasks. It is more effective if a robot can move an obstacle during a sweepingr task as if we clean our room with relocating chairs. This is the most basic task that combines sweeping and transporting. We make models of sweeping and relocation of obstacles, and propose an algorithm to find appropriate path for robot and way of relocation for each obstacle. We analyze motions of robots with relocation in both time and space by applying the LT graph. On the basis of the analysis the algorithm avoids collisions between a robot and an obstacle, and equalize working time of each robot. By the algorithm total time to sweep will be minimized. We verify the efficiency of the algorithm through simulations, and apply the proposed algorithm to real mobile robot system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Latombe, J.C.: Robot Motion Planning,Kluwer Academic Publishers, 1991.
Ota, J., Arai, T., Kurabayashi, D.: Dynamic Grouping in Multiple Mobile Robots System, Proc. of IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 1993, pp. 1963–1970.
Stilwell, D.J., Bay, J.S.: Towards the Development of a Material Transport System Using Swarms of Ant-like Robots, Proc. of IEEE Int. Conf. on Robotics and Automation, 1993, pp. 766–771.
Hofner, C., Shmidt, G.: Path Planning and Guidance Techniques for an Autonomous Mobile Cleaning Robot, Robotics and Autonomous Systems, Vol. 14, 1995, pp. 199–212.
Held, M.: On the Computational Geometry of Pocket Machining, Lecture Notes in Computer Science 500, 1991.
Kurabayashi, D., Ota, J., Arai, T., Yoshida, E.: Cooperative Sweeping by Multiple Mobile Robots, Proc. of IEEE Int. Conf. on Robotics and Automation,1996, pp. 17441749.
Balch, T., Arkin, R.C.: Communication in Reactive Multiagent Robotic Systems, Autonomous Robots, 1, 1994, pp. 27–52.
Beckers, R., Holland O.E., Deneubourg, J.L.: From Local Actions to Global Tasks: Stigmergy and Collective Robotics, Artificial Life IV, 1994, pp. 181–189.
Faltings, B., Pearl, P.: Applying Means-ends Analysis to Spatial Planning, Proc. of IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 1991, pp. 80–85.
Kant, K., Zucker, S.W.: Toward Efficient Trajectory Planning: The Path-Velocity Decomposition, IEEE Journal of Robotics Research, Vol. 5, No. 3, 1986, pp. 72–89.
Arai, T., Kimura, H., Ota, J., Kurabayashi D.: Real-time Measuring System of Relative Position on Mobile Robot System, Proc. of 24th Int. Symp. on Industrial Robots, 1993, pp. 931–938.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Japan
About this paper
Cite this paper
Kurabayashi, D. et al. (1996). Cooperative Sweeping in Environments with Movable Obstacles. In: Asama, H., Fukuda, T., Arai, T., Endo, I. (eds) Distributed Autonomous Robotic Systems 2. Springer, Tokyo. https://doi.org/10.1007/978-4-431-66942-5_23
Download citation
DOI: https://doi.org/10.1007/978-4-431-66942-5_23
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-66944-9
Online ISBN: 978-4-431-66942-5
eBook Packages: Springer Book Archive