SIGN IN
SIGN UP
Optimized algorithms for multi-agent routing
Full Text:
PDF
Buy this Article
Authors:
Akihiro Kishimoto
Future University-Hakodate, Hakodate, Hokkaido, Japan
Nathan Sturtevant
University of Alberta, Edmonton, Canada
Published in:
· Proceeding
AAMAS '08
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Pages 1585-1588
International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC
©2008
table of contents
ISBN: 978-0-9817381-2-3
2008 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 27
· Downloads (cumulative): 191
· Citation Count: 1
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
a
algorithms
artificial intelligence
auction
clique abstraction
dijkstra's algorithm
multi-robot routing
pathfinding
shortest-distance computation
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder