Skip to main content
SpringerLink
Log in

A Shortest Path Based Path Planning Algorithm for Nonholonomic Mobile Robots

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

Abstract

A path planning algorithm for a mobile robot subject to nonholonomic constraints is presented. The algorithmemploys a global- local strategy, and solves the problem in the 2D workspace of the robot, without generating the complexconfiguration space. Firstly, a visibility graph is constructed for finding a collision-free shortest path for a point. Secondly,the path for a point is evaluated to find whether it can be used as a reference to build up a feasible path for the mobile robot.If not, this path is discarded and the next shortest path is selected and evaluated until a right reference path is found. Thirdly,robot configurations are placed along the selected path in the way that the robot can move from one configuration to the nextavoiding obstacles. Lemmas are introduced to ensure that the robot travels using direct, indirect or reversal manoeuvres. Thealgorithm is computationally efficient and runs in time O(nk + n log n) for k obstacles andn vertices. The path found is near optimal in terms of distance travelled. The algorithm is tested in computersimulations and test results are presented to demonstrate its versatility in complex environments.

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. Laumond, J. P.: Feasible trajectories for mobile robots with kinematic and environment constraints, Preprints of the International Conference on Intelligent Autonomous Systems, Elsevier Science Publishers, B.V., Amsterdam, The Netherlands, 1986, pp. 346–354.

    Google Scholar 

  2. Laumond, J. P.: Finding collision-free smooth trajectories for a non-holonomic mobile robot, in: Proceedings of the 10th International Joint Conference on Artificial Intelligence, Milan, Italy, 1987, pp. 1120–1123.

  3. Lozano-Pérez, T.: Spactial planning: A configuration space approach, IEEE Trans. Computers 1C-32(2) (1983), 108–120.

    Google Scholar 

  4. Arraquand, J. and Latombe, J. C.: On non-holonomic mobile robots and optimal maneuvering, Revue d'Intelligence Artificielle 13(2) (1989), 77–103.

    Google Scholar 

  5. Tournassoud, P.: Motion planning for a mobile robot with a kinematic constraint, in: J. D. Boissonnal and J. P. Laumond (eds), Geometry and Robotics, Lecture Notes in Computer Science, Vol. 391, Springer-Verlag, 1989, pp. 150–171.

  6. Wilfong, G. T.: Motion planning for an autonomous vehicle, in: IEEE Int. Conf. in Robotics and Automation, 1988.

  7. Pruski, A. and Rohmer, S.: Robust path planning for non-holonomic robots, J. Intelligent & Robotic Systems 18(4) (1997), 329–350.

    Google Scholar 

  8. Lafferriere, G. and Sussmann, H. J.: Motion planning for controllable systems without drift: A preliminary report, Technical Report SYCON-90-04, Rutgers University, June, 1990.

  9. Murray, R. M. and Sastry, S. S.: Steering nonholonomic systems using sinusoids, 29th C.D.C., Honolulu, Dec. 1990.

  10. Sussmann, H. J. and Lui, W.: Limits of highly oscillatory controls and the approximation of general paths by admissible trajectories, Report SYCON-91-02, Rutgers University, 1991.

  11. Jacobs, P., Laumond, J. P., and Taix, M.: Efficient motion planners for nonholonomic mobile robots, in: Proceedings of 1991 IEEE IROS, Osaka, November 1991.

  12. Li, Z. and Canny, J. F.: Nonholonomic Motion Planning, Kluwer Academic Publishers, 1993

  13. Laumond, J. P., Jacobs, P. E., Taix, M., and Murry, R. M.: A motion planner for nonholonomic mobile robots, IEEE Transactions on Robotics and Automation 10(5) (1994).

  14. Divelbiss, A.W. and Wen, J. T.: A path space approach to nonholonomic motion planning in the presence of obstacles, IEEE Transactions on Robotics and Automation 13(3) (1997), 443–451.

    Google Scholar 

  15. Rohnert, H.: Shortest paths in the plane with convex polygonal obstacles, Information Processing Letters 23 (1986), 71–76.

    Google Scholar 

  16. Schwartz, J. T.: Finding the minimum distance between two convex polygons, Inform. Process Lett. 13 (1981), 168–170.

    Google Scholar 

  17. Seneviratne, L. D., Jiang, K., and Earles, S. W. E.: A fast collision avoidance algorithm for a rectangular object, Proc. of 8th World Congress on The Theory of Machines and Mechanisms, Prague, August 1991.

  18. Jiang, K.: Operation planning for mobile robots and robot manipulators, PhD thesis, King's College London, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Manufacturing Engineering and Industrial Management, Department of Engineering, The University of Liverpool, Liverpool, L69 3BX, UK

    Kaichun Jiang

  2. Department of Mechanical Engineering, King's College London, Strand, London, WC2R 2LS, UK

    Lakmal D. Seneviratne & S. W. E. Earles

Authors
  1. Kaichun Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lakmal D. Seneviratne
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. W. E. Earles
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kaichun Jiang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jiang, K., Seneviratne, L.D. & Earles, S.W.E. A Shortest Path Based Path Planning Algorithm for Nonholonomic Mobile Robots. Journal of Intelligent and Robotic Systems 24, 347–366 (1999). https://doi.org/10.1023/A:1008070923246

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008070923246

Search

Navigation