Multi-vehicle path coordination under communication constraints

Pramod Abichandani, Hande Y. Benson, Moshe Kam

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

12 Scopus citations

Abstract

We generate time-optimal velocity profiles for a group of path-constrained vehicles with fixed and known initial and goal locations. Each vehicle robot must follow a fixed path, arrive at its goal as quickly as possible (or at least not increase the time for the last robot to arrive at its goal) and stay in communication with other robots in the arena throughout its journey. We seek to solve this multi-objective optimization problem by generating optimal velocities along the paths. The problem is formulated as a nonlinear programming problem (NLP) with constraints on the kinematics, dynamics, collision avoidance and communication. Solutions demonstrate the trade off between the arrival time, the required transmission power and the communication connectivity requirements. Typically the optimization improved connectivity at no appreciable cost in journey time (as measured by the time of arrival of the last-arriving robot).

Original languageEnglish (US)
Title of host publication2008 American Control Conference, ACC
Pages650-656
Number of pages7
DOIs
StatePublished - 2008
Externally publishedYes
Event2008 American Control Conference, ACC - Seattle, WA, United States
Duration: Jun 11 2008Jun 13 2008

Publication series

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

Other

Other2008 American Control Conference, ACC
Country/TerritoryUnited States
CitySeattle, WA
Period6/11/086/13/08

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Multi-vehicle path coordination under communication constraints'. Together they form a unique fingerprint.

Cite this