Optimal motion planning for differentially flat systems using bernstein approximation

Venanzio Cichella; Isaac Kaminer; Claire Walton; Naira Hovakimyan

doi:10.1109/LCSYS.2017.2778313

Optimal motion planning for differentially flat systems using bernstein approximation

Venanzio Cichella, Isaac Kaminer, Claire Walton, Naira Hovakimyan

Research output: Contribution to journal › Article

Abstract

This letter presents a computational framework to efficiently generate feasible and optimal trajectories for differentially flat autonomous vehicle systems. We formulate the optimal motion planning problem as a continuous-time optimal control problem, and approximate it by a discrete-time formulation using Bernstein polynomials. These polynomials allow for efficient computation of various constraints along the entire trajectory, and are particularly convenient for generating trajectories for safe operation of multiple vehicles in complex environments. The advantages of the proposed method are investigated through theoretical analysis and numerical examples.

Original language	English (US)
Pages (from-to)	181-186
Number of pages	6
Journal	IEEE Control Systems Letters
Volume	2
Issue number	1
DOIs	https://doi.org/10.1109/LCSYS.2017.2778313
State	Published - Jan 2018

Fingerprint

Keywords

Autonomous vehicles
Bernstein polynomial
Bézier curves
Discrete approximation
Optimal motion planning

ASJC Scopus subject areas

Control and Systems Engineering
Control and Optimization

Cite this

Cichella, V., Kaminer, I., Walton, C., & Hovakimyan, N. (2018). Optimal motion planning for differentially flat systems using bernstein approximation. IEEE Control Systems Letters, 2(1), 181-186. https://doi.org/10.1109/LCSYS.2017.2778313

@article{329cd045eedc44e5bee2c3de794317d4,

title = "Optimal motion planning for differentially flat systems using bernstein approximation",

abstract = "This letter presents a computational framework to efficiently generate feasible and optimal trajectories for differentially flat autonomous vehicle systems. We formulate the optimal motion planning problem as a continuous-time optimal control problem, and approximate it by a discrete-time formulation using Bernstein polynomials. These polynomials allow for efficient computation of various constraints along the entire trajectory, and are particularly convenient for generating trajectories for safe operation of multiple vehicles in complex environments. The advantages of the proposed method are investigated through theoretical analysis and numerical examples.",

keywords = "Autonomous vehicles, Bernstein polynomial, B{\'e}zier curves, Discrete approximation, Optimal motion planning",

author = "Venanzio Cichella and Isaac Kaminer and Claire Walton and Naira Hovakimyan",

year = "2018",

month = jan,

doi = "10.1109/LCSYS.2017.2778313",

language = "English (US)",

volume = "2",

pages = "181--186",

journal = "IEEE Control Systems Letters",

issn = "2475-1456",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - Optimal motion planning for differentially flat systems using bernstein approximation

AU - Cichella, Venanzio

AU - Kaminer, Isaac

AU - Walton, Claire

AU - Hovakimyan, Naira

PY - 2018/1

Y1 - 2018/1

N2 - This letter presents a computational framework to efficiently generate feasible and optimal trajectories for differentially flat autonomous vehicle systems. We formulate the optimal motion planning problem as a continuous-time optimal control problem, and approximate it by a discrete-time formulation using Bernstein polynomials. These polynomials allow for efficient computation of various constraints along the entire trajectory, and are particularly convenient for generating trajectories for safe operation of multiple vehicles in complex environments. The advantages of the proposed method are investigated through theoretical analysis and numerical examples.

AB - This letter presents a computational framework to efficiently generate feasible and optimal trajectories for differentially flat autonomous vehicle systems. We formulate the optimal motion planning problem as a continuous-time optimal control problem, and approximate it by a discrete-time formulation using Bernstein polynomials. These polynomials allow for efficient computation of various constraints along the entire trajectory, and are particularly convenient for generating trajectories for safe operation of multiple vehicles in complex environments. The advantages of the proposed method are investigated through theoretical analysis and numerical examples.

KW - Autonomous vehicles

KW - Bernstein polynomial

KW - Bézier curves

KW - Discrete approximation

KW - Optimal motion planning

UR - http://www.scopus.com/inward/record.url?scp=85057638080&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85057638080&partnerID=8YFLogxK

U2 - 10.1109/LCSYS.2017.2778313

DO - 10.1109/LCSYS.2017.2778313

M3 - Article

AN - SCOPUS:85057638080

VL - 2

SP - 181

EP - 186

JO - IEEE Control Systems Letters

JF - IEEE Control Systems Letters

SN - 2475-1456

IS - 1

ER -

Access to Document

10.1109/LCSYS.2017.2778313