Lessons learned in a ball fetch-and-carry robotic competition

• Autorzy: Cigolini M. , Costalunga A. , Parisi F. , Patander R. , Salsi I. , Signifredi A. , Valeriani D. , Rizzini D. L. , Caselli S.
• Języki publikacji: EN

Abstrakty

EN

Robot competitions are effective means to learn the issues of autonomous systems on the field, by solving a complex problem end-to-end. In this paper, we illustrate Red Beard Button, the robotic system that we developed for the Sick Robot Day 2012 competition, and we highlight notions about design and implementation of robotic systems acquired through this experience. The aim of the contest was to detect, fetch and carry balls with an assigned color to a dropping area, similarly to a foraging navigation task. The developed robotic system was required to perceive colored balls, to grasp and transport balls, and to localize itself and navigate to assigned areas. Through extensive experiments the team developed an initial prototype, discovered pitialls, revised the initial assumptions and design decisions, and took advantage of the iteration process to perform successfully at the compe tition.

Słowa kluczowe

EN

Robotic Competition

• Wydawca: Łukasiewicz Industrial Research Institute for Automation and Measurements PIAP
• Czasopismo: Journal of Automation Mobile Robotics and Intelligent Systems
• Rocznik: 2014
• Tom: Vol. 8, No. 1
• Strony: 82--90
• Opis fizyczny: Bibliogr. 12 poz., rys.

Twórcy

autor

Cigolini M.

• Dipartimento di Ingegneria dell’Informazione, University of Parma, viale Parco Area delle Scienze, 181A, 43124 Parma, Italy, www: http://rimlab.ce.unipr.it/

autor

Costalunga A.

• Dipartimento di Ingegneria dell’Informazione, University of Parma, viale Parco Area delle Scienze, 181A, 43124 Parma, Italy, www: http://rimlab.ce.unipr.it/

autor

Parisi F.

• Dipartimento di Ingegneria dell’Informazione, University of Parma, viale Parco Area delle Scienze, 181A, 43124 Parma, Italy, www: http://rimlab.ce.unipr.it/

autor

Patander R.

• Dipartimento di Ingegneria dell’Informazione, University of Parma, viale Parco Area delle Scienze, 181A, 43124 Parma, Italy, www: http://rimlab.ce.unipr.it/

autor

Salsi I.

• Dipartimento di Ingegneria dell’Informazione, University of Parma, viale Parco Area delle Scienze, 181A, 43124 Parma, Italy, www: http://rimlab.ce.unipr.it/

autor

Signifredi A.

• Dipartimento di Ingegneria dell’Informazione, University of Parma, viale Parco Area delle Scienze, 181A, 43124 Parma, Italy, www: http://rimlab.ce.unipr.it/

autor

Valeriani D.

• Dipartimento di Ingegneria dell’Informazione, University of Parma, viale Parco Area delle Scienze, 181A, 43124 Parma, Italy, www: http://rimlab.ce.unipr.it/

autor

Rizzini D. L.

• Dipartimento di Ingegneria dell’Informazione, University of Parma, viale Parco Area delle Scienze, 181A, 43124 Parma, Italy, www: http://rimlab.ce.unipr.it/

autor

Caselli S.

• Dipartimento di Ingegneria dell’Informazione, University of Parma, viale Parco Area delle Scienze, 181A, 43124 Parma, Italy, www: http://rimlab.ce.unipr.it/

Bibliografia

• [1] P. Althaus and H. I. Christensen, “Behaviour coordination in structured environments”, Annals of Mathematical Statistics, vol. 17, no. 7, 2003, pp. 657–674, DOI 10.1109/IRDS.2002.1041610.
• [2] R. Arkin, Behavior-Based Robotics, MIT Press, 1998, ISBN 978-0262011655.
• [3] K. O. Arras. Feature-Based Robot Navigation in Known and Unknown Environments. PhD thesis, Swiss Federal Institute of Technology Lausanne (EPFL), Thèse No. 2765, June 2003. DOI10.5075/ep􀏐l-thesis-2765.
• [4] T. Braeunl, “Research Relevance of Mobile Robot Competitions”, IEEE Robotics & Automation Magazine, vol. 6, no. 4, 1999, pp. 32–37, DOI 10.1109/100.813825.
• [5] J. Bruce, T. Balch, and M. Veloso, “Fast and Inexpensive Color Image Segmentation for Interactive Robots”. In: Proc. of the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems (IROS), 2000, pp.2061–2066, DOI 10.1109/IROS.2000.895274.
• [6] J. Castellanos, J. Montiel, J. Neira, and J. Tardos, “The SPmap: A Probabilistic Framework for Simultaneous Localization and Map Building”, IEEE Transactions on Robotics, vol. 15, no. 5, 1999, pp. 948–952, DOI 10.1109/70.795798.
• [7] A. Censi, L. Iocchi, and G. Grisetti, “Scan matching in the Hough domain”. In: Proc. of the IEEE Int. Conf. on Robotics & Automation (ICRA), 2005, pp. 2739–2744, DOI 10.1109/ROBOT.2005.1570528.
• [8] D. Douglas and T. Peuker, “Algorithms for the reduction of the number of points required to represent a digitized line or its caricature”, Cartogr. Int. J. Geogr. Inf. Geovis., vol. 10, no. 2, 1973, pp. 112–122, DOI 10.3138/FM57-6770-U75U- 7727.
• [9] R. Kuemmerle, G. Grisetti, H. Strasdat, K. Konolige, and W. Burgard, “g2o: A general framework for graph optimization”. In: Proc. of the IEEE Int. Conf. on Robotics & Automation (ICRA), 2011, pp. 3607–3613, DOI 10.1109/ICRA.2011.5979949.
• [10] P. Lima and R. Cortesao, “IROS 2012 Competitions”, IEEE Robotics & Automation Magazine, vol. 20, no. 1, 2013, pp. 10–12, DOI 10.1109/MRA.2012.2236232.
• [11] S. Thrun, W. Burgard, and D. Fox, Probabilistic Robotics, MIT Press: Cambridge, MA, 2005, DOI 10.1017/S0269888906210993.
• [12] Q. Zhang and R. Pless, “Extrinsic calibration of a camera and laser range fiinder (improves camera calibration)”. In: Proc. of the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems (IROS), 2004, pp. 2301–2306, DOI 10.1109/IROS.2004.1389752.