Motion planning for nonelinear underactuated vehicles using H techniques

G. J. Toussaint, T. Başar, F. Bullo

Research output: Contribution to journalConference article

Abstract

This paper presents a new solution to the motion planning problem for nonlinear underactuated vehicles. The approach solves the problem by generating a polynomial curve connecting the desired initial and final positions for the vehicle and then using the curve to estimate the vehicle's complete configuration along the trajectory. The algorithm introduces an iterative H-filter to improve upon the initial estimate for the trajectory. The solution to the basic motion planning problem can be coupled with randomized path planning algorithms to solve the obstacle avoidance and multiple vehicle versions of the problem. Numerical simulations illustrate the algorithm's performance on an underactuated planar vehicle.

Original languageEnglish (US)
Pages (from-to)4097-4102
Number of pages6
JournalProceedings of the American Control Conference
Volume5
StatePublished - Jan 1 2001
Event2001 American Control Conference - Arlington, VA, United States
Duration: Jun 25 2001Jun 27 2001

Fingerprint

Motion planning
Trajectories
Collision avoidance
Polynomials
Computer simulation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Motion planning for nonelinear underactuated vehicles using H techniques. / Toussaint, G. J.; Başar, T.; Bullo, F.

In: Proceedings of the American Control Conference, Vol. 5, 01.01.2001, p. 4097-4102.

Research output: Contribution to journalConference article

@article{1c1a3a5d158e47599aa37338a0de27d4,
title = "Motion planning for nonelinear underactuated vehicles using H∞ techniques",
abstract = "This paper presents a new solution to the motion planning problem for nonlinear underactuated vehicles. The approach solves the problem by generating a polynomial curve connecting the desired initial and final positions for the vehicle and then using the curve to estimate the vehicle's complete configuration along the trajectory. The algorithm introduces an iterative H∞-filter to improve upon the initial estimate for the trajectory. The solution to the basic motion planning problem can be coupled with randomized path planning algorithms to solve the obstacle avoidance and multiple vehicle versions of the problem. Numerical simulations illustrate the algorithm's performance on an underactuated planar vehicle.",
author = "Toussaint, {G. J.} and T. Başar and F. Bullo",
year = "2001",
month = "1",
day = "1",
language = "English (US)",
volume = "5",
pages = "4097--4102",
journal = "Proceedings of the American Control Conference",
issn = "0743-1619",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Motion planning for nonelinear underactuated vehicles using H∞ techniques

AU - Toussaint, G. J.

AU - Başar, T.

AU - Bullo, F.

PY - 2001/1/1

Y1 - 2001/1/1

N2 - This paper presents a new solution to the motion planning problem for nonlinear underactuated vehicles. The approach solves the problem by generating a polynomial curve connecting the desired initial and final positions for the vehicle and then using the curve to estimate the vehicle's complete configuration along the trajectory. The algorithm introduces an iterative H∞-filter to improve upon the initial estimate for the trajectory. The solution to the basic motion planning problem can be coupled with randomized path planning algorithms to solve the obstacle avoidance and multiple vehicle versions of the problem. Numerical simulations illustrate the algorithm's performance on an underactuated planar vehicle.

AB - This paper presents a new solution to the motion planning problem for nonlinear underactuated vehicles. The approach solves the problem by generating a polynomial curve connecting the desired initial and final positions for the vehicle and then using the curve to estimate the vehicle's complete configuration along the trajectory. The algorithm introduces an iterative H∞-filter to improve upon the initial estimate for the trajectory. The solution to the basic motion planning problem can be coupled with randomized path planning algorithms to solve the obstacle avoidance and multiple vehicle versions of the problem. Numerical simulations illustrate the algorithm's performance on an underactuated planar vehicle.

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

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

M3 - Conference article

AN - SCOPUS:0034842119

VL - 5

SP - 4097

EP - 4102

JO - Proceedings of the American Control Conference

JF - Proceedings of the American Control Conference

SN - 0743-1619

ER -