Off-line and on-line trajectory planning

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

41 Scopus citations

Abstract

The basic problem of motion planning is to select a path, or trajectory, from a given initial state to a destination state, while avoiding collisions with known static and moving obstacles. Ideally, it is desirable that the trajectory to the goal be computed online, during motion, to allow the robot react to changes in the environment, to a moving target, and to errors encountered during motion. However, the inherent difficulty in solving this problem, which stems from the high dimensionality of the search space, the geometric and kinematic properties of the obstacles, the cost function to be optimized, and the robot’s kinematic and dynamic model, may hinder a sufficiently fast solution to be computed online, given reasonable computational resources. As a result, existing work on motion planning can be classified into offline and on-line planning. Off-line planners compute the entire path or trajectory to the goal before motion begins, whereas on-line planners generate the trajectory to the goal incrementally, during motion. This chapter reviews the main approaches to off-line and on-line planning, and presents one solution for each.

Original languageEnglish
Title of host publicationMechanisms and Machine Science
PublisherKluwer Academic Publishers
Pages29-62
Number of pages34
DOIs
StatePublished - 1 Jan 2015

Publication series

NameMechanisms and Machine Science
Volume29
ISSN (Print)2211-0984
ISSN (Electronic)2211-0992

Keywords

  • Motion planning
  • Online planning
  • Trajectrory optimization

Fingerprint

Dive into the research topics of 'Off-line and on-line trajectory planning'. Together they form a unique fingerprint.

Cite this