Skip to main content

Advertisement

Log in

Multiple Objective Genetic Algorithms for Path-planning Optimization in Autonomous Mobile Robots

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This paper describes the use of a genetic algorithm (GA) for the problem of offline point-to-point autonomous mobile robot path planning. The problem consists of generating “valid” paths or trajectories, for an Holonomic Robot to use to move from a starting position to a destination across a flat map of a terrain, represented by a two-dimensional grid, with obstacles and dangerous ground that the Robot must evade. This means that the GA optimizes possible paths based on two criteria: length and difficulty. First, we decided to use a conventional GA to evaluate its ability to solve this problem (using only one criteria for optimization). Due to the fact that we also wanted to optimize paths under two criteria or objectives, then we extended the conventional GA to implement the ideas of Pareto optimality, making it a multi-objective genetic algorithm (MOGA). We describe useful performance measures and simulation results of the conventional GA and of the MOGA that show that both types of GAs are effective tools for solving the point-to-point path-planning problem.

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.

Similar content being viewed by others

References

  1. Ali AD, Babu MSN, Varghese K (2002) Offline path planning of cooperative manipulators using co-evolutionary genetic algorithm. In: Proceedings of the international symposium on automation and robotics in construction, 19th (ISARC), pp 415–124

  2. Choset H, La Civita ML, Park JC (1999) Path planning between two points for a robot experiencing localization error in known and unknown environments. In: Proceedings of the conference on field and service robotics (FSR’99), Pittsburgh, PA

  3. Cobb HG (1990) An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical Report AIC-90-001, Naval Research Laboratory, Washington DC

  4. Farritor S, Dubowsky S (2002) A genetic planning method and its application to planetary exploration. ASME J Dyn Syst Meas Control 124(4):698–701

    Article  Google Scholar 

  5. Fonseca CM, Fleming CJ (1993) Genetic algorithms for multiobjective optimization: formulation, discussion and generalization. In: 5th international conference genetic algorithms, pp 416–423

  6. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading, MA

    MATH  Google Scholar 

  7. Kim BN, Kwon OS, Kim KJ, Lee EH, Hong SH (1999) A study on path planning for mobile robot based on fuzzy logic controller. In: Proceedings of IEEE TENCON’99, pp 1–6

  8. Man KF, Tang KS, Kwong S (1999) Genetic algorithms, 1st ed. London Springer

  9. Oliveira GMB, Bortot JC, De Oliveira PPB (2002) Multiobjective evolutionary search for one-dimensional cellular automata in the density classification task. In: Proceedings of artificial life VIII. Cambridge, MIT Press, pp 202–206

  10. Planas RM, Fuertes JM, Martinez AB (2002) Qualitative approach for mobile robot path planning based on potential field methods. In: 16th international workshop on qualitative reasoning (QR’02), pp 1–7

  11. Sauter JA, Matthews R, Parunak, HVD, Brueckner S (2002) Evolving adaptive pheromone path planning mechanisms. In: 1st international conference on autonomous agents and multi-agent systems, Bologna, Italy, pp 434–440

  12. Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. Genetic algorithms and their applications. In: Proceedings of the first international conference on genetic algorithms, pp 93–100

  13. Spandl H (1992) Lernverfahren zur Unterstützung der Routenplanung fur eine Mobilen Roboter. Dissertation, Universität Karlsruhe, auch VDI-Forsch-Heft Reihe 10 Nr. 212, Düsseldorf, Germany, VDI-Verlag

  14. Srinivas M, Deb K (1994) Multiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221–248

    Google Scholar 

  15. Sugihara K (1997) A case study on tuning of genetic algorithms by using performance evaluation based on experimental design. Technical Report ICS-TR-97-01, Deptartment of Information and Computer Sciences, University of Hawaii at Manoa

  16. Sugihara K (1997) Measures for performance evaluation of genetic algorithms. In: Proceedings of the 3rd joint conference on information sciences, vol I, Research Triangle Park, NC, pp 172–175

  17. Sugihara K (1999) Genetic algorithms for adaptive planning of path and trajectory of a mobile robot in 2d terrains. IEICE Trans Inf Syst E82-D:309–313

    Google Scholar 

  18. Xiao J, Michalewicz Z (2000) An evolutionary computation to robot planning and navigation. In: Hirota K, Fukuda T (eds) Soft computing in mechatronics. Springer, Berlin Heidelberg, New york, pp 117–128

    Google Scholar 

  19. Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257–271

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Oscar Castillo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Castillo, O., Trujillo, L. & Melin, P. Multiple Objective Genetic Algorithms for Path-planning Optimization in Autonomous Mobile Robots. Soft Comput 11, 269–279 (2007). https://doi.org/10.1007/s00500-006-0068-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-006-0068-4

Keywords

Navigation