The Approximate Cell Decomposition with Local Node Refinement Global Path Planning Method: Path Nodes Refinement and Curve Parametric Interpolation

  • Authors:
  • Nikos I. Katevas;Spyros G. Tzafestas;Christos G. Pnevmatikatos

  • Affiliations:
  • IRAL, Electrical and Computer Engineering Department, National Technical University of Athens, Zografou 15773, Athens, Greece and ZENON S.A., Industrial Automation, Glyka Nera, Attiki, Greece, GR ...;IRAL, Electrical and Computer Engineering Department, National Technical University of Athens, Zografou 15773, Athens, Greece/ e-mail: tzafesta@softlab.ece.ntua.gr;ZENON S.A., Industrial Automation, Glyka Nera, Attiki, Greece, GR 15344/ e-mail: nkat@leon.nrcps.ariadne-t.gr

  • Venue:
  • Journal of Intelligent and Robotic Systems
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper presents a novel global path planning approach for mobile robotnavigation in two dimensional workspace cluttered by polygonal obstacles.The core of the planning method introduced is based on the approximate celldecomposition method. The advantage of the new method is the employment ofnovel path refinement procedures of the paths produced by approximate celldecomposition that are based on local characteriscics of the workspace.Furthermore, the refined path is parametrically interpolated by cubicsplines via a physical centripetal model, introducing the dynamicconstraints of mobile robots’ motion to the path construction. Themethod has been implemented both in a computer graphics simulation and on areal mobile robot cruising at indoor environments. Planned paths on severalconfigurations are presented.