Trajectory planning amidst moving obstacles: path-velocity decomposition revisited - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of the Brazilian Computer Society Year : 1998

Trajectory planning amidst moving obstacles: path-velocity decomposition revisited

Abstract

This paper addresses trajectory planning for a robot subject to dynamic constraints and moving in a dynamic workspace. A car-like robot M with bounded velocity and acceleration, moving in a dynamic two-dimensional workspace is considered. The solution proposed is an extension of the path-velocity decomposition which is a practical way to address trajectory planning in dynamic workspaces. However it presents a serious drawback: it cannot find a solution if a moving obstacle stops right on the computed path. Previous answers to this problem were to consider sets of candidate paths. The answer proposed in this paper makes use of the novel concept of adjacent paths (like adjacent lanes of the roadway). A set of adjacent paths, one of which leads M to its goal, is computed. Then, assuming that M is able to shift from one path to an adjacent one freely, the motion of M along and between these paths is determined so as to avoid the moving obstacles. The fact that it is possible to switch several times between two adjacent paths makes this approach more flexible and more powerful than one considering candidate paths.
Fichier principal
Vignette du fichier
98-fraichard-jbcs.pdf (304.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00259326 , version 1 (27-02-2008)

Identifiers

  • HAL Id : inria-00259326 , version 1

Cite

Thierry Fraichard. Trajectory planning amidst moving obstacles: path-velocity decomposition revisited. Journal of the Brazilian Computer Society, 1998, 4 (3). ⟨inria-00259326⟩
83 View
403 Download

Share

Gmail Facebook Twitter LinkedIn More