Cooperative Pathfinding Export

@article{citeulike:5300555, abstract = {When a single unit pathfinds through a map, basic A* search is perfectly adequate. But when multiple units are moving at the same time, this approach can break down, often with frustrating consequences for the player. Perhaps you have watched in despair as your twenty prized samurai all try at once to cross a narrow bridge, and then run in circles until they are annihilated. Or maybe your captain has wandered off behind enemy lines when two scouts have crossed his intended route. With cooperative pathfinding, these problems can be consigned to history. Units will move efficiently through the map, avoiding each other's paths and getting out of the way when necessary.}, address = {Cambridge, MA}, author = {Silver, David}, booktitle = {Game AI Programming Wisdom 3}, citeulike-article-id = {5300555}, comment = {similar paper published in the proceedings of AIIDE 2005}, editor = {Rabin, S.}, isbn = {1584504579}, keywords = {abm, algorithm, animation, collective, cooperative, crowd, distributed, evacuation, games, group, maps, navigation, obstacle\_avoidance, path\_planning, pedestrian, planning, swarm\_intelligence, team, vehicle}, posted-at = {2009-07-30 01:01:53}, priority = {2}, publisher = {Charles River}, title = {Cooperative Pathfinding}, year = {2006} }

TY - JOUR ID - citeulike:5300555 L3 - citeulike-article-id:5300555 N2 - When a single unit pathfinds through a map, basic A* search is perfectly adequate. But when multiple units are moving at the same time, this approach can break down, often with frustrating consequences for the player. Perhaps you have watched in despair as your twenty prized samurai all try at once to cross a narrow bridge, and then run in circles until they are annihilated. Or maybe your captain has wandered off behind enemy lines when two scouts have crossed his intended route. With cooperative pathfinding, these problems can be consigned to history. Units will move efficiently through the map, avoiding each other's paths and getting out of the way when necessary. SN - 1584504579 AD - Cambridge, MA TI - Cooperative Pathfinding PB - Charles River T2 - Game AI Programming Wisdom 3 KW - abm KW - algorithm KW - animation KW - collective KW - cooperative KW - crowd KW - distributed KW - evacuation KW - games KW - group KW - maps KW - navigation KW - obstacle_avoidance KW - path_planning KW - pedestrian KW - planning KW - swarm_intelligence KW - team KW - vehicle N1 - similar paper published in the proceedings of AIIDE 2005 AU - Silver, David A2 - Rabin, S PY - 2006/// ER -