Abstract
We study a distributed approach to path planning. We focus on holonomic kinematic motion in cluttered 2D areas. The problem consists in defining the precise sequence of roto-translations of a rigid object of arbitrary shape that has to be transported from an initial to a final location through a large, cluttered environment. Our planning system is implemented as a swarm of flying robots that are initially deployed in the environment and take static positions at the ceiling. Each robot is equipped with a camera and only sees a portion of the area below. Each robot acts as a local planner: it calculates the part of the path relative to the area it sees, and exchanges information with its neighbors through a wireless connection. This way, the robot swarm realizes a cooperative distributed calculation of the path. The path is communicated to ground robots, which move the object. We introduce a number of strategies to improve the system’s performance in terms of scalability, resource efficiency, and robustness to alignment errors in the robot camera network. We report extensive simulation results that show the validity of our approach, considering a variety of object shapes and environments.
This research was partially supported by the Swiss National Science Foundation through the National Centre of Competence in Research Robotics.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Barraquand, J., Langlois, B., Latombe, J.: Numerical potential field techniques for robot path planning. IEEE Trans. on Sys., Man and Cyb. 22(2), 224–241 (1992)
Birk, A., Carpin, S.: Merging occupancy grid maps from multiple robots. Proceedings of the IEEE, Special Issue on Multi-Robot Systems 94(7), 1384–1397 (2006)
Choset, H., Lynch, K., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Cambridge (2005)
Durrant-Whyte, H., Bailey, T.: Simultaneous localisation and mapping (SLAM): The essential algorithms. IEEE Robotics and Automation Magazine (June 2006)
Garrido, S., Moreno, L., Blanco, D.: Voronoi diagram and fast marching applied to path planning. In: IEEE Int. Conf. on Robotics and Automation, ICRA (2006)
Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. on Sys., Sc. and Cyb. 4(2), 100–107 (1968)
Latombe, J.-C.: A fast path planner for a car-like indoor mobile robot. In: Proceedings of the 9th National Conf. on Artificial Intelligence, pp. 659–665 (1991)
Latombe, J.-C.: Robot Motion Planning. Kluwer Academic, Dordrecht (1991)
LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)
Roberts, J., Stirling, T., Zufferey, J.-C., Floreano, D.: 3-D range and bearing sensor for collective flying robots. Journal of Field Robotics (submitted, 2011)
Stirling, T., Wischmann, S., Floreano, D.: Energy-efficient indoor search by swarms of simulated flying robots without global information. Swarm Intelligence 4(2), 117–143 (2010)
Takahashi, O., Shilling, R.J.: Motion planning in a plane using generalized voronoi diagrams. IEEE Trans. on Robotics and Automation 5(2), 143–150 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reina, A., Di Caro, G.A., Ducatelle, F., Gambardella, L.M. (2011). Distributed Motion Planning for Ground Objects Using a Network of Robotic Ceiling Cameras. In: Groß, R., Alboul, L., Melhuish, C., Witkowski, M., Prescott, T.J., Penders, J. (eds) Towards Autonomous Robotic Systems. TAROS 2011. Lecture Notes in Computer Science(), vol 6856. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23232-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-23232-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23231-2
Online ISBN: 978-3-642-23232-9
eBook Packages: Computer ScienceComputer Science (R0)