Skip to main content

Advertisement

Log in

Comparison of Eulerian and Hamiltonian circuits for evolutionary-based path planning of an autonomous surface vehicle for monitoring Ypacarai Lake

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

An evolutionary-based path planning is designed for an autonomous surface vehicle (ASV) used in environmental monitoring tasks. The main objective is that the ASV covers the maximum area of a large mass of water such as the Ypacarai Lake while taking water samples for sensing pollution conditions. Such coverage problem is transformed into a path planning optimization problem through the placement of a set of data beacons located at the shore of the lake and considering the relationship between the distance traveled by the ASV and the area of the lake covered. The optimal set of beacons to be visited by the ASV has been modeled through two different approaches such as Hamiltonian and Eulerian circuits. When Hamiltonian circuits are used, all the beacons should be visited only once. In the case of Eulerian circuits, the only limitation is that repeated routes cannot exist between two beacons. Both models have important implications on the possible trajectories of ASV throughout the lake. In this paper, we compare the application of both models for the optimization of the proposed evolutionary-based path planning. Due to the complexity of the optimization problem, a metaheuristic technique like a Genetic Algorithm (GA) is used to obtain quasi-optimal solutions in both models. The models have been compared by simulation and the results reveal that the Eulerian circuit approach can achieve an improvement of 2% when comparing to the Hamiltonian circuit approach.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  • Arzamendia M. (2017) https://github.com/Mariuspy/ASVPathPlanningGA. Accesed 5 June 2018.

  • Arzamendia M, Gregor D, Reina DG, Toral SL, Gregor R (2016) Evolutionary path planning of an autonomous surface vehicle for water quality monitoring. In: IEEE 9th International Conference on Developments in eSystems Engineering (DeSE), 2016, pp 245–250.

  • Arzamendia M, Gregor D, Reina DG, Toral SL (2017) An evolutionary approach to constrained path planning of an autonomous surface vehicle for maximizing the covered area of Ypacarai Lake. Soft Comput. https://doi.org/10.1007/s00500-017-2895-x

    Google Scholar 

  • Brownlee J (2011) Clever algorithms: nature-inspired programming recipes. Jason Brownlee

  • Dréo J, Pétrowski A, Siarry P, Taillard E (2006) Metaheuristics for hard optimization: methods and case studies. Springer, Berlin

    MATH  Google Scholar 

  • Eiselt HA, Gendreau M, Laporte G (1995a) Arc routing problems, part I: the Chinese postman problem. Oper Res 43(2):231–242

    Article  MathSciNet  MATH  Google Scholar 

  • Eiselt HA, Gendreau M, Laporte G (1995b) Arc routing problems, part II: the rural postman problem. Operat Res 43(3):399–414

    Article  MATH  Google Scholar 

  • Fleischner H (2001) (Some of) the many uses of Eulerian graphs in graph theory (plus some applications). Discret Math 230(1–3):23–43

    Article  MathSciNet  MATH  Google Scholar 

  • Fortin FA, Rainville FMD, Gardner MA, Parizeau M, Gagné C (2012) DEAP: Evolutionary algorithms made easy. J Mach Learn Res 13:2171–2175

    MathSciNet  MATH  Google Scholar 

  • Galceran E, Carreras M (2013) A survey on coverage path planning for robotics. Robot Auton syst 61(12):1258–1276

    Article  Google Scholar 

  • Gendreau M, Potvin JY (2010) Handbook of metaheuristics, vol 2. Springer, New York

    Book  MATH  Google Scholar 

  • Hoffman KL, Padberg M, Rinaldi G (2013) Traveling salesman problem. Encyclopedia of operations research and management science. Springer, Berlin, pp 1573–1578

    Book  Google Scholar 

  • Liu Z, Zhang Y, Yu X, Yuan C (2016) Unmanned surface vehicles: an overview of developments and challenges. Ann Rev Control 41:71–93

    Article  Google Scholar 

  • Miller BN, Ranum DL (2011) Problem solving with algorithms and data structures using python Second Edition. Franklin, Beedle & Associates Inc, Portland

    Google Scholar 

  • Mukherjee A, Panigrahi G, Kar S, Maiti M (2017) Constrained covering solid travelling salesman problems in uncertain environment. J Ambient Intell Humaniz Comput. https://doi.org/10.1007/s12652-017-0620-3

    Google Scholar 

  • Pascarella D, Venticinque S, Aversa R, Mattei M, Blasi L (2015) Parallel and distributed computing for UAVs trajectory planning. J Ambient Intell Humaniz Comput 6(6):773–782

    Article  Google Scholar 

  • Pham TH, Bestaoui Y, Mammar S (2017) Aerial robot coverage path planning approach with concave obstacles in precision agriculture. In: IEEE workshop on research, education and development of unmanned aerial systems (RED-UAS), 2017, pp 43–48

  • Ryerson AF, Zhang Q (2007) Vehicle path planning for complete field coverage using genetic algorithms. CIGR J, Agric Eng Int 9:1–11

    Google Scholar 

  • Sastry K, Goldberg DE, Kendall G (2014) Genetic algorithms. In: Burke EK, Kendall G (eds) Search methodologies. Springer, Boston, MA

    Google Scholar 

  • Schäfle TR, Mohamed S, Uchiyama N, Sawodny O (2016) Coverage path planning for mobile robots using genetic algorithm with energy optimization. In: Electronics Symposium (IES), 2016 International, IEEE, pp 99–104

  • Sivanandam SN, Deepa SN (2007) Introduction to genetic algorithms. Springer, Berlin

    MATH  Google Scholar 

  • Su S, Zhao S (2017) A hierarchical hybrid of genetic algorithm and particle swarm optimization for distributed clustering in large-scale wireless sensor networks. J Ambient Intell Humaniz Comput:1–11

  • Tokekar P, Branson E, Vander Hook J, Isler V (2013) Tracking aquatic invaders: Autonomous robots for monitoring invasive fish. IEEE Robot Autom Mag 20(3):33–41

    Article  Google Scholar 

  • Wallis WD (2013) Mathematics in the real world. Birkhauser, Boston

    Book  MATH  Google Scholar 

  • Wang Y (2014) The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem. Comput Ind Eng 70:124–133

    Article  Google Scholar 

  • Yang XS (2014) Nature-inspired optimization algorithms. Elsevier, Amsterdam

    MATH  Google Scholar 

  • Zhou K, Jensen AL, Sørensen CG, Busato P, Bothtis DD (2014) Agricultural operations planning in fields with multiple obstacle areas. Comput Electron Agric 109:12–22

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank Fundación Carolina and its PhD scholarships program. The authors would like to thank Mónica Díaz López for her help in proofreading the manuscript.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. G. Reina.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Arzamendia, M., Espartza, I., Reina, D.G. et al. Comparison of Eulerian and Hamiltonian circuits for evolutionary-based path planning of an autonomous surface vehicle for monitoring Ypacarai Lake. J Ambient Intell Human Comput 10, 1495–1507 (2019). https://doi.org/10.1007/s12652-018-0920-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-018-0920-2

Keywords

Navigation