Skip to main content
SpringerLink
Log in

Combinatorial Optimization and Performance Analysis of a Multi-arm Cartesian Robotic Fruit Harvester—Extensions of Graph Coloring

  • Published:
Journal of Intelligent & Robotic Systems Aims and scope Submit manuscript

Abstract

A mobile melon robotic harvester consisting of multiple Cartesian manipulators, each with three degrees of freedom, is being developed. In order to design an optimal robot in terms of number of arms, manipulator capabilities, and robot speed, a method of allocating the fruits to be picked by each manipulator in a way that yields the maximum harvest has been developed. Such a method has already been devised for a multi-arm robot with 2DOF each. The maximum robotic harvesting problem was shown there to be an example of the maximum k-colorable subgraph problem (MKCSP) on an interval graph. However, for manipulators with 3DOF, the additional longitudinal motion results in variable intervals. To overcome this issue, we devise a new model based on the color-dependent interval graph (CDIG). This enables the harvest by multiple robotic arms to be modeled as a modified version of the MKCSP. Based on previous research, we develop a greedy algorithm that solves the problem in polynomial time, and prove its optimality using induction. As with the multi-arm 2DOF robot, when simulated numerous times on a field of randomly distributed fruits, the algorithm yields a nearly identical percentage of fruit harvested for given robot parameters. The results of the probabilistic analysis developed for the 2DOF robot was modified to yield a formula for the expected harvest ratio of the 3DOF robot. The significance of this method is that it enables selecting the most efficient actuators, number of manipulators, and robot forward velocity for maximal robotic fruit harvest.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Srinivasan, N.: Profitability in Agriculture and Inclusive Growth, CAB Calling, pp. 18-22, January-March (2007)

  2. Pedersen, S., Fountas, S., Have, H., Blackmore, B.: Agricultural robots—system analysis and economic feasibility. Precis. Agric. 7, 295–308 (2006)

    Article  Google Scholar 

  3. Pedersen, S., Fountas, S., Blackmore, S.: Agricultural robots – applications and economic perspectives. In: Service Robot Applications, InTech Education and Publishing, pp 369–382 (2008)

  4. Maimon, O.: The robot task-sequencing planning problem. In: IEEE Trans. Robot. Autom. (1990)

  5. Lin, C., Tsai, W.: Optimal Assignment of Robot Tasks with Precedence for Multi-Robot Coordination by Disjunctive Graphs and State-Space Search∗. J. Robot. Syst. 12(4), 219–236 (1995)

    Article  MathSciNet  Google Scholar 

  6. Valle, C. D., Camacho, E.: Automatic assembly task assignment for a multirobot environment. Control. Eng. Pract. 4(7), 915–921 (1996)

    Article  Google Scholar 

  7. Mattone, R., Divona, M., Wolf, A.: Sorting of items on a moving conveyor belt. Part 2: performance evaluation and optimization of pick-and-place operations. Robot. Comput. Integr. Manuf. 16, 81–90 (2000)

    Article  Google Scholar 

  8. Bozma, h., Kalalioglu, M.: Multirobot coordination in pick-and-place tasks on a moving conveyor. Robot. Comput. Integr. Manuf. 28, 530–538 (2012)

    Article  Google Scholar 

  9. Comba, L., Belforte, G., Gay, P.: Plant layout and pick-and-place strategies for improving performances in secondary packaging plants of food products. Packag. Technol. Sci. 26(6), 339–354 (2012)

  10. Edan, Y., Engel, B., Miles, G.: Intelligent control system simulation of an agricultural robot. J. Intell. Robot. Syst. 8(2), 267–284 (1993)

    Article  Google Scholar 

  11. Mann, M., Rubinstein, D., Shmulevich, I., Zion, B.: Motion planning of a mobile Cartesian manipulator for optimal harvesting of 2-d crops. Trans. ASABE 57(1), 283–295 (2014)

    Google Scholar 

  12. Mann, M., Rubinstein, D., Shmulevich, I., Zion, B.: Determination of robotic melon harvesting efficiency: a probabilistic approach. Submitted to J. Optim. (2014)

  13. Mann, M., Zion, B., Shmulevich, I., Rubinstein, D., Linker, R.: Multi-manipulator robotic fruit harvesting – combinatorial optimization and performance analysis using graph coloring theory. Submitted to IEEE Trans. Robot. Autom. (2014)

  14. Zion, B., Mann, M., Levin, D., Rubinstein, D., Shmulevich, I.: Harvest-order planning for a multiarm robotic harvester. Inf. Process. Lett. 103, 75–81 (2014)

    Google Scholar 

  15. Narasimhan, G.: Narasimhan. The maximum K-colorable subgraph problem (1989)

  16. Wolf, I., Bar-Or, J., Edan, Y., Peiper, U.: Developing grippers for a melon harvesting robot. Trans. ASABE 90, 9–17 (1990)

  17. Vansteenwegen, P., Souffriau, W., van Oudheusen, D.: The orienteering problem: A survey. Eur. J. Oper. Res. 209, 1–10 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  18. Margot, F.: Symmetry in integer linear programming. In: 50 Years of Integer Programming 1958-2008, pp 647–686. Springer, Berlin Heidelberg (2010)

    Book  MATH  Google Scholar 

  19. Fomin, F., Lingas, A.: Approximation algorithms for time-dependent orienteering. Inf. Process. Lett. 83, 57–62 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  20. Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G., Vathis, N.: Efficient heuristics for the time dependent team orienteering problem with time windows. In: 1st International Conference on Applied Algorithms, Kolkata, India (2014)

  21. Januschowski, T., Pfetsch, M.: The maximum k-colorable subgraph problem and orbitopes. Discret. Optim. 8, 478–494 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  22. Carlisle, M., Lloyd, E.: On the k-coloring of intervals. Discret. Appl. Math. 59, 225–235 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  23. Yannakakis, M., Gavril, F.: The maximum k-colorable subgraph problem for chordal graphs. Inf. Process. Lett. 24, 133–137 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  24. Cormen, T., Leiserson, C., Rivest, R., Stein, C., 2nd ed.: Introduction to algorithms. MIT Press, Cambridge (2003)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technion, Haifa, Israel

    Moshe P. Mann, Itzhak Shmulevich, Dror Rubinstein & Raphael Linker

  2. Volcani Agricultural Research Center, Beit Dagan, Israel

    Boaz Zion

Authors
  1. Moshe P. Mann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Boaz Zion
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Itzhak Shmulevich
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dror Rubinstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Raphael Linker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Moshe P. Mann.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mann, M.P., Zion, B., Shmulevich, I. et al. Combinatorial Optimization and Performance Analysis of a Multi-arm Cartesian Robotic Fruit Harvester—Extensions of Graph Coloring. J Intell Robot Syst 82, 399–411 (2016). https://doi.org/10.1007/s10846-015-0211-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10846-015-0211-5

Keywords

Search

Navigation