Path selection and coordination for multiple robots via Nash equilibria

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

Abstract

We present a method for analyzing and selecting time-optimal coordination strategies for n robots whose configurations are constrained to lie on a C-space roadmap (which could for instance represent a Voronoi diagram). We consider independent objective functionals, associated with each robot, together in a game-theoretic context in which maximal Nash equilibria represent the favorable strategies. Within this framework additional criteria, such as priority or the amount of sacrifice one robot makes, can be applied to select a particular equilibrium. An algorithm that determines all of the maximal Nash equilibria for a given problem is presented, along with several computed examples for two and three robots.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Conference on Robotics and Automation
Editors Anon
PublisherPubl by IEEE
Pages1847-1852
Number of pages6
Editionpt 3
ISBN (Print)0818653329
StatePublished - 1994
EventProceedings of the 1994 IEEE International Conference on Robotics and Automation. Part 3 (of 4) - San Diego, CA, USA
Duration: May 8 1994May 13 1994

Publication series

NameProceedings - IEEE International Conference on Robotics and Automation
Numberpt 3
ISSN (Print)1050-4729

Other

OtherProceedings of the 1994 IEEE International Conference on Robotics and Automation. Part 3 (of 4)
CitySan Diego, CA, USA
Period5/8/945/13/94

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Electrical and Electronic Engineering
  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Path selection and coordination for multiple robots via Nash equilibria'. Together they form a unique fingerprint.

Cite this