Evaluation of Auction-Based Multi-Robot Routing by Parallel Simulation. .
abstract   bibtex   
Auction methods are a promising approximation approach for distributed routing including multi-robot routing, where targets on a map need to be allocated to agents while satisfying a team objective. While many algorithms based on sequential single-item (SSI) auctions have been presented, they are currently evaluated by serial simulation where agents serially calculate their bids on a single machine. We consider a scenario where a bidding algorithm incurs significant computational overhead due to on-demand calculations of the shortest distances on a road map, and evaluate the bidding algorithm under parallel simulations where agents perform bid calculations simultaneously on a parallel machine. We reveal that the algorithm suffers from severe synchronization overhead ignored by serial simulation. We also present the broadcasting and speculation techniques to alleviate such synchronization overhead. Our empirical results on multi-robot routing variants show that both techniques improve the efficiency of parallelization, and speculation achieves more significant improvement.
@inproceeduings {icaps16-11,
  track={Robotics Track},
  title={Evaluation of Auction-Based Multi-Robot Routing by Parallel Simulation},
  authors={Akihiro Kishimoto, Kiyohito Nagano},
  abstract={Auction methods are a promising approximation approach for distributed routing including multi-robot routing, where targets on a map need to be allocated to agents while satisfying a team objective. While many algorithms based on sequential single-item (SSI) auctions have been presented, they are currently evaluated by serial simulation where agents serially calculate their bids on a single machine. 

We consider a scenario where a bidding algorithm incurs significant computational overhead due to on-demand calculations of the shortest distances on a road map, 
and evaluate the bidding algorithm under parallel simulations where agents perform bid calculations simultaneously on a parallel machine. We reveal that the algorithm suffers from severe synchronization overhead ignored by serial simulation. We also present the broadcasting and speculation techniques to alleviate such synchronization overhead. 

Our empirical results on multi-robot routing variants show that both techniques improve the efficiency of parallelization, and speculation achieves more significant improvement.},
  keywords={planning and coordination methods for multiple robots}
}

Downloads: 0