Abstract
We present a scalable distributed path planning algorithm for transporting a large object through an unknown environment using a group of homogeneous robots. The robots are randomly scattered across the terrain and collectively sample the obstacles in the environment in a distributed fashion. Given this sampling and the dimensions of the bounding box of the object, the robots construct a distributed configuration space. We then use a variant of the distributed Bellman-Ford algorithm to construct a shortest-path tree using a custom cost function from the goal location to all other connected robots. The cost function encompasses the work required to rotate and translate the object in addition to an extra control penalty to navigate close to obstacles. Our approach sets up a framework that allows the user to balance the trade-off between the safety of the path and the mechanical work required to move the object. The path is optimal given the sampling of the robots and user input parameters. We implemented our algorithm in both simulated and real-world environments. Our approach is robust to the size and shape of the object and adapts to dynamic environments.
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
Similar content being viewed by others
References
Cheng, C., Riley, R., Kumar, S.P.R, Garcia-Aceves, J.J.: A loop-free extended Bellman-Ford routing protocol without bouncing effect. In: SIGCOMM ’89 Symposium Proceedings on Communications Architectures and Protocols, vol. 19, pp. 224–236 (1989)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discr. Math. 86(1–3), 165–177 (1990)
Fabbri, R., Estrozi, L.F.: On Voronoi diagrams and medial axes. J. Math. Imaging Vis. 17, 27–40 (2002)
Fekete, S.P., Kamphans, T., Kröller, A., Mitchell, J.S.B., Schmidt, C.: Exploring and triangulating a region by a swarm of robots. In: 14th International Workshop, 2011, and 15th International Workshop, pp. 206–217, Princeton, NJ, USA (2011)
Ford, L., Fulkerson, D., Bland, R.: Flows in Networks, ser, Princeton Landmarks in Mathematics. Princeton University Press, Princeton (2010)
Kamio, S., Iba, H.: Random sampling algorithm for multi-agent cooperation planning. In: IROS, pp. 1265–1270. IEEE (2005)
Kamio, S., Iba, H.: Cooperative object transport with humanoid robots using rrt path planning and re-planning. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 2608–2613. IEEE (2006)
Kavraki, L., Svestka, P., claude Latombe, J., Overmars, M.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. In: ICRA, pp. 566–580 (1996)
Kleinrock, L., Silvester, J.: Optimum transmission radii for packet radio networks or why six is a magic number. In: Conference Record, National Telecommunications Conference, pp. 4.3.2–4.3.5, Birmingham, Alabama, Dec 1978
LaValle, S.M.: Rapidly-exploring random trees: a new tool for path planning. Computer Science Department, Iowa State University, Technical report (1998)
Mayya, N., Rajan, V.T.: Voronoi diagrams of polygons: a framework for shape representation. J. Math. Imaging Vis. 6(4), 355–378 (1996)
McLurkin, J.: Analysis and implementation of distributed algorithms for multi-robot systems. Ph.D. dissertation, MIT, USA (2008)
McLurkin, J., McMullen, A., Robbins, N., Habibi, G., Becker, A., Chou, A., Li, H., John, M., Okeke, N., Rykowski, J., et al.: A robot system design for low-cost multi-robot manipulation. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2014), pp. 912–918. IEEE (2014)
O’Hara, K.J.O., Balch, T.R.: Distributed path planning for robots in dynamic environments using a pervasive embedded network. In: Proceedings of the Thrid International Joint Conference on Autonomous Agent and Multiagent Systems, pp. 1538–1539, July 2004
Parra-González, E.F., RamÃrez-Torres, J.G., Toscano-Pulido, G.: A new object path planner for the box pushing problem. In: Electronics, Robotics and Automotive Mechanics Conference: CERMA’09, pp. 119–124. IEEE (2009)
Reina, A., Di Caro, G.A., Ducatelle, F., Gambardella, L.M.: Distributed motion planning for ground objects using a network of robotic ceiling cameras. In: Towards Autonomous Robotic Systems, pp. 137–148. Springer (2011)
Yamashita, A., Arai, T., Ota, J., Asama, H.: Motion planning of multiple mobile robots for cooperative manipulation and transportation. IEEE Trans. Robot. Autom. 19, 223–237 (2003)
Acknowledgments
The authors would like to thank Zachary Kingston for his tremendous help in running experiments on real robots. This work has been supported by National Science Foundation, Division of Computer and Network Systems under CNS-1330085.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Japan
About this paper
Cite this paper
Habibi, G., Xie, W., Jellins, M., McLurkin, J. (2016). Distributed Path Planning for Collective Transport Using Homogeneous Multi-robot Systems. In: Chong, NY., Cho, YJ. (eds) Distributed Autonomous Robotic Systems. Springer Tracts in Advanced Robotics, vol 112 . Springer, Tokyo. https://doi.org/10.1007/978-4-431-55879-8_11
Download citation
DOI: https://doi.org/10.1007/978-4-431-55879-8_11
Published:
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-55877-4
Online ISBN: 978-4-431-55879-8
eBook Packages: EngineeringEngineering (R0)