Online motion planning for multi-robot interaction using composable reachable sets

Aris Valtazanos, Subramanian Ramamoorthy

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

Abstract / Description of output

This paper presents an algorithm for autonomous online path planning in uncertain, possibly adversarial, and partially observable environments. In contrast to many state-of-the-art motion planning approaches, our focus is on decision making in the presence of adversarial agents who may be acting strategically but whose exact behaviour is difficult to model precisely. Our algorithm first computes a collection of reachable sets with respect to a family of possible strategies available to the adversary. Online, the agent uses these sets as composable behavioural templates, in conjunction with a particle filter to maintain the current belief on the adversary’s strategy. In partially observable environments, this yields significant performance improvements over state-of-the-art planning algorithms. We present empirical results to this effect using a robotic soccer simulator, highlighting the applicability of our implementation against adversaries with varying capabilities. We also demonstrate experiments on the NAO humanoid robots, in the context of different collision-avoidance scenarios.
Original languageEnglish
Title of host publicationRoboCup 2011: Robot Soccer World Cup XV
PublisherSpringer Berlin Heidelberg
Pages186-197
Number of pages12
ISBN (Electronic)978-3-642-32060-6
ISBN (Print)978-3-642-32059-0
DOIs
Publication statusPublished - 2012

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume7416
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Online motion planning for multi-robot interaction using composable reachable sets'. Together they form a unique fingerprint.

Cite this