Collective Pathfinding in Dynamic Environments

  • Authors:
  • Carlos Astengo-Noguez;José Ramón Calzada Gómez

  • Affiliations:
  • ITESM Campus Monterrey,;ITESM Campus Monterrey,

  • Venue:
  • MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Pathfinding is a critical element of AI in many modern applications like multiple mobile robots, game industry and flock traffic navigation based on negotiation (FTN). Classical algorithms assume a unique mobile agent with a complete and accurate model of its environment. New applications demand algorithms that consider multiple agents moving in partially known and changing environments. This paper introduces a new algorithm capable of planning paths for multiple agents and takes the FTN scenario as the basis of an example.