ICRA 2012 Paper Abstract

Close

Paper WeC04.2

Lim, Sejoon (MIT), Rus, Daniela (MIT)

Stochastic Distributed Multi-Agent Planning and Applications to Traffic

Scheduled for presentation during the Regular Session "Stochastic Motion Planning" (WeC04), Wednesday, May 16, 2012, 14:45−15:00, Meeting Room 4 (Chief Wabasha)

2012 IEEE International Conference on Robotics and Automation, May 14-18, 2012, RiverCentre, Saint Paul, Minnesota, USA

This information is tentative and subject to change. Compiled on October 24, 2017

Keywords Path Planning for Multiple Mobile Robots or Agents, Motion and Path Planning, Planning, Scheduling and Coordination

Abstract

This paper proposes a method for multi-agent path planning on a road network in the presence of congestion. We suggest a distributed method to find paths for multiple agents by introducing a probabilistic path choice achieving global goals such as the social optimum. This approach, which shows that the global goals can be achieved by local processing using only local information, can be parallelized and sped-up using massive parallel processing. The probabilistic assignment reliably copes with the case of random choices of unidentified agents or random route changes of agents who ignore our path guidance. We provide the analytical result on convergence and running time. We demonstrate and evaluate our algorithm by an implementation using asynchronous computation on multi-core computers.

 

 

Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2017 PaperCept, Inc.
Page generated 2017-10-24  00:23:15 PST  Terms of use