Back to Results
First PageMeta Content
Games / Pathfinding / Fifteen puzzle / Applied mathematics / NP-complete problems / Mathematics / Game artificial intelligence


Non-optimal Multi-Agent Pathfinding is Solved (SinceGabriele R¨oger and Malte Helmert University of Basel, Switzerland {gabriele.roeger,malte.helmert}@unibas.ch Abstract
Add to Reading List

Document Date: 2013-01-07 17:29:29

Open Document

File Size: 92,05 KB

Share Result on Facebook

Company

Wilson / AAAI Press / /

Country

Switzerland / /

/

Facility

Massachusetts Institute of Technology / Malte Helmert University of Basel / /

IndustryTerm

polynomial-time algorithm / warehouse management / suboptimal algorithms / real-life applications / multi-agent path planning algorithm / recent algorithms / /

Organization

Massachusetts Institute of Technology / MIT / R¨oger and Malte Helmert University of Basel / /

Person

S LIDABLE / /

ProvinceOrState

Massachusetts / /

PublishedMedium

Journal of Artificial Intelligence Research / /

Technology

multi-agent path planning algorithm / recent algorithms / artificial intelligence / Swap algorithm / MAPP algorithm / polynomial-time algorithm / /

SocialTag