Generalization of v* path planning for accommodation of amortized dynamic uncertainties in plan execution

Ishanu Chattopadhyay, Asok Ray

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A significant generalization to the language-measuretheoretic path planning algorithm is presented that accounts for average dynamic uncertainties in plan execution. The planning problem thus can be solved with parametric input from the dynamics of the robotic platform under consideration. Applicability of the algorithm is demonstrated in a simulated maze solution and by experimental validation on a mobile robotic platform in the laboratory environment.

Original languageEnglish (US)
Title of host publication2009 American Control Conference, ACC 2009
Pages2415-2420
Number of pages6
DOIs
StatePublished - Nov 23 2009
Event2009 American Control Conference, ACC 2009 - St. Louis, MO, United States
Duration: Jun 10 2009Jun 12 2009

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619

Other

Other2009 American Control Conference, ACC 2009
CountryUnited States
CitySt. Louis, MO
Period6/10/096/12/09

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Generalization of v* path planning for accommodation of amortized dynamic uncertainties in plan execution'. Together they form a unique fingerprint.

Cite this