TY - CHAP
T1 - Off-line and on-line trajectory planning
AU - Shiller, Zvi
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.
PY - 2015/1/1
Y1 - 2015/1/1
N2 - 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.
AB - 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.
KW - Motion planning
KW - Online planning
KW - Trajectrory optimization
UR - http://www.scopus.com/inward/record.url?scp=84941626728&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-14705-5_2
DO - 10.1007/978-3-319-14705-5_2
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???
AN - SCOPUS:84941626728
T3 - Mechanisms and Machine Science
SP - 29
EP - 62
BT - Mechanisms and Machine Science
PB - Kluwer Academic Publishers
ER -