Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-22T03:35:25.214Z Has data issue: false hasContentIssue false

Time-optimal smooth-path motion planning for a mobile robot with kinematic constraints

Published online by Cambridge University Press:  01 September 1997

K. Jiang
Affiliation:
Department of Mechanical Engineering, King's College London, Strand, London WC2R 2LS UK
L.D. Seneviratne
Affiliation:
Department of Mechanical Engineering, King's College London, Strand, London WC2R 2LS UK
S.W.E. Earles
Affiliation:
Department of Mechanical Engineering, King's College London, Strand, London WC2R 2LS UK

Abstract

This paper presents a novel time-optimal motion planning strategy for a mobile robot with kinematic constraints. The method works in environments in presence of obstacles, without needing to generate the configuration space for the robot. Further, it derives a minimum time first derivative smooth path, as opposed to a minimum distance path which is commonly given by various present solution techniques. The problem is solved in three stages: (i) A reduced visibility graph for a point object is obtained. (ii) The reduced visibility graph is converted into a feasible reduced visibility graph accounting for the size and kinematic constraints of the robot. (iii) The A* algorithm is used to search the feasible reduced visibility graph with the cost function being the time of travel, to obtain a safe, time-optimal, smooth path. The algorithm runs in polynomial time. The method has been tested in computer simulations and test results are presented

Type
Research Article
Copyright
© 1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)